結果
問題 | No.1833 Subway Planning |
ユーザー | 👑 hos.lyric |
提出日時 | 2022-02-13 03:42:17 |
言語 | D (dmd 2.106.1) |
結果 |
AC
|
実行時間 | 1,731 ms / 4,000 ms |
コード長 | 2,770 bytes |
コンパイル時間 | 1,023 ms |
コンパイル使用メモリ | 110,908 KB |
実行使用メモリ | 63,116 KB |
最終ジャッジ日時 | 2023-09-04 15:59:26 |
合計ジャッジ時間 | 23,988 ms |
ジャッジサーバーID (参考情報) |
judge15 / judge11 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 1 ms
4,380 KB |
testcase_01 | AC | 2 ms
4,380 KB |
testcase_02 | AC | 1 ms
4,380 KB |
testcase_03 | AC | 1 ms
4,384 KB |
testcase_04 | AC | 212 ms
25,164 KB |
testcase_05 | AC | 271 ms
33,576 KB |
testcase_06 | AC | 1,051 ms
37,036 KB |
testcase_07 | AC | 1,412 ms
36,992 KB |
testcase_08 | AC | 1,407 ms
37,476 KB |
testcase_09 | AC | 302 ms
33,824 KB |
testcase_10 | AC | 1,215 ms
43,992 KB |
testcase_11 | AC | 1,154 ms
36,996 KB |
testcase_12 | AC | 994 ms
63,116 KB |
testcase_13 | AC | 1,168 ms
37,272 KB |
testcase_14 | AC | 950 ms
24,168 KB |
testcase_15 | AC | 247 ms
25,040 KB |
testcase_16 | AC | 1,452 ms
37,292 KB |
testcase_17 | AC | 1,731 ms
37,264 KB |
testcase_18 | AC | 1,623 ms
36,220 KB |
testcase_19 | AC | 1,271 ms
37,736 KB |
testcase_20 | AC | 536 ms
24,832 KB |
testcase_21 | AC | 257 ms
27,864 KB |
testcase_22 | AC | 251 ms
29,172 KB |
testcase_23 | AC | 2 ms
4,384 KB |
testcase_24 | AC | 2 ms
4,388 KB |
testcase_25 | AC | 2 ms
4,384 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)); } int N; int[] A, B; long[] C; int[][] G; long C0; /* must use > d cannot use < C0 - d */ long check(long d) { auto must = new bool[N - 1]; auto del = new bool[N - 1]; foreach (i; 0 .. N - 1) { must[i] = (C[i] > d); if (C[i] < C0 - d) { if (must[i]) { return false; } del[i] = true; } } debug { writeln("d = ", d); writeln(" must = ", must); writeln(" del = ", del); } auto deg = new int[N]; foreach (i; 0 .. N - 1) if (!del[i]) { ++deg[A[i]]; ++deg[B[i]]; } DList!int que; foreach (u; 0 .. N) if (deg[u] == 1) { que ~= u; } for (; !que.empty; ) { const u = que.front; que.removeFront; foreach (i; G[u]) if (!must[i] && !del[i]) { const v = A[i] ^ B[i] ^ u; debug { writeln(" delete ", u, " ", v); } del[i] = true; --deg[u]; --deg[v]; if (deg[v] == 1) { que ~= v; } } } const ok = (deg.count(1) <= 2); return ok; } void main() { try { for (; ; ) { N = readInt; A.length = N - 1; B.length = N - 1; C.length = N - 1; foreach (i; 0 .. N - 1) { A[i] = readInt - 1; B[i] = readInt - 1; C[i] = readLong; } G = new int[][N]; foreach (i; 0 .. N - 1) { G[A[i]] ~= i; G[B[i]] ~= i; } C0 = C.maxElement; long lo = -1, hi = C0; for (; lo + 1 < hi; ) { const mid = (lo + hi) / 2; (check(mid) ? hi : lo) = mid; } writeln(hi); } } catch (EOFException e) { } }