Submission #4074577
Source Code Expand
#include <iostream> #include <algorithm> #include <cmath> #define INF 200000000000 using namespace std; typedef long long ll; ll n, m, r, a, b, c, dst[1001][1001]; void warshall_floid(){ for(ll k = 1; k <= n; k++) for(ll i = 1; i <= n; i++) for(ll j = 1; j <= n; j++) dst[i][j] = min(dst[i][k]+dst[k][j], dst[i][j]); } int main() { cin >> n >> m; for(ll i = 1; i <= n; i++){for(ll j = 1; j <= n; j++){dst[i][j] = INF;} dst[i][i] = 0;} for(ll i = 0; i < m; i++){ cin >> a >> b >> c; dst[a][b] = -c; } warshall_floid(); //for(ll i = 1; i <= n; i++){for(ll j = 1; j <= n; j++){cout << dst[i][j];}cout << endl;} bool roop = false; for(ll i = i; i <= n; i++){if(dst[i][i] != 0){roop = true;}} if(roop){cout << "inf";} else{cout << -dst[1][n];} return 0; }
Submission Info
Submission Time | |
---|---|
Task | D - Score Attack |
User | divinediscon10t |
Language | C++14 (GCC 5.4.1) |
Score | 0 |
Code Size | 812 Byte |
Status | WA |
Exec Time | 1095 ms |
Memory | 8064 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, sample_03.txt |
All | sample_01.txt, sample_02.txt, sample_03.txt, subtask_1_1.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_2.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_3.txt, subtask_1_4.txt, subtask_1_5.txt, subtask_1_6.txt, subtask_1_7.txt, subtask_1_8.txt, subtask_1_9.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
sample_01.txt | AC | 1 ms | 256 KB |
sample_02.txt | AC | 1 ms | 256 KB |
sample_03.txt | AC | 1 ms | 256 KB |
subtask_1_1.txt | WA | 94 ms | 4224 KB |
subtask_1_10.txt | AC | 1 ms | 256 KB |
subtask_1_11.txt | AC | 49 ms | 4096 KB |
subtask_1_12.txt | AC | 381 ms | 6400 KB |
subtask_1_13.txt | AC | 1087 ms | 8064 KB |
subtask_1_14.txt | AC | 1088 ms | 8064 KB |
subtask_1_15.txt | AC | 1090 ms | 8064 KB |
subtask_1_16.txt | AC | 1 ms | 256 KB |
subtask_1_17.txt | AC | 2 ms | 640 KB |
subtask_1_18.txt | AC | 270 ms | 6400 KB |
subtask_1_19.txt | AC | 951 ms | 7680 KB |
subtask_1_2.txt | WA | 1089 ms | 8064 KB |
subtask_1_20.txt | AC | 1095 ms | 8064 KB |
subtask_1_21.txt | AC | 1087 ms | 8064 KB |
subtask_1_22.txt | AC | 1089 ms | 8064 KB |
subtask_1_23.txt | WA | 1 ms | 256 KB |
subtask_1_24.txt | AC | 451 ms | 6400 KB |
subtask_1_25.txt | WA | 94 ms | 4224 KB |
subtask_1_26.txt | AC | 1088 ms | 8064 KB |
subtask_1_27.txt | WA | 1088 ms | 8064 KB |
subtask_1_3.txt | WA | 498 ms | 6400 KB |
subtask_1_4.txt | WA | 1088 ms | 8064 KB |
subtask_1_5.txt | AC | 223 ms | 6400 KB |
subtask_1_6.txt | AC | 1089 ms | 8064 KB |
subtask_1_7.txt | AC | 895 ms | 7552 KB |
subtask_1_8.txt | AC | 1088 ms | 8064 KB |
subtask_1_9.txt | AC | 1 ms | 256 KB |