Submission #1609535
Source Code Expand
import java.util.ArrayList; import java.util.Arrays; import java.util.Scanner; public class Main { int n, m; ArrayList<ArrayList<Edge>> es; long[] dist; private final long INF = Long.MAX_VALUE; public static void main(String[] args) { Main m = new Main(); m.read(); m.solve(); } private void read() { Scanner sc = new Scanner(System.in); n = sc.nextInt(); m = sc.nextInt(); es = new ArrayList<>(n); for (int i = 0; i < n; i++) es.add(new ArrayList<>()); for (int i = 0; i < m; i++) { int a = sc.nextInt() - 1; int b = sc.nextInt() - 1; long c = sc.nextLong(); es.get(a).add(new Edge(a, b, -c)); } } private void solve() { boolean b = bellman(); if (b) System.out.println(-dist[n-1]); else System.out.println("inf"); } private boolean bellman() { dist = new long[n]; Arrays.fill(dist, INF); dist[0] = 0; boolean[] flg = new boolean[n]; flg[0] = true; for (int i = 0; i < n; i++) { for (ArrayList<Edge> ls: es) { for (Edge e: ls) { if (flg[e.a] && dist[e.b] > dist[e.a] + e.c) { dist[e.b] = dist[e.a] + e.c; flg[e.b] = true; } } } } boolean[] nflg = new boolean[n]; for (int i = 0; i < n; i++) { for (ArrayList<Edge> ls: es) { for (Edge e: ls) { if (flg[e.a] && dist[e.b] > dist[e.a] + e.c) { dist[e.b] = dist[e.a] + e.c; nflg[e.b] = true; } if (nflg[e.a]) nflg[e.b] = true; } } } return nflg[n-1]; } private class Edge { int a, b; long c; Edge (int a, int b, long c) { this.a = a; this.b = b; this.c = c; } } }
Submission Info
Submission Time | |
---|---|
Task | D - Score Attack |
User | nmjiri |
Language | Java8 (OpenJDK 1.8.0) |
Score | 0 |
Code Size | 2220 Byte |
Status | WA |
Exec Time | 367 ms |
Memory | 48580 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 | WA | 102 ms | 21972 KB |
sample_02.txt | WA | 95 ms | 19156 KB |
sample_03.txt | WA | 97 ms | 21844 KB |
subtask_1_1.txt | WA | 203 ms | 35496 KB |
subtask_1_10.txt | WA | 112 ms | 17748 KB |
subtask_1_11.txt | WA | 200 ms | 32528 KB |
subtask_1_12.txt | WA | 301 ms | 43888 KB |
subtask_1_13.txt | WA | 165 ms | 44132 KB |
subtask_1_14.txt | WA | 277 ms | 46892 KB |
subtask_1_15.txt | WA | 367 ms | 48580 KB |
subtask_1_16.txt | WA | 107 ms | 18900 KB |
subtask_1_17.txt | WA | 116 ms | 19028 KB |
subtask_1_18.txt | WA | 281 ms | 38948 KB |
subtask_1_19.txt | WA | 320 ms | 46536 KB |
subtask_1_2.txt | WA | 294 ms | 45296 KB |
subtask_1_20.txt | WA | 178 ms | 39524 KB |
subtask_1_21.txt | WA | 246 ms | 38824 KB |
subtask_1_22.txt | WA | 366 ms | 44104 KB |
subtask_1_23.txt | WA | 106 ms | 18640 KB |
subtask_1_24.txt | WA | 300 ms | 40924 KB |
subtask_1_25.txt | WA | 221 ms | 37620 KB |
subtask_1_26.txt | WA | 314 ms | 44180 KB |
subtask_1_27.txt | WA | 281 ms | 45796 KB |
subtask_1_3.txt | WA | 276 ms | 38572 KB |
subtask_1_4.txt | WA | 301 ms | 45888 KB |
subtask_1_5.txt | WA | 254 ms | 40572 KB |
subtask_1_6.txt | WA | 289 ms | 44616 KB |
subtask_1_7.txt | WA | 258 ms | 42560 KB |
subtask_1_8.txt | WA | 270 ms | 46176 KB |
subtask_1_9.txt | WA | 94 ms | 21204 KB |