Submission #3775226
Source Code Expand
#include <bits/stdc++.h>
int main()
{
int n, m, distance[100][100]{}, edge[100][100]{};
std::fill(distance[0], distance[0] + 10000, 1000000000);
scanf("%d%d", &n, &m);
for (int i = 0; i < m; i++)
{
int a, b, c;
scanf("%d%d%d", &a, &b, &c);
a--; b--;
distance[a][b] = distance[b][a]
= edge[a][b] = edge[b][a] = c;
}
for (int i = 0; i < n; i++)
distance[i][i] = 0;
for (int i = 0; i < n; i++)
for (int j = 0; j < n; j++)
for (int k = j + 1; k < n; k++)
distance[k][j] = distance[j][k] = std::min(distance[j][k], distance[j][i] + distance[i][k]);
int count{};
for(int i = 0; i < n; i++)
for (int j = i + 1; j < n; j++)
if (distance[i][j] < edge[i][j])
count++;
printf("%d\n", count);
return 0;
}
Submission Info
Compile Error
./Main.cpp: In function ‘int main()’:
./Main.cpp:7:23: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
scanf("%d%d", &n, &m);
^
./Main.cpp:11:30: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
scanf("%d%d%d", &a, &b, &c);
^
Judge Result
Set Name |
Sample |
All |
Score / Max Score |
0 / 0 |
400 / 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 |
AC |
1 ms |
384 KB |
sample_02.txt |
AC |
1 ms |
256 KB |
subtask_1_01.txt |
AC |
1 ms |
384 KB |
subtask_1_02.txt |
AC |
2 ms |
256 KB |
subtask_1_03.txt |
AC |
2 ms |
384 KB |
subtask_1_04.txt |
AC |
2 ms |
384 KB |
subtask_1_05.txt |
AC |
2 ms |
256 KB |
subtask_1_06.txt |
AC |
1 ms |
256 KB |
subtask_1_07.txt |
AC |
2 ms |
384 KB |
subtask_1_08.txt |
AC |
2 ms |
256 KB |
subtask_1_09.txt |
AC |
2 ms |
256 KB |
subtask_1_10.txt |
AC |
2 ms |
384 KB |
subtask_1_11.txt |
AC |
1 ms |
384 KB |
subtask_1_12.txt |
AC |
2 ms |
384 KB |
subtask_1_13.txt |
AC |
2 ms |
256 KB |
subtask_1_14.txt |
AC |
2 ms |
384 KB |
subtask_1_15.txt |
AC |
2 ms |
384 KB |
subtask_1_16.txt |
AC |
1 ms |
384 KB |
subtask_1_17.txt |
AC |
1 ms |
384 KB |
subtask_1_18.txt |
AC |
1 ms |
384 KB |
subtask_1_19.txt |
AC |
2 ms |
384 KB |
subtask_1_20.txt |
AC |
1 ms |
384 KB |
subtask_1_21.txt |
AC |
1 ms |
384 KB |
subtask_1_22.txt |
AC |
2 ms |
384 KB |
subtask_1_23.txt |
AC |
1 ms |
384 KB |
subtask_1_24.txt |
AC |
2 ms |
384 KB |
subtask_1_25.txt |
AC |
2 ms |
256 KB |
subtask_1_26.txt |
AC |
2 ms |
256 KB |
subtask_1_27.txt |
AC |
2 ms |
256 KB |
subtask_1_28.txt |
AC |
2 ms |
256 KB |