Submission #1149825


Source Code Expand

#include <bits/stdc++.h>  
 
using namespace std;
 
#define FOR(i, j, k) for(int i = j; i < k; ++i)
#define rep(i, j) FOR(i, 0, j)
#define repr(i, j) for(int i = j; i >= 0; -i)
#define INF (1 << 30)
#define MOD 1e9 + 7
 
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> P;

int N, M;
ll d[301][301];

void Warshall_Floyd() {
	FOR(k, 2, N + 1) FOR(i, 2, N + 1) FOR(j, 2, N + 1) {
		d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
	}
	return;
}

int main() {
	scanf("%d %d", &N, &M);
	rep(i, N + 1) rep(j, N + 1) d[i][j] = INF;
	rep(i, M) {
		int u, v, l;
		scanf("%d %d %d", &u, &v, &l);
		d[u][v] = d[v][u] = l;
	}
	Warshall_Floyd();
	ll ans = INF;
	FOR(i, 2, N + 1) {
		FOR(j, i + 1, N + 1) {
			ans = min(ans, d[i][j] + d[1][i] + d[j][1]);
		}
	}
	printf("%d\n", (ans == INF) ? -1 : ans);
	return 0;
}

Submission Info

Submission Time
Task C - Blue Bird
User Microbe
Language C++14 (GCC 5.4.1)
Score 100
Code Size 867 Byte
Status AC
Exec Time 41 ms
Memory 1024 KB

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:40:40: warning: format ‘%d’ expects argument of type ‘int’, but argument 2 has type ‘long long int’ [-Wformat=]
  printf("%d\n", (ans == INF) ? -1 : ans);
                                        ^
./Main.cpp:26:24: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d %d", &N, &M);
                        ^
./Main.cpp:30:32: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d %d %d", &u, &v, &l);
                                ^

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 100 / 100
Status
AC × 3
AC × 33
Set Name Test Cases
Sample sample_01.txt, sample_02.txt, sample_03.txt
All sample_01.txt, sample_02.txt, sample_03.txt, subtask1_01.txt, subtask1_02.txt, subtask1_03.txt, subtask1_04.txt, subtask1_05.txt, subtask1_06.txt, subtask1_07.txt, subtask1_08.txt, subtask1_09.txt, subtask1_10.txt, subtask1_11.txt, subtask1_12.txt, subtask1_13.txt, subtask1_14.txt, subtask1_15.txt, subtask1_16.txt, subtask1_17.txt, subtask1_18.txt, subtask1_19.txt, subtask1_20.txt, subtask1_21.txt, subtask1_22.txt, subtask1_23.txt, subtask1_24.txt, subtask1_25.txt, subtask1_26.txt, subtask1_27.txt, subtask1_28.txt, subtask1_29.txt, subtask1_30.txt
Case Name Status Exec Time Memory
sample_01.txt AC 1 ms 256 KB
sample_02.txt AC 1 ms 256 KB
sample_03.txt AC 1 ms 256 KB
subtask1_01.txt AC 12 ms 640 KB
subtask1_02.txt AC 13 ms 768 KB
subtask1_03.txt AC 26 ms 896 KB
subtask1_04.txt AC 1 ms 384 KB
subtask1_05.txt AC 6 ms 640 KB
subtask1_06.txt AC 25 ms 768 KB
subtask1_07.txt AC 4 ms 512 KB
subtask1_08.txt AC 4 ms 512 KB
subtask1_09.txt AC 23 ms 768 KB
subtask1_10.txt AC 11 ms 640 KB
subtask1_11.txt AC 1 ms 256 KB
subtask1_12.txt AC 17 ms 768 KB
subtask1_13.txt AC 4 ms 512 KB
subtask1_14.txt AC 3 ms 512 KB
subtask1_15.txt AC 41 ms 896 KB
subtask1_16.txt AC 35 ms 896 KB
subtask1_17.txt AC 32 ms 1024 KB
subtask1_18.txt AC 37 ms 896 KB
subtask1_19.txt AC 37 ms 896 KB
subtask1_20.txt AC 33 ms 896 KB
subtask1_21.txt AC 34 ms 896 KB
subtask1_22.txt AC 40 ms 896 KB
subtask1_23.txt AC 41 ms 896 KB
subtask1_24.txt AC 33 ms 896 KB
subtask1_25.txt AC 36 ms 896 KB
subtask1_26.txt AC 39 ms 896 KB
subtask1_27.txt AC 37 ms 896 KB
subtask1_28.txt AC 33 ms 896 KB
subtask1_29.txt AC 39 ms 896 KB
subtask1_30.txt AC 32 ms 896 KB