Submission #1406749

---

Source Code Expand

#include <bits/stdc++.h>
#define ll long long
#define INF 1000000005
#define MOD 1000000007
#define EPS 1e-10
#define rep(i,n) for(int i=0;i<(int)n;++i)
#define each(a, b) for(auto (a): (b))
#define all(v) (v).begin(),(v).end()
#define fi first
#define se second
#define pb push_back
#define show(x) cout <<#x<<" = "<<(x)<<endl
#define spair(p) cout <<#p<<": "<<p.fi<<" "<<p.se<<endl
#define svec(v) cout<<#v<<":";rep(kbrni,v.size())cout<<" "<<v[kbrni];cout<<endl
#define sset(s) cout<<#s<<":";each(kbrni,s)cout <<" "<<kbrni;cout<<endl

using namespace std;

typedef pair<int,int>P;

const int MAX_N = 2501;

struct edge{
    int to;
    int cost;
};

int n,m,R,T;
ll d[MAX_N][MAX_N];
double usagi[MAX_N][MAX_N];
double kame[MAX_N][MAX_N];
vector<edge> G[MAX_N];

void dijkstra(int s)
{
	priority_queue<P,vector<P>,greater<P> > que;
	d[s][s] = 0;
	que.push(P(0,s));
	while(!que.empty()){
		P p = que.top();
		que.pop();
		int v = p.second;
		if(d[s][v] < p.first) continue;
		vector<edge>::iterator it = G[v].begin();
		rep(i,G[v].size()){
			if(d[s][G[v][i].to] > d[s][v] + G[v][i].cost){
				d[s][G[v][i].to] = d[s][v] + G[v][i].cost;
				que.push(P(d[s][G[v][i].to],G[v][i].to));
			}
		}
	}
}

int main()
{
    cin >> n >> m >> R >> T;
    rep(i,n){
        rep(j,n){
            d[i][j] = INF;
        }
    }
    rep(i,m){
        int a,b,c;
        cin >> a >> b >> c;
        G[a-1].pb((edge){b-1,c});
        G[b-1].pb((edge){a-1,c});
    }
    rep(i,n){
        dijkstra(i);
    }
    rep(i,n){
        rep(j,n){
            if(i == j){
                usagi[j][i] = INF;
                kame[j][i] = INF;
            }else{
                usagi[j][i] = (double)d[i][j] / R;
                kame[j][i] = (double)d[i][j] / T;
            }
        }
    }
    ll ans = 0;
    rep(i,n){
        vector<int> vec(n,0);
        rep(j,n){
            if(j != i){
                if(kame[i][j] <= usagi[i][j]-EPS){
                    vec[j]++;
                }
            }
        }
        sort(kame[i],kame[i]+n);
        rep(j,n){
            if(j != i){
                double cri = usagi[i][j];
                int cnt = lower_bound(kame[i],kame[i]+n,cri-EPS) - kame[i];
                ans += (cnt-vec[j]);
            }
        }
    }
    cout << ans << "\n";
    return 0;
}

Submission Info

Judge Result