Submission #1070606
Source Code Expand
#include <bits/stdc++.h>
const int inf = 1e9;
using namespace std;
int di[1010][1010];
struct DATE{
int left;
int right;
int len;
}date[1010];
int main(){
int n,m,a,b,c;
scanf("%d%d",&n,&m);
for(int i=1;i<=n;i++){
for(int j=1;j<=n;j++){
if(i==j)
di[i][j]=0;
else {
di[i][j]=inf;
di[j][i]=inf;
}
}
}
for(int i=0;i<m;i++){
scanf("%d%d%d",&date[i].left,&date[i].right,&date[i].len);
di[date[i].left][date[i].right]=date[i].len;
di[date[i].left][date[i].right]=date[i].len;
}
for(int i=1;i<=n;i++){
for(int j=1;j<=n;j++){
for(int k=1;k<=n;k++){
di[j][k]=min(di[j][k],di[i][j]+di[i][k]);
}
}
}
int ans=m;
for(int i=0;i<m;i++){
int kk=0;
a=date[i].left;b=date[i].right;c=date[i].len;
for(int j=1;j<=n;j++){
if(di[j][a]+c==di[j][b])
kk=1;
}
if(kk)
ans--;
}
cout<<ans<<endl;
return 0;
}
Submission Info
Compile Error
./Main.cpp: In function ‘int main()’:
./Main.cpp:14:22: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
scanf("%d%d",&n,&m);
^
./Main.cpp:26:62: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
scanf("%d%d%d",&date[i].left,&date[i].right,&date[i].len);
^
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 |
AC |
2 ms |
256 KB |
subtask_1_01.txt |
AC |
3 ms |
256 KB |
subtask_1_02.txt |
AC |
3 ms |
384 KB |
subtask_1_03.txt |
AC |
4 ms |
640 KB |
subtask_1_04.txt |
AC |
4 ms |
640 KB |
subtask_1_05.txt |
WA |
4 ms |
640 KB |
subtask_1_06.txt |
WA |
3 ms |
384 KB |
subtask_1_07.txt |
AC |
3 ms |
512 KB |
subtask_1_08.txt |
AC |
4 ms |
640 KB |
subtask_1_09.txt |
AC |
4 ms |
640 KB |
subtask_1_10.txt |
AC |
4 ms |
640 KB |
subtask_1_11.txt |
AC |
3 ms |
384 KB |
subtask_1_12.txt |
AC |
3 ms |
512 KB |
subtask_1_13.txt |
AC |
4 ms |
640 KB |
subtask_1_14.txt |
WA |
4 ms |
640 KB |
subtask_1_15.txt |
AC |
4 ms |
640 KB |
subtask_1_16.txt |
AC |
3 ms |
256 KB |
subtask_1_17.txt |
AC |
3 ms |
384 KB |
subtask_1_18.txt |
AC |
3 ms |
384 KB |
subtask_1_19.txt |
AC |
3 ms |
384 KB |
subtask_1_20.txt |
WA |
3 ms |
384 KB |
subtask_1_21.txt |
WA |
3 ms |
256 KB |
subtask_1_22.txt |
WA |
3 ms |
512 KB |
subtask_1_23.txt |
WA |
3 ms |
384 KB |
subtask_1_24.txt |
WA |
4 ms |
640 KB |
subtask_1_25.txt |
WA |
3 ms |
512 KB |
subtask_1_26.txt |
WA |
4 ms |
512 KB |
subtask_1_27.txt |
WA |
5 ms |
640 KB |
subtask_1_28.txt |
AC |
5 ms |
640 KB |