Submission #1127102
Source Code Expand
#include <bits/stdc++.h> #define rep(i,n) for(int i=0;i<n;i++) using namespace std; const int MAX_N = 100; const int MAX_M = 1000; const int INF = 1e8; int cnt, N, M; bool used[MAX_N]; int dist[MAX_N][MAX_N]; int cost[MAX_N][MAX_N] {}; void dijkstra(int s) { fill(used, used + N, false); dist[s][s] = 0; while (1) { int u = -1; rep(v, N) { if (!used[v] && (u == -1 || dist[s][v] < dist[s][u])) u = v; } if (u == -1) break; used[u] = true; rep(v, N) { dist[s][v] = min(dist[s][v], dist[s][u] + cost[u][v]); } } } main() { cin >> N >> M; rep(i, M) { int a, b, c; cin >> a >> b >> c; a--; b--; cost[a][b] = cost[b][a] = c; } fill((int*)dist, (int*)(dist + N), INF); rep(s, N) dijkstra(s); cnt = 0; rep(i, N) { rep(j, N) { if (i >= j || cost[i][j] == 0) continue; bool shortest = false; rep(s, N) { if (dist[s][j] == dist[s][i] + cost[i][j]) { shortest = true; continue; } } if (shortest) cnt++; } } cout << M - cnt << endl; }
Submission Info
Submission Time | |
---|---|
Task | D - Candidates of No Shortest Paths |
User | hrbt |
Language | C++14 (GCC 5.4.1) |
Score | 0 |
Code Size | 1136 Byte |
Status | WA |
Exec Time | 6 ms |
Memory | 384 KB |
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 | 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 | WA | 1 ms | 256 KB |
subtask_1_02.txt | WA | 2 ms | 256 KB |
subtask_1_03.txt | WA | 4 ms | 384 KB |
subtask_1_04.txt | WA | 5 ms | 256 KB |
subtask_1_05.txt | WA | 5 ms | 384 KB |
subtask_1_06.txt | WA | 1 ms | 256 KB |
subtask_1_07.txt | WA | 2 ms | 256 KB |
subtask_1_08.txt | WA | 5 ms | 256 KB |
subtask_1_09.txt | WA | 5 ms | 256 KB |
subtask_1_10.txt | WA | 5 ms | 256 KB |
subtask_1_11.txt | WA | 1 ms | 256 KB |
subtask_1_12.txt | WA | 2 ms | 256 KB |
subtask_1_13.txt | WA | 5 ms | 256 KB |
subtask_1_14.txt | WA | 5 ms | 256 KB |
subtask_1_15.txt | WA | 5 ms | 256 KB |
subtask_1_16.txt | AC | 1 ms | 256 KB |
subtask_1_17.txt | AC | 1 ms | 256 KB |
subtask_1_18.txt | AC | 2 ms | 256 KB |
subtask_1_19.txt | AC | 2 ms | 256 KB |
subtask_1_20.txt | WA | 2 ms | 256 KB |
subtask_1_21.txt | WA | 1 ms | 256 KB |
subtask_1_22.txt | WA | 2 ms | 256 KB |
subtask_1_23.txt | WA | 2 ms | 256 KB |
subtask_1_24.txt | WA | 5 ms | 256 KB |
subtask_1_25.txt | WA | 3 ms | 256 KB |
subtask_1_26.txt | WA | 3 ms | 256 KB |
subtask_1_27.txt | WA | 6 ms | 256 KB |
subtask_1_28.txt | AC | 5 ms | 384 KB |