結果
問題 | No.1480 Many Complete Graphs |
ユーザー | 👑 hos.lyric |
提出日時 | 2021-08-14 12:21:14 |
言語 | D (dmd 2.106.1) |
結果 |
WA
|
実行時間 | - |
コード長 | 2,472 bytes |
コンパイル時間 | 840 ms |
コンパイル使用メモリ | 121,876 KB |
実行使用メモリ | 13,316 KB |
最終ジャッジ日時 | 2024-06-22 12:06:11 |
合計ジャッジ時間 | 5,219 ms |
ジャッジサーバーID (参考情報) |
judge2 / judge1 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 1 ms
6,816 KB |
testcase_01 | AC | 1 ms
6,940 KB |
testcase_02 | AC | 1 ms
6,940 KB |
testcase_03 | AC | 1 ms
6,940 KB |
testcase_04 | AC | 1 ms
6,940 KB |
testcase_05 | AC | 1 ms
6,940 KB |
testcase_06 | AC | 1 ms
6,940 KB |
testcase_07 | AC | 1 ms
6,940 KB |
testcase_08 | AC | 1 ms
6,944 KB |
testcase_09 | AC | 2 ms
6,944 KB |
testcase_10 | AC | 2 ms
6,940 KB |
testcase_11 | AC | 1 ms
6,944 KB |
testcase_12 | AC | 2 ms
6,940 KB |
testcase_13 | AC | 17 ms
6,944 KB |
testcase_14 | AC | 13 ms
6,940 KB |
testcase_15 | WA | - |
testcase_16 | WA | - |
testcase_17 | WA | - |
testcase_18 | AC | 4 ms
6,940 KB |
testcase_19 | WA | - |
testcase_20 | WA | - |
testcase_21 | AC | 19 ms
6,940 KB |
testcase_22 | AC | 12 ms
6,944 KB |
testcase_23 | AC | 38 ms
7,168 KB |
testcase_24 | AC | 36 ms
6,940 KB |
testcase_25 | AC | 38 ms
7,288 KB |
testcase_26 | AC | 39 ms
6,940 KB |
testcase_27 | AC | 36 ms
6,944 KB |
testcase_28 | AC | 39 ms
9,064 KB |
testcase_29 | AC | 39 ms
8,888 KB |
testcase_30 | AC | 40 ms
8,972 KB |
testcase_31 | AC | 40 ms
9,008 KB |
testcase_32 | AC | 39 ms
9,020 KB |
testcase_33 | AC | 39 ms
8,996 KB |
testcase_34 | AC | 40 ms
8,968 KB |
testcase_35 | AC | 39 ms
9,000 KB |
testcase_36 | AC | 39 ms
9,024 KB |
testcase_37 | AC | 39 ms
9,084 KB |
testcase_38 | AC | 40 ms
9,092 KB |
testcase_39 | AC | 39 ms
9,080 KB |
testcase_40 | AC | 40 ms
9,084 KB |
testcase_41 | AC | 39 ms
9,236 KB |
testcase_42 | AC | 40 ms
8,992 KB |
testcase_43 | AC | 40 ms
9,040 KB |
testcase_44 | AC | 40 ms
10,744 KB |
testcase_45 | AC | 40 ms
8,968 KB |
testcase_46 | AC | 40 ms
9,040 KB |
testcase_47 | WA | - |
testcase_48 | WA | - |
testcase_49 | WA | - |
testcase_50 | AC | 66 ms
12,868 KB |
testcase_51 | AC | 69 ms
11,496 KB |
testcase_52 | WA | - |
testcase_53 | WA | - |
testcase_54 | AC | 49 ms
7,812 KB |
testcase_55 | AC | 49 ms
7,900 KB |
testcase_56 | AC | 50 ms
7,856 KB |
testcase_57 | AC | 68 ms
11,176 KB |
testcase_58 | AC | 50 ms
7,748 KB |
evil_aftercontest.txt | AC | 103 ms
18,420 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 N = readInt(); const M = readInt(); auto K = new int[M]; auto C = new long[M]; auto S = new int[][M]; foreach (m; 0 .. M) { K[m] = readInt(); C[m] = readLong(); S[m] = new int[K[m]]; foreach (k; 0 .. K[m]) { S[m][k] = readInt() - 1; } } auto mss = new int[][N]; foreach (m; 0 .. M) { foreach (k; 0 .. K[m]) { mss[S[m][k]] ~= m; } } auto dist = new long[N]; dist[] = INF; auto sub = new long[2][M]; foreach (m; 0 .. M) { sub[m][] = INF; } dist[0] = 0; foreach (u; 0 .. N) { // out foreach (m; mss[u]) { if ((u + 1) % 2 == 0) { chmin(dist[u], sub[m][0] + (u + 1) / 2); } chmin(dist[u], sub[m][1] + (u + 1) / 2); } // in foreach (m; mss[u]) { if ((u + 1) % 2 == 0) { chmin(sub[m][0], dist[u] + (u + 1) / 2 + C[m]); } chmin(sub[m][1], dist[u] + (u + 1) / 2 + C[m] + 1); } } const ans = dist[N - 1]; writeln((ans >= INF) ? -1 : ans); } } catch (EOFException e) { } }