Submission #1481415

---

Source Code Expand

#include<bits/stdc++.h>

using namespace std;

const int INF = 1 << 29;

int main()
{
  int N, M, R, T;
  int G[2500][2500];
  fill_n(*G, 2500 * 2500, INF);

  cin >> N >> M >> R >> T;
  for(int i = 0; i < M; i++) {
    int A, B, C;
    cin >> A >> B >> C;
    --A, --B;
    G[A][B] = C;
    G[B][A] = C;
  }
  for(int k = 0; k < N; k++) {
    for(int i = 0; i < N; i++) {
      for(int j = 0; j < N; j++) {
        G[i][j] = min(G[i][j], G[i][k] + G[k][j]);
      }
    }
  }

}

Submission Info

Judge Result