結果
問題 | No.468 役に立つ競技プログラミング実践編 |
ユーザー | Grenache |
提出日時 | 2016-12-18 18:22:17 |
言語 | Java21 (openjdk 21) |
結果 |
WA
|
実行時間 | - |
コード長 | 5,388 bytes |
コンパイル時間 | 4,307 ms |
コンパイル使用メモリ | 81,000 KB |
実行使用メモリ | 85,748 KB |
最終ジャッジ日時 | 2024-12-14 08:29:36 |
合計ジャッジ時間 | 17,903 ms |
ジャッジサーバーID (参考情報) |
judge4 / judge3 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 118 ms
53,268 KB |
testcase_01 | AC | 121 ms
53,004 KB |
testcase_02 | AC | 123 ms
53,268 KB |
testcase_03 | WA | - |
testcase_04 | WA | - |
testcase_05 | WA | - |
testcase_06 | WA | - |
testcase_07 | WA | - |
testcase_08 | WA | - |
testcase_09 | WA | - |
testcase_10 | WA | - |
testcase_11 | WA | - |
testcase_12 | WA | - |
testcase_13 | WA | - |
testcase_14 | WA | - |
testcase_15 | WA | - |
testcase_16 | WA | - |
testcase_17 | WA | - |
testcase_18 | WA | - |
testcase_19 | WA | - |
testcase_20 | WA | - |
testcase_21 | WA | - |
testcase_22 | WA | - |
testcase_23 | WA | - |
testcase_24 | WA | - |
testcase_25 | WA | - |
testcase_26 | WA | - |
testcase_27 | WA | - |
testcase_28 | WA | - |
testcase_29 | WA | - |
testcase_30 | WA | - |
testcase_31 | WA | - |
testcase_32 | WA | - |
testcase_33 | WA | - |
testcase_34 | AC | 448 ms
80,956 KB |
testcase_35 | AC | 148 ms
54,212 KB |
testcase_36 | AC | 126 ms
53,752 KB |
ソースコード
import java.io.*; import java.util.*; public class Main_yukicoder468 { private static Scanner sc; private static Printer pr; private static void solve() { int n = sc.nextInt(); int m = sc.nextInt(); long[] d = new long[n]; Arrays.fill(d, -1); List<List<Edge>> edges = new ArrayList<>(); for (int i = 0; i < n; i++) { edges.add(new ArrayList<>()); } for (int i = 0; i < m; i++) { int a = sc.nextInt(); int b = sc.nextInt(); int c = sc.nextInt(); edges.get(a).add(new Edge(a, b, c)); } Deque<Integer> ts = new ArrayDeque<>(); for (int i = 0; i < n; i++) { if (d[i] == -1) { Deque<Integer> st = new ArrayDeque<>(); st.push(i); while (!st.isEmpty()) { int e = st.peek(); if (d[e] == -1) { for (Edge next : edges.get(e)) { if (d[next.v] == -1) { st.push(next.v); } } d[e] = 0; } else { ts.push(e); st.pop(); } } } } final long INF = Long.MAX_VALUE; Arrays.fill(d, 0); int s = 0; d[s] = 0; for (int e : ts) { for (Edge next : edges.get(e)) { d[next.v] = Math.max(d[next.v], d[e] + next.w); } } long[] d2 = new long[n]; d2[s] = d[s]; for (int e : ts) { d2[e] = d[e]; for (Edge next : edges.get(e)) { d2[e] = Math.max(d2[e], d[next.v] - next.w); } } int diff = 0; for (int i = 0; i < n; i++) { if (d[i] != d2[i]) { diff++; } } // pr.println(ts); // pr.println(-d[n - 1]); pr.printf("%d %d/%d\n", d[n - 1], diff, n); } private static class Edge { int u; // from int v; // to int w; // cost Edge(int u, int v, int w) { this.u = u; this.v = v; this.w = w; } } // --------------------------------------------------- public static void main(String[] args) { sc = new Scanner(System.in); pr = new Printer(System.out); solve(); pr.close(); sc.close(); } @SuppressWarnings("unused") private static class Scanner { BufferedReader br; Scanner (InputStream in) { br = new BufferedReader(new InputStreamReader(in)); } private boolean isPrintable(int ch) { return ch >= '!' && ch <= '~'; } private boolean isCRLF(int ch) { return ch == '\n' || ch == '\r' || ch == -1; } private int nextPrintable() { try { int ch; while (!isPrintable(ch = br.read())) { if (ch == -1) { throw new NoSuchElementException(); } } return ch; } catch (IOException e) { throw new NoSuchElementException(); } } String next() { try { int ch = nextPrintable(); StringBuilder sb = new StringBuilder(); do { sb.appendCodePoint(ch); } while (isPrintable(ch = br.read())); return sb.toString(); } catch (IOException e) { throw new NoSuchElementException(); } } int nextInt() { try { // parseInt from Integer.parseInt() boolean negative = false; int res = 0; int limit = -Integer.MAX_VALUE; int radix = 10; int fc = nextPrintable(); if (fc < '0') { if (fc == '-') { negative = true; limit = Integer.MIN_VALUE; } else if (fc != '+') { throw new NumberFormatException(); } fc = br.read(); } int multmin = limit / radix; int ch = fc; do { int digit = ch - '0'; if (digit < 0 || digit >= radix) { throw new NumberFormatException(); } if (res < multmin) { throw new NumberFormatException(); } res *= radix; if (res < limit + digit) { throw new NumberFormatException(); } res -= digit; } while (isPrintable(ch = br.read())); return negative ? res : -res; } catch (IOException e) { throw new NoSuchElementException(); } } long nextLong() { try { // parseLong from Long.parseLong() boolean negative = false; long res = 0; long limit = -Long.MAX_VALUE; int radix = 10; int fc = nextPrintable(); if (fc < '0') { if (fc == '-') { negative = true; limit = Long.MIN_VALUE; } else if (fc != '+') { throw new NumberFormatException(); } fc = br.read(); } long multmin = limit / radix; int ch = fc; do { int digit = ch - '0'; if (digit < 0 || digit >= radix) { throw new NumberFormatException(); } if (res < multmin) { throw new NumberFormatException(); } res *= radix; if (res < limit + digit) { throw new NumberFormatException(); } res -= digit; } while (isPrintable(ch = br.read())); return negative ? res : -res; } catch (IOException e) { throw new NoSuchElementException(); } } float nextFloat() { return Float.parseFloat(next()); } double nextDouble() { return Double.parseDouble(next()); } String nextLine() { try { int ch; while (isCRLF(ch = br.read())) { if (ch == -1) { throw new NoSuchElementException(); } } StringBuilder sb = new StringBuilder(); do { sb.appendCodePoint(ch); } while (!isCRLF(ch = br.read())); return sb.toString(); } catch (IOException e) { throw new NoSuchElementException(); } } void close() { try { br.close(); } catch (IOException e) { // throw new NoSuchElementException(); } } } private static class Printer extends PrintWriter { Printer(PrintStream out) { super(out); } } }