Submission #1589133

---

Source Code Expand

#include "bits/stdc++.h"
using namespace std;
#define FOR(i,j,k) for(int (i)=(j);(i)<(int)(k);++(i))
#define rep(i,j) FOR(i,0,j)
#define each(x,y) for(auto &(x):(y))
#define mp make_pair
#define MT make_tuple
#define all(x) (x).begin(),(x).end()
#define debug(x) cout<<#x<<": "<<(x)<<endl
#define smax(x,y) (x)=max((x),(y))
#define smin(x,y) (x)=min((x),(y))
#define MEM(x,y) memset((x),(y),sizeof (x))
#define sz(x) (int)(x).size()
#define rt return
using dbl = double;
using ll = long long;
using pii = pair<int, int>;
using vi = vector<int>;
using vll = vector<ll>;

// time, who(usa:0, kame:1), pos, start_pos
using P = tuple<ll, int, int, int>;
using E = pair<int, ll>;
vector<E> G[2501];
ll kame[2501];
int vis[2][2501][2501];

int main(){
    ios::sync_with_stdio(false);
    cin.tie(0);

    ll N, M, R, T;
    cin >> N >> M >> R >> T;
    rep(i, M) {
        int a, b, c;
        cin >> a >> b >> c;
        --a; --b;
        ll d = R*T*c;
        G[a].push_back({ b,d });
        G[b].push_back({ a,d });
    }

    priority_queue<P, vector<P>, greater<P> > q;
    rep(i, N) {
        rep(j, 2)q.push(P(0, j, i, i));
    }

    ll ans = 0;
    while (sz(q)) {
        ll t;
        int w, u, s;
        tie(t, w, u, s) = q.top();
        q.pop();
        if (vis[w][u][s]++)continue;
        if (u != s) {
            if (w == 0) {
                ans += kame[u];
                // スタート地点が同じ
                if (vis[1][u][s])ans--;
            } else {
                kame[u]++;
            }
        }

        ll x = w == 0 ? R : T;
        each(e, G[u]) {
            int v;
            ll d;
            tie(v, d) = e;
            if (!vis[w][v][s]) {
                q.push(P(t + d / x, w, v, s));
            }
        }
    }

    cout << ans << endl;
}

Submission Info

Judge Result