Submission #2407561
Source Code Expand
#include <cstdio> #include <iostream> #include <vector> using namespace std; long long INF = 1e18; long long x[1010][1010]; long long d[1010]; int main(){ int n, m; cin >> n >> m; for (int i = 0; i < n; i++) { for (int j = 0; j < n; j++) { x[i][j] = INF; } d[i] = INF; } d[0] = 0; for (int i = 0; i < m; i++) { int a, b; long long c; cin >> a >> b >> c; x[a-1][b-1] = -c; } for (int i = 0; i < n-1; i++) { for (int v = 0; v < n; v++) { for (int w = 0; w < n; w++) { if (x[v][w] != INF && d[w] > d[v] + x[v][w]){ d[w] = d[v] + x[v][w]; } } } } //負の経路を判定 vector<bool> roop(n); for (int v = 0; v < n; v++) { for (int w = 0; w < n; w++) { if (x[v][w] != INF && d[w] > d[v] + x[v][w]){ d[w] = d[v] + x[v][w]; roop[v] = true; roop[w] = true; } } } for (int v = 0; v < n; v++) { for (int w = 0; w < n; w++) { if (x[v][w] != INF && roop[v] == true){ roop[w] = true; } } } if (roop[n-1] == true) printf("inf\n"); else printf("%lld\n", -d[n-1]); return 0; }
Submission Info
Submission Time | |
---|---|
Task | D - Score Attack |
User | potoooooooo |
Language | C++14 (GCC 5.4.1) |
Score | 400 |
Code Size | 1209 Byte |
Status | AC |
Exec Time | 719 ms |
Memory | 8192 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, 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 | AC | 63 ms | 4224 KB |
subtask_1_10.txt | AC | 1 ms | 256 KB |
subtask_1_11.txt | AC | 35 ms | 3968 KB |
subtask_1_12.txt | AC | 258 ms | 6400 KB |
subtask_1_13.txt | AC | 674 ms | 8192 KB |
subtask_1_14.txt | AC | 693 ms | 8192 KB |
subtask_1_15.txt | AC | 719 ms | 8192 KB |
subtask_1_16.txt | AC | 1 ms | 256 KB |
subtask_1_17.txt | AC | 2 ms | 640 KB |
subtask_1_18.txt | AC | 184 ms | 6400 KB |
subtask_1_19.txt | AC | 615 ms | 7808 KB |
subtask_1_2.txt | AC | 695 ms | 8192 KB |
subtask_1_20.txt | AC | 674 ms | 8192 KB |
subtask_1_21.txt | AC | 690 ms | 8192 KB |
subtask_1_22.txt | AC | 715 ms | 8192 KB |
subtask_1_23.txt | AC | 1 ms | 256 KB |
subtask_1_24.txt | AC | 302 ms | 6400 KB |
subtask_1_25.txt | AC | 66 ms | 4224 KB |
subtask_1_26.txt | AC | 695 ms | 8192 KB |
subtask_1_27.txt | AC | 695 ms | 8192 KB |
subtask_1_3.txt | AC | 322 ms | 6400 KB |
subtask_1_4.txt | AC | 694 ms | 8192 KB |
subtask_1_5.txt | AC | 144 ms | 6400 KB |
subtask_1_6.txt | AC | 689 ms | 8192 KB |
subtask_1_7.txt | AC | 571 ms | 7680 KB |
subtask_1_8.txt | AC | 693 ms | 8192 KB |
subtask_1_9.txt | AC | 1 ms | 256 KB |