結果
問題 | No.1320 Two Type Min Cost Cycle |
ユーザー | 👑 hos.lyric |
提出日時 | 2020-12-17 00:07:01 |
言語 | D (dmd 2.106.1) |
結果 |
AC
|
実行時間 | 495 ms / 2,000 ms |
コード長 | 2,630 bytes |
コンパイル時間 | 1,059 ms |
コンパイル使用メモリ | 125,220 KB |
実行使用メモリ | 7,344 KB |
最終ジャッジ日時 | 2023-09-04 11:31:48 |
合計ジャッジ時間 | 9,143 ms |
ジャッジサーバーID (参考情報) |
judge15 / judge12 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 2 ms
4,384 KB |
testcase_01 | AC | 1 ms
4,380 KB |
testcase_02 | AC | 1 ms
4,384 KB |
testcase_03 | AC | 1 ms
4,384 KB |
testcase_04 | AC | 1 ms
4,388 KB |
testcase_05 | AC | 2 ms
4,380 KB |
testcase_06 | AC | 1 ms
4,380 KB |
testcase_07 | AC | 7 ms
7,060 KB |
testcase_08 | AC | 7 ms
7,016 KB |
testcase_09 | AC | 281 ms
7,288 KB |
testcase_10 | AC | 7 ms
7,056 KB |
testcase_11 | AC | 253 ms
7,068 KB |
testcase_12 | AC | 30 ms
7,040 KB |
testcase_13 | AC | 116 ms
7,012 KB |
testcase_14 | AC | 5 ms
6,724 KB |
testcase_15 | AC | 8 ms
7,016 KB |
testcase_16 | AC | 22 ms
4,380 KB |
testcase_17 | AC | 5 ms
7,000 KB |
testcase_18 | AC | 5 ms
7,116 KB |
testcase_19 | AC | 151 ms
7,344 KB |
testcase_20 | AC | 3 ms
5,480 KB |
testcase_21 | AC | 254 ms
7,000 KB |
testcase_22 | AC | 1 ms
4,384 KB |
testcase_23 | AC | 1 ms
4,380 KB |
testcase_24 | AC | 1 ms
4,380 KB |
testcase_25 | AC | 1 ms
4,384 KB |
testcase_26 | AC | 1 ms
4,380 KB |
testcase_27 | AC | 1 ms
4,380 KB |
testcase_28 | AC | 5 ms
6,784 KB |
testcase_29 | AC | 229 ms
7,320 KB |
testcase_30 | AC | 2 ms
4,384 KB |
testcase_31 | AC | 40 ms
7,008 KB |
testcase_32 | AC | 2 ms
4,380 KB |
testcase_33 | AC | 242 ms
7,260 KB |
testcase_34 | AC | 111 ms
7,016 KB |
testcase_35 | AC | 11 ms
4,380 KB |
testcase_36 | AC | 9 ms
4,384 KB |
testcase_37 | AC | 3 ms
4,380 KB |
testcase_38 | AC | 14 ms
4,380 KB |
testcase_39 | AC | 4 ms
4,384 KB |
testcase_40 | AC | 1 ms
4,380 KB |
testcase_41 | AC | 2 ms
4,384 KB |
testcase_42 | AC | 1 ms
4,380 KB |
testcase_43 | AC | 11 ms
7,224 KB |
testcase_44 | AC | 8 ms
7,064 KB |
testcase_45 | AC | 495 ms
7,260 KB |
testcase_46 | AC | 29 ms
6,992 KB |
testcase_47 | AC | 96 ms
6,992 KB |
testcase_48 | AC | 287 ms
7,068 KB |
testcase_49 | AC | 25 ms
7,060 KB |
testcase_50 | AC | 2 ms
4,380 KB |
testcase_51 | AC | 2 ms
4,380 KB |
testcase_52 | AC | 55 ms
6,996 KB |
testcase_53 | AC | 23 ms
6,484 KB |
testcase_54 | AC | 389 ms
7,232 KB |
testcase_55 | AC | 394 ms
7,272 KB |
testcase_56 | AC | 389 ms
7,304 KB |
testcase_57 | AC | 361 ms
7,252 KB |
testcase_58 | AC | 359 ms
7,320 KB |
testcase_59 | AC | 362 ms
7,280 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 = 10L^^18; void main() { try { for (; ; ) { const T = readInt(); const N = readInt(); const M = readInt(); auto A = new int[M]; auto B = new int[M]; auto C = new long[M]; foreach (i; 0 .. M) { A[i] = readInt() - 1; B[i] = readInt() - 1; C[i] = readLong(); } auto G = new int[][N]; foreach (i; 0 .. M) { if (T == 0) { G[A[i]] ~= i; G[B[i]] ~= i; } else { G[A[i]] ~= i; } } long ans = INF; foreach (i0; 0 .. M) { alias Entry = Tuple!(long, "c", int, "u"); BinaryHeap!(Array!Entry, "a.c > b.c") que; auto dist = new long[N]; dist[] = INF; dist[B[i0]] = 0; que.insert(Entry(0, B[i0])); for (; !que.empty; ) { const c = que.front.c; const u = que.front.u; que.removeFront; if (dist[u] == c) { if (u == A[i0]) { chmin(ans, C[i0] + c); break; } foreach (i; G[u]) { if (i != i0) { const cc = c + C[i]; const v = A[i] ^ B[i] ^ u; if (chmin(dist[v], cc)) { que.insert(Entry(cc, v)); } } } } } } writeln((ans >= INF) ? -1 : ans); } } catch (EOFException e) { } }