Submission #1441357


Source Code Expand

#include<iostream>
#include<cstdio>
using namespace std;
int dist[110][110];
int a[110],b[110],c[110];
int n,m;
int ans;
int main()
{
	scanf("%d%d",&n,&m);
	for(int i=1;i<=n;i++)
	{
		for(int j=1;j<=n;j++)dist[i][j]=1e9;
	}
	for(int i=1;i<=m;i++)
	{
		scanf("%d%d%d",a+i,b+i,c+i);
		dist[a[i]][b[i]]=dist[b[i]][a[i]]=c[i];
	}
	for(int k=1;k<=n;k++)
	{
		for(int i=1;i<=n;i++)
		{
			if(i==k)continue;
			for(int j=1;j<=n;j++)
			{
				if(i==j || k==j)continue;
				dist[i][j]=min(dist[i][j],dist[i][k]+dist[k][j]);
			}
		}
	}
	for(int i=1;i<=m;i++)
	{
		if(dist[a[i]][b[i]]!=c[i])ans++;
	}
	printf("%d",ans);
	return 0;
}

Submission Info

Submission Time
Task D - Candidates of No Shortest Paths
User ASSWECAN
Language C++14 (GCC 5.4.1)
Score 0
Code Size 659 Byte
Status RE
Exec Time 97 ms
Memory 256 KB

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:10:21: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d%d",&n,&m);
                     ^
./Main.cpp:17:30: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d%d%d",a+i,b+i,c+i);
                              ^

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 0 / 400
Status
AC × 2
AC × 18
WA × 1
RE × 11
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 AC 1 ms 256 KB
sample_02.txt AC 1 ms 256 KB
subtask_1_01.txt AC 1 ms 256 KB
subtask_1_02.txt AC 1 ms 256 KB
subtask_1_03.txt AC 2 ms 256 KB
subtask_1_04.txt AC 3 ms 256 KB
subtask_1_05.txt RE 97 ms 256 KB
subtask_1_06.txt AC 1 ms 256 KB
subtask_1_07.txt AC 1 ms 256 KB
subtask_1_08.txt AC 2 ms 256 KB
subtask_1_09.txt AC 3 ms 256 KB
subtask_1_10.txt AC 3 ms 256 KB
subtask_1_11.txt AC 1 ms 256 KB
subtask_1_12.txt AC 2 ms 256 KB
subtask_1_13.txt AC 3 ms 256 KB
subtask_1_14.txt WA 3 ms 256 KB
subtask_1_15.txt AC 3 ms 256 KB
subtask_1_16.txt AC 1 ms 256 KB
subtask_1_17.txt RE 95 ms 256 KB
subtask_1_18.txt RE 95 ms 256 KB
subtask_1_19.txt RE 96 ms 256 KB
subtask_1_20.txt RE 95 ms 256 KB
subtask_1_21.txt AC 1 ms 256 KB
subtask_1_22.txt AC 1 ms 256 KB
subtask_1_23.txt RE 96 ms 256 KB
subtask_1_24.txt RE 96 ms 256 KB
subtask_1_25.txt RE 96 ms 256 KB
subtask_1_26.txt RE 96 ms 256 KB
subtask_1_27.txt RE 97 ms 256 KB
subtask_1_28.txt RE 97 ms 256 KB