Submission #1478514

---

Source Code Expand

// 基本テンプレート

#include <iostream>
#include <iomanip>
#include <cstdio>
#include <string>
#include <cstring>
#include <deque>
#include <list>
#include <queue>
#include <stack>
#include <vector>
#include <utility>
#include <algorithm>
#include <map>
#include <set>
#include <complex>
#include <cmath>
#include <limits>
#include <cfloat>
#include <climits>
#include <ctime>
#include <cassert>
#include <numeric>
#include <functional>
using namespace std;

#define rep(i,a,n) for(int (i)=(a); (i)<(n); (i)++)
#define repq(i,a,n) for(int (i)=(a); (i)<=(n); (i)++)
#define repr(i,a,n) for(int (i)=(a); (i)>=(n); (i)--)
#define int long long int

template<typename T> void chmax(T &a, T b) {a = max(a, b);}
template<typename T> void chmin(T &a, T b) {a = min(a, b);}
template<typename T> void chadd(T &a, T b) {a = a + b;}

typedef pair<int, int> pii;
typedef long long ll;

int dx[] = {0, 0, 1, -1};
int dy[] = {1, -1, 0, 0};
constexpr ll INF = 1001001001001001LL;
constexpr ll MOD = 1000000007LL;

int N, M, R, T;
vector<pii> G[2510];
int dist[2510];

signed main() {
    cin >> N >> M >> R >> T;
    rep(i,0,M) {
        int a, b, c; cin >> a >> b >> c;
        a--; b--;
        G[a].push_back(pii(b, c));
        G[b].push_back(pii(a, c));
    }

    int ans = 0;
    rep(i,0,N) {
        rep(j,0,N) dist[j] = (i == j ? 0 : INF);
        priority_queue< pii, vector<pii>, greater<pii> > q;
        q.push(pii(0, i));

        while(!q.empty()) {
            pii t = q.top(); q.pop();
            int cost = t.first, cur = t.second;
            for(auto e : G[cur]) {
                if(dist[e.first] > dist[cur] + e.second) {
                    dist[e.first] = dist[cur] + e.second;
                    q.push(pii(dist[e.first], e.first));
                }
            }
        }

        vector<int> v, w;
        rep(j,0,N) if(i != j) v.push_back(dist[j]);
        sort(v.begin(), v.end());
        w = v;
        int S = w.size();
        rep(j,0,S) w[j] *= T;

        rep(j,0,v.size()) {
            int idx = upper_bound(w.begin(), w.end(), R * v[j]) - w.begin();
            ans += S - idx;
            if(R < T) ans--;
        }
    }
    cout << ans << endl;
    return 0;
}

Submission Info

Judge Result