結果
問題 | No.614 壊れたキャンパス |
ユーザー | Grenache |
提出日時 | 2018-01-06 16:06:11 |
言語 | Java21 (openjdk 21) |
結果 |
WA
|
実行時間 | - |
コード長 | 5,367 bytes |
コンパイル時間 | 4,075 ms |
コンパイル使用メモリ | 81,572 KB |
実行使用メモリ | 114,552 KB |
最終ジャッジ日時 | 2024-06-02 11:28:32 |
合計ジャッジ時間 | 17,989 ms |
ジャッジサーバーID (参考情報) |
judge5 / judge4 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 47 ms
36,928 KB |
testcase_01 | AC | 47 ms
36,440 KB |
testcase_02 | AC | 46 ms
36,940 KB |
testcase_03 | AC | 47 ms
37,060 KB |
testcase_04 | AC | 45 ms
36,908 KB |
testcase_05 | AC | 46 ms
36,908 KB |
testcase_06 | AC | 46 ms
37,256 KB |
testcase_07 | AC | 46 ms
37,028 KB |
testcase_08 | WA | - |
testcase_09 | AC | 1,752 ms
114,552 KB |
testcase_10 | AC | 1,017 ms
77,256 KB |
testcase_11 | WA | - |
testcase_12 | WA | - |
testcase_13 | WA | - |
testcase_14 | WA | - |
testcase_15 | AC | 846 ms
74,276 KB |
testcase_16 | WA | - |
testcase_17 | AC | 788 ms
89,696 KB |
testcase_18 | AC | 917 ms
92,920 KB |
testcase_19 | AC | 1,262 ms
106,284 KB |
ソースコード
import java.io.*; import java.util.*; import java.util.Map.*; public class Main_yukicoder614 { private static Scanner sc; private static Printer pr; private static void solve() { int n = sc.nextInt(); int m = sc.nextInt(); @SuppressWarnings("unused") int k = sc.nextInt(); int s = sc.nextInt(); int t = sc.nextInt(); int[] a = new int[m]; int[] b = new int[m]; int[] c = new int[m]; List<List<Integer>> edges = new ArrayList<>(n); for (int i = 0; i < n; i++) { edges.add(new ArrayList<>()); } for (int i = 0; i < m; i++) { a[i] = sc.nextInt() - 1; b[i] = sc.nextInt(); c[i] = sc.nextInt(); edges.get(a[i]).add(i); } final long INF = Long.MAX_VALUE / 2; Map<Integer, Long> pre = new TreeMap<>(); pre.put(s, 0L); for (int i = 0; i < n - 1; i++) { Map<Integer, Long> tm = new TreeMap<>(); tm.putAll(pre); for (int e : edges.get(i)) { if (!tm.containsKey(b[e])) { tm.put(b[e], INF); } } List<Integer> list = new ArrayList<>(tm.keySet()); for (int j = 1, size = list.size(); j < size; j++) { int p = list.get(j - 1); int e = list.get(j); tm.put(e, Math.min(tm.get(p) + e - p, tm.get(e))); } for (int j = list.size() - 2; j >= 0; j--) { int ne = list.get(j + 1); int e = list.get(j); tm.put(e, Math.min(tm.get(ne) + ne - e, tm.get(e))); } pre.clear(); for (int e : edges.get(i)) { pre.put(c[e], tm.get(b[e])); } } long ans = INF; for (Entry<Integer, Long> e : pre.entrySet()) { ans = Math.min(ans, Math.abs(e.getKey() - t) + e.getValue()); } if (ans == INF) { pr.println(-1); } else { pr.println(ans); } } // --------------------------------------------------- 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); } } }