Submission #1308132
Source Code Expand
//#define LOCAL #include <fstream> #include <iostream> #include <cmath> #include <algorithm> #include <vector> #include <map> #include <queue> #include <cstring> #define int long long //typedef long long ll; #define rep(i,n) for(int i=0; i<n; i++) using namespace std; const int inf = 100000000; int n, m; signed main() { #ifdef LOCAL ifstream in("input.txt"); cin.rdbuf(in.rdbuf()); #endif cin >> n >> m; int a[1000], b[1000], c[1000], dist[100][100]; rep(i,m) { cin >> a[i] >> b[i] >> c[i]; a[i]--; b[i]--; } rep(i,n) rep(j,n) { if (i == j) { dist[i][j] = 0; } else { dist[i][j] = inf; } } rep(i,m) { dist[a[i]][b[i]] = min(dist[a[i]][b[i]], c[i]); dist[b[i]][a[i]] = min(dist[b[i]][a[i]], c[i]); } rep(k,n) rep(i,n) rep(j,n) { dist[i][j] = min(dist[i][j], dist[i][k] + dist[k][j]); } int ans = m; rep(i,m) { bool shortest = false; rep(j,n) if (dist[j][a[i]] + c[i] == dist[j][b[i]]) shortest = true; if (shortest) { ans--; } } cout << ans << endl; }
Submission Info
Submission Time | |
---|---|
Task | D - Candidates of No Shortest Paths |
User | hiyokko2 |
Language | C++14 (GCC 5.4.1) |
Score | 400 |
Code Size | 1226 Byte |
Status | AC |
Exec Time | 3 ms |
Memory | 384 KB |
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 | 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 | 384 KB |
subtask_1_04.txt | AC | 2 ms | 384 KB |
subtask_1_05.txt | AC | 3 ms | 384 KB |
subtask_1_06.txt | AC | 1 ms | 256 KB |
subtask_1_07.txt | AC | 2 ms | 256 KB |
subtask_1_08.txt | AC | 2 ms | 384 KB |
subtask_1_09.txt | AC | 2 ms | 384 KB |
subtask_1_10.txt | AC | 2 ms | 384 KB |
subtask_1_11.txt | AC | 1 ms | 256 KB |
subtask_1_12.txt | AC | 2 ms | 256 KB |
subtask_1_13.txt | AC | 2 ms | 384 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 | 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 | AC | 1 ms | 256 KB |
subtask_1_21.txt | AC | 1 ms | 256 KB |
subtask_1_22.txt | AC | 2 ms | 256 KB |
subtask_1_23.txt | AC | 2 ms | 256 KB |
subtask_1_24.txt | AC | 3 ms | 384 KB |
subtask_1_25.txt | AC | 2 ms | 256 KB |
subtask_1_26.txt | AC | 2 ms | 384 KB |
subtask_1_27.txt | AC | 3 ms | 384 KB |
subtask_1_28.txt | AC | 3 ms | 384 KB |