Submission #1070506
Source Code Expand
#include<iostream> #include<cmath> using namespace std; long long a[10000][10000],N,M,k,i,j; long long x[1010],y[1010],z[1010],count; const int mod=1e10; int main() { while(cin>>N>>M) { count=M; for(i=1;i<=N;i++) { for(j=1;j<=N;j++) { a[i][j]=mod; } a[i][i]=0; } for(i=1;i<=M;i++) { cin>>x[i]>>y[i]>>z[i]; a[x[i]][y[i]]=z[i]; a[y[i]][x[i]]=z[i]; } for(k=1;k<=N;k++) { for(i=1;i<=N;i++) { for(j=1;j<=N;j++) { a[i][j]=min(a[i][k]+a[k][j],a[i][j]); } } } for(i=1;i<=N;i++) { if(a[i][x[i]]+z[i]==a[i][y[i]]) count--; } cout<<count<<endl; } return 0; }
Submission Info
Submission Time | |
---|---|
Task | D - Candidates of No Shortest Paths |
User | vjudge1 |
Language | C++14 (GCC 5.4.1) |
Score | 0 |
Code Size | 876 Byte |
Status | WA |
Exec Time | 5 ms |
Memory | 768 KB |
Compile Error
./Main.cpp:6:15: warning: overflow in implicit constant conversion [-Woverflow] const int mod=1e10; ^
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 | 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 | AC | 3 ms | 256 KB |
sample_02.txt | WA | 3 ms | 256 KB |
subtask_1_01.txt | WA | 3 ms | 256 KB |
subtask_1_02.txt | AC | 3 ms | 512 KB |
subtask_1_03.txt | WA | 4 ms | 640 KB |
subtask_1_04.txt | WA | 4 ms | 768 KB |
subtask_1_05.txt | WA | 5 ms | 768 KB |
subtask_1_06.txt | WA | 3 ms | 384 KB |
subtask_1_07.txt | AC | 3 ms | 512 KB |
subtask_1_08.txt | WA | 5 ms | 768 KB |
subtask_1_09.txt | AC | 4 ms | 768 KB |
subtask_1_10.txt | WA | 5 ms | 768 KB |
subtask_1_11.txt | WA | 3 ms | 384 KB |
subtask_1_12.txt | WA | 3 ms | 512 KB |
subtask_1_13.txt | WA | 4 ms | 768 KB |
subtask_1_14.txt | WA | 5 ms | 768 KB |
subtask_1_15.txt | WA | 4 ms | 768 KB |
subtask_1_16.txt | WA | 3 ms | 256 KB |
subtask_1_17.txt | WA | 3 ms | 384 KB |
subtask_1_18.txt | WA | 3 ms | 384 KB |
subtask_1_19.txt | WA | 4 ms | 512 KB |
subtask_1_20.txt | WA | 3 ms | 384 KB |
subtask_1_21.txt | WA | 3 ms | 384 KB |
subtask_1_22.txt | WA | 3 ms | 512 KB |
subtask_1_23.txt | WA | 3 ms | 384 KB |
subtask_1_24.txt | WA | 5 ms | 768 KB |
subtask_1_25.txt | WA | 4 ms | 512 KB |
subtask_1_26.txt | WA | 4 ms | 640 KB |
subtask_1_27.txt | WA | 5 ms | 768 KB |
subtask_1_28.txt | AC | 5 ms | 768 KB |