Submission #3826307
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 <set> #include <string> #include <tuple> #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(repeat, t) { int n; cin >> n; vector<vector<int> > a(n, vector<int>(n)); bool ok = true; REP(i, n) REP(j, n) { cin >> a[i][j]; if (i == j && a[i][j] != 0) ok = false; } REP(i, n) REP(j, n) REP(k, n) { if (a[i][k] != -1 && a[k][j] != -1) { if (a[i][j] == -1) ok = false; else if (a[i][j] > a[i][k] + a[k][j]) 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 | 100 |
Code Size | 1179 Byte |
Status | AC |
Exec Time | 5 ms |
Memory | 256 KB |
Judge Result
Set Name | All | ||
---|---|---|---|
Score / Max Score | 100 / 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 | AC | 5 ms | 256 KB |
10_random_01.txt | AC | 5 ms | 256 KB |
10_random_02.txt | AC | 5 ms | 256 KB |
10_random_03.txt | AC | 5 ms | 256 KB |
10_random_04.txt | AC | 5 ms | 256 KB |
10_random_05.txt | AC | 5 ms | 256 KB |
10_random_06.txt | AC | 5 ms | 256 KB |
10_random_07.txt | AC | 5 ms | 256 KB |
10_random_08.txt | AC | 5 ms | 256 KB |
10_random_09.txt | AC | 5 ms | 256 KB |
10_random_10.txt | AC | 5 ms | 256 KB |
10_random_11.txt | AC | 5 ms | 256 KB |
10_random_12.txt | AC | 5 ms | 256 KB |
10_random_13.txt | AC | 5 ms | 256 KB |
10_random_14.txt | AC | 5 ms | 256 KB |
10_random_15.txt | AC | 5 ms | 256 KB |
10_random_16.txt | AC | 5 ms | 256 KB |
10_random_17.txt | AC | 5 ms | 256 KB |
10_random_18.txt | AC | 5 ms | 256 KB |
10_random_19.txt | AC | 5 ms | 256 KB |
10_random_20.txt | AC | 5 ms | 256 KB |
10_random_21.txt | AC | 5 ms | 256 KB |
10_random_22.txt | AC | 5 ms | 256 KB |
10_random_23.txt | AC | 5 ms | 256 KB |
10_random_24.txt | AC | 5 ms | 256 KB |
10_random_25.txt | AC | 5 ms | 256 KB |
10_random_26.txt | AC | 5 ms | 256 KB |
10_random_27.txt | AC | 5 ms | 256 KB |
10_random_28.txt | AC | 5 ms | 256 KB |
10_random_29.txt | AC | 5 ms | 256 KB |
22_random_30.txt | AC | 4 ms | 256 KB |
22_random_31.txt | AC | 4 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 | AC | 5 ms | 256 KB |
24_path_35.txt | AC | 5 ms | 256 KB |
25_tree_36.txt | AC | 4 ms | 256 KB |
25_tree_37.txt | AC | 4 ms | 256 KB |
26_noedge_38.txt | AC | 4 ms | 256 KB |
27_dot_39.txt | AC | 1 ms | 256 KB |