結果
問題 | No.1473 おでぶなおばけさん |
ユーザー | 👑 hos.lyric |
提出日時 | 2021-04-09 21:45:59 |
言語 | D (dmd 2.106.1) |
結果 |
WA
|
実行時間 | - |
コード長 | 2,357 bytes |
コンパイル時間 | 1,057 ms |
コンパイル使用メモリ | 129,896 KB |
実行使用メモリ | 15,500 KB |
最終ジャッジ日時 | 2023-09-04 12:31:43 |
合計ジャッジ時間 | 11,638 ms |
ジャッジサーバーID (参考情報) |
judge13 / judge11 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 1 ms
4,384 KB |
testcase_01 | AC | 1 ms
4,380 KB |
testcase_02 | AC | 190 ms
8,964 KB |
testcase_03 | WA | - |
testcase_04 | AC | 97 ms
6,324 KB |
testcase_05 | WA | - |
testcase_06 | WA | - |
testcase_07 | AC | 181 ms
8,340 KB |
testcase_08 | WA | - |
testcase_09 | AC | 184 ms
8,360 KB |
testcase_10 | AC | 117 ms
13,728 KB |
testcase_11 | WA | - |
testcase_12 | AC | 119 ms
14,088 KB |
testcase_13 | AC | 74 ms
10,772 KB |
testcase_14 | AC | 52 ms
5,016 KB |
testcase_15 | AC | 100 ms
10,468 KB |
testcase_16 | AC | 101 ms
12,424 KB |
testcase_17 | AC | 9 ms
4,380 KB |
testcase_18 | WA | - |
testcase_19 | WA | - |
testcase_20 | WA | - |
testcase_21 | AC | 163 ms
13,524 KB |
testcase_22 | AC | 156 ms
7,736 KB |
testcase_23 | AC | 129 ms
6,996 KB |
testcase_24 | AC | 128 ms
8,304 KB |
testcase_25 | AC | 163 ms
7,720 KB |
testcase_26 | AC | 170 ms
10,212 KB |
testcase_27 | AC | 61 ms
4,720 KB |
testcase_28 | AC | 190 ms
8,452 KB |
testcase_29 | AC | 162 ms
7,748 KB |
testcase_30 | AC | 191 ms
8,188 KB |
testcase_31 | AC | 180 ms
8,216 KB |
testcase_32 | WA | - |
testcase_33 | AC | 152 ms
8,176 KB |
testcase_34 | AC | 72 ms
5,120 KB |
testcase_35 | AC | 93 ms
5,332 KB |
testcase_36 | AC | 118 ms
13,740 KB |
testcase_37 | AC | 127 ms
7,724 KB |
testcase_38 | AC | 26 ms
4,380 KB |
testcase_39 | AC | 100 ms
11,972 KB |
testcase_40 | AC | 101 ms
10,616 KB |
testcase_41 | AC | 81 ms
7,096 KB |
testcase_42 | AC | 80 ms
6,804 KB |
testcase_43 | AC | 168 ms
7,980 KB |
testcase_44 | AC | 168 ms
8,312 KB |
testcase_45 | AC | 169 ms
7,916 KB |
testcase_46 | AC | 100 ms
6,968 KB |
testcase_47 | AC | 120 ms
12,524 KB |
testcase_48 | AC | 119 ms
6,908 KB |
ソースコード
import std.conv, std.functional, std.range, std.stdio, std.string; import std.algorithm, std.array, std.bigint, std.bitmanip, std.complex, std.container, std.math, std.mathspecial, std.numeric, std.regex, std.typecons; import core.bitop; class EOFException : Throwable { this() { super("EOF"); } } string[] tokens; string readToken() { for (; tokens.empty; ) { if (stdin.eof) { throw new EOFException; } tokens = readln.split; } auto token = tokens.front; tokens.popFront; return token; } int readInt() { return readToken.to!int; } long readLong() { return readToken.to!long; } real readReal() { return readToken.to!real; } bool chmin(T)(ref T t, in T f) { if (t > f) { t = f; return true; } else { return false; } } bool chmax(T)(ref T t, in T f) { if (t < f) { t = f; return true; } else { return false; } } int binarySearch(alias pred, T)(in T[] as) { int lo = -1, hi = cast(int)(as.length); for (; lo + 1 < hi; ) { const mid = (lo + hi) >> 1; (unaryFun!pred(as[mid]) ? hi : lo) = mid; } return hi; } int lowerBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a >= val)); } int upperBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a > val)); } enum INF = 10^^9 + 10; void main() { try { for (; ; ) { const N = readInt(); const M = readInt(); auto A = new int[M]; auto B = new int[M]; auto D = new int[M]; foreach (i; 0 .. M) { A[i] = readInt() - 1; B[i] = readInt() - 1; D[i] = readInt(); } auto G = new int[][N]; foreach (i; 0 .. M) { G[A[i]] ~= i; G[B[i]] ~= i; } alias Dist = Tuple!(int, "d", int, "e"); alias Entry = Tuple!(Dist, "c", int, "u"); BinaryHeap!(Array!Entry, "a.c > b.c") que; auto dist = new Dist[N]; dist[] = Dist(INF, INF); que.insert(Entry(dist[0] = Dist(-INF, 0), 0)); for (; !que.empty; ) { const c = que.front.c; const u = que.front.u; que.removeFront; if (dist[u] == c) { foreach (i; G[u]) { const cc = Dist(max(c.d, -D[i]), c.e + 1); const v = A[i] ^ B[i] ^ u; if (chmin(dist[v], cc)) { que.insert(Entry(cc, v)); } } } } writeln(-dist[N - 1].d, " ", dist[N - 1].e); } } catch (EOFException e) { } }