Submission #3727388
Source Code Expand
#include<bits/stdc++.h> #define INF 1e9 #define llINF 1e18 #define MOD 1000000007 #define pb push_back #define mp make_pair #define F first #define S second #define ll long long #define ALL(a) (a).begin(),(a).end() #define Yes(hoge) cout<<((hoge)?"Yes":"No")<<endl; #define YES(hoge) cout<<((hoge)?"YES":"NO")<<endl; typedef struct aaaaa{ int x,y,t; }Grid; using namespace std; typedef struct E{ int to,cost; }edge; const int MAX_V=2555; const int Inf=1e9; vector<vector<edge> >E(MAX_V); int d[MAX_V][MAX_V]; void dijkstra(int s){ priority_queue<pair<int,int>,vector<pair<int,int> >,greater<pair<int,int> > >que; fill_n(d[s],MAX_V,Inf); d[s][s] = 0; que.push(pair<int,int>(0,s)); while(!que.empty()){ pair<int,int> p=que.top();que.pop(); int v = p.second; if(d[s][v]<p.first)continue; for(int j=0;j<E[v].size();j++){ edge t = E[v][j]; if(d[s][t.to]>d[s][v]+t.cost){ d[s][t.to]=d[s][v]+t.cost; que.push(pair<int,int>(d[s][t.to],t.to)); } } } } int main(){ int n,m,r,t;cin>>n>>m>>r>>t; for(int i=0;i<m;i++){ int a,b,c;cin>>a>>b>>c; edge e;e.to=b-1;e.cost=c; E[a-1].pb(e); e.to=a-1; E[b-1].pb(e); } for(int i=0;i<n;i++) dijkstra(i); int ans=0; vector<vector<double> >kame(n); for(int i=0;i<n;i++){ for(int j=0;j<n;j++){ if(i==j)continue; kame[i].pb((double)d[j][i]/t); } sort(ALL(kame[i])); } for(int i=0;i<n;i++){//mokuteki for(int j=0;j<n;j++){//usa if(i==j)continue; ans+=lower_bound(ALL(kame[i]),(double)d[j][i]/r)-kame[i].begin(); // cout<<i<<" "<<j<<" "<<ans<<endl; } } cout<<ans<<endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | C - ウサギとカメ |
User | shi |
Language | C++14 (GCC 5.4.1) |
Score | 0 |
Code Size | 1730 Byte |
Status | WA |
Exec Time | 1517 ms |
Memory | 84352 KB |
Judge Result
Set Name | Sample | All | ||||||
---|---|---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 0 / 100 | ||||||
Status |
|
|
Set Name | Test Cases |
---|---|
Sample | subtask0_sample-01.txt, subtask0_sample-02.txt |
All | subtask0_sample-01.txt, subtask0_sample-02.txt, subtask1_01.txt, subtask1_02.txt, subtask1_03.txt, subtask1_04.txt, subtask1_05.txt, subtask1_06.txt, subtask1_07.txt, subtask1_08.txt, subtask1_09.txt, subtask1_10.txt, subtask1_11.txt, subtask1_12.txt, subtask1_13.txt, subtask1_14.txt, subtask1_15.txt, subtask1_16.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
subtask0_sample-01.txt | AC | 1 ms | 384 KB |
subtask0_sample-02.txt | AC | 1 ms | 384 KB |
subtask1_01.txt | AC | 1 ms | 512 KB |
subtask1_02.txt | AC | 2 ms | 640 KB |
subtask1_03.txt | AC | 2 ms | 640 KB |
subtask1_04.txt | AC | 1 ms | 384 KB |
subtask1_05.txt | AC | 8 ms | 2688 KB |
subtask1_06.txt | WA | 11 ms | 2688 KB |
subtask1_07.txt | AC | 35 ms | 5632 KB |
subtask1_08.txt | WA | 42 ms | 6016 KB |
subtask1_09.txt | AC | 369 ms | 33152 KB |
subtask1_10.txt | AC | 388 ms | 35712 KB |
subtask1_11.txt | AC | 153 ms | 14976 KB |
subtask1_12.txt | WA | 1465 ms | 84224 KB |
subtask1_13.txt | WA | 1456 ms | 84224 KB |
subtask1_14.txt | WA | 1454 ms | 84352 KB |
subtask1_15.txt | AC | 866 ms | 52992 KB |
subtask1_16.txt | WA | 1517 ms | 84352 KB |