Submission #3700194
Source Code Expand
#include <algorithm> #include <bitset> #include <cctype> #include <chrono> #include <cmath> #include <cstdio> #include <ctime> #include <deque> #include <iostream> #include <map> #include <queue> #include <random> #include <string> #include <unordered_map> #include <vector> using namespace std; #define FOR(i,m,n) for(int i=(m);i<(n);++i) #define REP(i,n) FOR(i,0,n) #define ALL(v) (v).begin(),(v).end() const int INF = 0x3f3f3f3f; const long long LINF = 0x3f3f3f3f3f3f3f3fLL; /*----------------------------------------*/ int main() { cin.tie(0); ios::sync_with_stdio(false); // freopen("input.txt", "r", stdin); int t; cin >> t; REP(i, t) { int n; cin >> n; vector<vector<int> > a(n, vector<int>(n)); REP(i, n) REP(j, n) cin >> a[i][j]; bool ok = true; REP(start, n) { REP(goal, n) { if (start == goal) { if (a[start][goal] == 0) continue; ok = false; } REP(k, n) { if (a[start][k] == -1 || a[k][goal] == -1 || a[start][goal] == -1 || a[start][k] + a[k][goal] >= a[start][goal]) continue; ok = false; } } } cout << (ok? "YES" : "NO") << "\n"; } return 0; }
Submission Info
Submission Time | |
---|---|
Task | C - 最短経路 |
User | emthrm |
Language | C++14 (GCC 5.4.1) |
Score | 0 |
Code Size | 1233 Byte |
Status | WA |
Exec Time | 5 ms |
Memory | 256 KB |
Judge Result
Set Name | All | ||||
---|---|---|---|---|---|
Score / Max Score | 0 / 100 | ||||
Status |
|
Set Name | Test Cases |
---|---|
All | 00_sample.txt, 10_random_00.txt, 10_random_01.txt, 10_random_02.txt, 10_random_03.txt, 10_random_04.txt, 10_random_05.txt, 10_random_06.txt, 10_random_07.txt, 10_random_08.txt, 10_random_09.txt, 10_random_10.txt, 10_random_11.txt, 10_random_12.txt, 10_random_13.txt, 10_random_14.txt, 10_random_15.txt, 10_random_16.txt, 10_random_17.txt, 10_random_18.txt, 10_random_19.txt, 10_random_20.txt, 10_random_21.txt, 10_random_22.txt, 10_random_23.txt, 10_random_24.txt, 10_random_25.txt, 10_random_26.txt, 10_random_27.txt, 10_random_28.txt, 10_random_29.txt, 22_random_30.txt, 22_random_31.txt, 23_coplete_32.txt, 23_coplete_33.txt, 24_path_34.txt, 24_path_35.txt, 25_tree_36.txt, 25_tree_37.txt, 26_noedge_38.txt, 27_dot_39.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
00_sample.txt | AC | 1 ms | 256 KB |
10_random_00.txt | WA | 5 ms | 256 KB |
10_random_01.txt | WA | 5 ms | 256 KB |
10_random_02.txt | WA | 5 ms | 256 KB |
10_random_03.txt | WA | 5 ms | 256 KB |
10_random_04.txt | WA | 5 ms | 256 KB |
10_random_05.txt | WA | 5 ms | 256 KB |
10_random_06.txt | WA | 5 ms | 256 KB |
10_random_07.txt | WA | 5 ms | 256 KB |
10_random_08.txt | WA | 5 ms | 256 KB |
10_random_09.txt | WA | 5 ms | 256 KB |
10_random_10.txt | WA | 5 ms | 256 KB |
10_random_11.txt | WA | 5 ms | 256 KB |
10_random_12.txt | WA | 5 ms | 256 KB |
10_random_13.txt | WA | 5 ms | 256 KB |
10_random_14.txt | WA | 5 ms | 256 KB |
10_random_15.txt | WA | 5 ms | 256 KB |
10_random_16.txt | WA | 5 ms | 256 KB |
10_random_17.txt | WA | 5 ms | 256 KB |
10_random_18.txt | WA | 5 ms | 256 KB |
10_random_19.txt | WA | 5 ms | 256 KB |
10_random_20.txt | WA | 5 ms | 256 KB |
10_random_21.txt | WA | 5 ms | 256 KB |
10_random_22.txt | WA | 5 ms | 256 KB |
10_random_23.txt | WA | 5 ms | 256 KB |
10_random_24.txt | WA | 5 ms | 256 KB |
10_random_25.txt | WA | 5 ms | 256 KB |
10_random_26.txt | WA | 5 ms | 256 KB |
10_random_27.txt | WA | 5 ms | 256 KB |
10_random_28.txt | WA | 5 ms | 256 KB |
10_random_29.txt | WA | 5 ms | 256 KB |
22_random_30.txt | AC | 4 ms | 256 KB |
22_random_31.txt | AC | 5 ms | 256 KB |
23_coplete_32.txt | AC | 4 ms | 256 KB |
23_coplete_33.txt | AC | 4 ms | 256 KB |
24_path_34.txt | WA | 5 ms | 256 KB |
24_path_35.txt | WA | 5 ms | 256 KB |
25_tree_36.txt | WA | 4 ms | 256 KB |
25_tree_37.txt | WA | 4 ms | 256 KB |
26_noedge_38.txt | AC | 4 ms | 256 KB |
27_dot_39.txt | AC | 1 ms | 256 KB |