Submission #3563704

---

Source Code Expand

#include "bits/stdc++.h"
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
const int INF = 1e9;
const ll LINF = 1e18;
inline ll gcd(ll a, ll b) { return b ? gcd(b, a%b) : a; }
inline ll lcm(ll a, ll b) { return a / gcd(a, b)*b; }
template<class S,class T> ostream& operator << (ostream& out,const pair<S,T>& o){ out << "(" << o.first << "," << o.second << ")"; return out; }
template<class T> ostream& operator << (ostream& out,const vector<T> V){ for(int i = 0; i < V.size(); i++){ out << V[i]; if(i!=V.size()-1) out << " ";} return out; }
template<class T> ostream& operator << (ostream& out,const vector<vector<T> > Mat){ for(int i = 0; i < Mat.size(); i++) { if(i != 0) out << endl; out << Mat[i];} return out; }
template<class S,class T> ostream& operator << (ostream& out,const map<S,T> mp){ out << "{ "; for(auto it = mp.begin(); it != mp.end(); it++){ out << it->first << ":" << it->second; if(mp.size()-1 != distance(mp.begin(),it)) out << ", "; } out << " }"; return out; }

/*
 <url:>
 問題文============================================================
 =================================================================
 解説=============================================================
 ================================================================
 */

struct edge{
    int u,v,cost;
    edge(){}
    edge(int u,int v,int cost):u(u),v(v),cost(cost){}
};
ll solve(){
    ll res = 0;
    int N,M,R,T; cin >> N >> M >> R >> T;
    vector<vector<edge>> G(N);
    for(int i = 0; i < M;i++){
        int a,b,c; cin >> a >> b >> c;
        a--; b--;
        G[a].push_back(edge(a,b,c));
        G[b].push_back(edge(b,a,c));
    }
    queue<int> q;
    for(int A = 0; A < N;A++){
        vector<int> dist(N,INF);
        dist[A] = 0;
        q.push(A);
        while(q.size()){
            int n = q.front(); q.pop();
            for(auto& e:G[n]){
                if(dist[e.v] > dist[e.u] + e.cost){
                    dist[e.v] = dist[e.u] + e.cost;
                    q.push(e.v);
                }
            }
        }
        
        vector<int> distT(N);
        vector<int> distR(N);
        
        for(int i = 0; i < N;i++){
            distT[i] = dist[i] * R;
            distR[i] = dist[i] * T;
        }
//        cout << A << endl;
//        cout << distT << endl;
//        cout << distR << endl;
        
        auto distRR = distR;
        sort(distR.begin(),distR.end());
        for(int B = 0; B < N; B++){
            if(A == B) continue;
            ll V = distT[B];
            ll P = N - (upper_bound(distR.begin(),distR.end(),V) - distR.begin());
            if(V < distRR[B]) P--;
            if(V < distRR[A]) P--;
            res += P;
        }
    }
    return res;
}
int main(void) {
    cin.tie(0); ios_base::sync_with_stdio(false);
    cout << solve() << endl;
    return 0;
}

Submission Info

Judge Result