Submission #1481434

---

Source Code Expand

#include<iostream>
#include<algorithm>
#include<vector>
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);
  for(int i = 0; i < N; i++) G[i][i] = 0;

  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]);
      }
    }
  }

  int ret = 0;
  for(int C = 0; C < N; C++) {
    vector< int > st;
    for(int i = 0; i < N; i++) {
      if(i == C) continue;
      st.push_back(G[C][i]);
    }
    sort(begin(st), end(st));

    int tail = 0;
    for(int i = 0; i < st.size(); i++) {
      while(tail < st.size() && 1LL * st[tail] * T <= 1LL * st[i] * R) ++tail;
      ret += st.size() - tail;
      if(tail < i) --ret;
    }
  }

  cout << ret << endl;
}

Submission Info

Judge Result