Submission #3231762
Source Code Expand
#include<iostream> #include<vector> #include<sstream> #include<string> #include<numeric> using namespace std; long input(){ long x; cin>>x; return x; } int abs(int x){ if(x>=0){ return x; }else{ return -x; } } int gcd(int x, int y){ if(x<y){ return gcd(y,x); } if(y==0){ return x; } return gcd(y,x%y); } int cost[110][110]; int d[110]; bool used[110]; int V; void dijkstra(int s){ fill(d,d+V,1000000); fill(used,used+V,false); d[s]=0; while(true){ int v=-1; for(int u=0;u<V;u++){ if(!used[u]&&(v==-1||d[u]<d[v]))v=u; } if(v==-1)break; used[v]=true; for(int u=0;u<V;u++){ d[u]=min(d[u],d[v]+cost[v][u]); } } } int main() { V=input(); int M=input(); int a[M]; int b[M]; int c[M]; for(int i=0;i<M;i++){ cin>>a[i]>>b[i]>>c[i]; cost[a[i]][b[i]]=c[i]; } int ans=M; for(int i=0;i<V;i++){ bool shortest=false; dijkstra(i); for(int j=0;j<M;j++){ if(d[a[i]+c[i]==d[b[i]]])shortest=true; } if(shortest){ ans--; } } cout<<ans<<endl; }
Submission Info
Submission Time | |
---|---|
Task | D - Candidates of No Shortest Paths |
User | doradorasuki |
Language | C++14 (GCC 5.4.1) |
Score | 0 |
Code Size | 1195 Byte |
Status | RE |
Exec Time | 296 ms |
Memory | 256 KB |
Judge Result
Set Name | Sample | All | ||||||
---|---|---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 0 / 400 | ||||||
Status |
|
|
Set Name | Test Cases |
---|---|
Sample | sample_01.txt, sample_02.txt |
All | sample_01.txt, sample_02.txt, subtask_1_01.txt, subtask_1_02.txt, subtask_1_03.txt, subtask_1_04.txt, subtask_1_05.txt, subtask_1_06.txt, subtask_1_07.txt, subtask_1_08.txt, subtask_1_09.txt, subtask_1_10.txt, subtask_1_11.txt, subtask_1_12.txt, subtask_1_13.txt, subtask_1_14.txt, subtask_1_15.txt, subtask_1_16.txt, subtask_1_17.txt, subtask_1_18.txt, subtask_1_19.txt, subtask_1_20.txt, subtask_1_21.txt, subtask_1_22.txt, subtask_1_23.txt, subtask_1_24.txt, subtask_1_25.txt, subtask_1_26.txt, subtask_1_27.txt, subtask_1_28.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
sample_01.txt | WA | 1 ms | 256 KB |
sample_02.txt | WA | 1 ms | 256 KB |
subtask_1_01.txt | RE | 296 ms | 256 KB |
subtask_1_02.txt | WA | 2 ms | 256 KB |
subtask_1_03.txt | WA | 3 ms | 256 KB |
subtask_1_04.txt | RE | 101 ms | 256 KB |
subtask_1_05.txt | WA | 5 ms | 256 KB |
subtask_1_06.txt | WA | 1 ms | 256 KB |
subtask_1_07.txt | WA | 2 ms | 256 KB |
subtask_1_08.txt | WA | 4 ms | 256 KB |
subtask_1_09.txt | WA | 4 ms | 256 KB |
subtask_1_10.txt | WA | 4 ms | 256 KB |
subtask_1_11.txt | WA | 1 ms | 256 KB |
subtask_1_12.txt | WA | 2 ms | 256 KB |
subtask_1_13.txt | RE | 101 ms | 256 KB |
subtask_1_14.txt | WA | 4 ms | 256 KB |
subtask_1_15.txt | RE | 100 ms | 256 KB |
subtask_1_16.txt | WA | 1 ms | 256 KB |
subtask_1_17.txt | WA | 1 ms | 256 KB |
subtask_1_18.txt | WA | 2 ms | 256 KB |
subtask_1_19.txt | WA | 2 ms | 256 KB |
subtask_1_20.txt | WA | 1 ms | 256 KB |
subtask_1_21.txt | WA | 1 ms | 256 KB |
subtask_1_22.txt | WA | 2 ms | 256 KB |
subtask_1_23.txt | WA | 2 ms | 256 KB |
subtask_1_24.txt | WA | 4 ms | 256 KB |
subtask_1_25.txt | WA | 2 ms | 256 KB |
subtask_1_26.txt | WA | 3 ms | 256 KB |
subtask_1_27.txt | WA | 5 ms | 256 KB |
subtask_1_28.txt | WA | 5 ms | 256 KB |