Submission #1799532
Source Code Expand
#include <iostream> #include <tuple> #include <queue> #include <algorithm> #define REP(a, b, c) for (int (a) = (b); (a) < (c); ++a) using namespace std; typedef tuple<int, int, int> tiii; const int INF = 1 << 29; int N, M; int A[100][100]; int a, b, c; queue<tiii> q; int main(void) { cin >> N >> M; fill_n(A[0], N * N, INF); for (int i = 0; i < M; ++i) { cin >> a >> b >> c; --a; --b; A[a][b] = A[b][a] = c; q.push(tiii(a, b, c)); } REP(k, 0, N) REP(i, 0, N) REP(j, 0, N) { A[i][j] = min(A[i][j], A[i][k] + A[k][j]); } int ans = M; while (!q.empty()) { tie(a, b, c) = q.front(); q.pop(); if (A[a][b] == c) --ans; } cout << ans << endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | D - Candidates of No Shortest Paths |
User | k0101 |
Language | C++14 (GCC 5.4.1) |
Score | 0 |
Code Size | 704 Byte |
Status | WA |
Exec Time | 3 ms |
Memory | 256 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 | 1 ms | 256 KB |
subtask_1_03.txt | WA | 2 ms | 256 KB |
subtask_1_04.txt | AC | 2 ms | 256 KB |
subtask_1_05.txt | AC | 3 ms | 256 KB |
subtask_1_06.txt | WA | 1 ms | 256 KB |
subtask_1_07.txt | WA | 1 ms | 256 KB |
subtask_1_08.txt | WA | 2 ms | 256 KB |
subtask_1_09.txt | AC | 2 ms | 256 KB |
subtask_1_10.txt | AC | 2 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 | 2 ms | 256 KB |
subtask_1_14.txt | AC | 2 ms | 256 KB |
subtask_1_15.txt | AC | 2 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 | 1 ms | 256 KB |
subtask_1_21.txt | WA | 1 ms | 256 KB |
subtask_1_22.txt | WA | 1 ms | 256 KB |
subtask_1_23.txt | WA | 2 ms | 256 KB |
subtask_1_24.txt | WA | 3 ms | 256 KB |
subtask_1_25.txt | WA | 2 ms | 256 KB |
subtask_1_26.txt | WA | 2 ms | 256 KB |
subtask_1_27.txt | AC | 3 ms | 256 KB |
subtask_1_28.txt | AC | 3 ms | 256 KB |