結果
問題 | No.2618 除霊 |
ユーザー | 👑 hos.lyric |
提出日時 | 2024-01-26 21:54:42 |
言語 | D (dmd 2.106.1) |
結果 |
AC
|
実行時間 | 327 ms / 2,000 ms |
コード長 | 3,125 bytes |
コンパイル時間 | 901 ms |
コンパイル使用メモリ | 109,184 KB |
実行使用メモリ | 34,128 KB |
最終ジャッジ日時 | 2024-01-26 21:55:00 |
合計ジャッジ時間 | 15,853 ms |
ジャッジサーバーID (参考情報) |
judge15 / judge11 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 1 ms
6,676 KB |
testcase_01 | AC | 1 ms
6,676 KB |
testcase_02 | AC | 1 ms
6,676 KB |
testcase_03 | AC | 1 ms
6,676 KB |
testcase_04 | AC | 1 ms
6,676 KB |
testcase_05 | AC | 1 ms
6,676 KB |
testcase_06 | AC | 318 ms
17,992 KB |
testcase_07 | AC | 284 ms
19,496 KB |
testcase_08 | AC | 296 ms
20,480 KB |
testcase_09 | AC | 291 ms
20,532 KB |
testcase_10 | AC | 305 ms
22,652 KB |
testcase_11 | AC | 268 ms
16,644 KB |
testcase_12 | AC | 318 ms
34,128 KB |
testcase_13 | AC | 264 ms
16,768 KB |
testcase_14 | AC | 265 ms
24,856 KB |
testcase_15 | AC | 231 ms
16,644 KB |
testcase_16 | AC | 237 ms
16,372 KB |
testcase_17 | AC | 266 ms
20,456 KB |
testcase_18 | AC | 280 ms
22,644 KB |
testcase_19 | AC | 250 ms
16,768 KB |
testcase_20 | AC | 237 ms
16,772 KB |
testcase_21 | AC | 255 ms
18,452 KB |
testcase_22 | AC | 266 ms
24,856 KB |
testcase_23 | AC | 250 ms
16,820 KB |
testcase_24 | AC | 241 ms
16,560 KB |
testcase_25 | AC | 270 ms
20,436 KB |
testcase_26 | AC | 273 ms
22,684 KB |
testcase_27 | AC | 245 ms
16,512 KB |
testcase_28 | AC | 243 ms
17,024 KB |
testcase_29 | AC | 269 ms
20,440 KB |
testcase_30 | AC | 274 ms
23,132 KB |
testcase_31 | AC | 316 ms
33,248 KB |
testcase_32 | AC | 311 ms
16,512 KB |
testcase_33 | AC | 283 ms
16,516 KB |
testcase_34 | AC | 280 ms
16,320 KB |
testcase_35 | AC | 291 ms
20,000 KB |
testcase_36 | AC | 306 ms
20,168 KB |
testcase_37 | AC | 288 ms
20,148 KB |
testcase_38 | AC | 327 ms
20,204 KB |
testcase_39 | AC | 314 ms
20,668 KB |
testcase_40 | AC | 301 ms
20,484 KB |
testcase_41 | AC | 316 ms
22,796 KB |
testcase_42 | AC | 307 ms
22,556 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; } string COLOR(string s = "") { return "\x1b[" ~ s ~ "m"; } 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; int K; int[] V; int[][] graph; int[] par; void dfs(int u, int p) { par[u] = p; foreach (v; graph[u]) if (p != v) { dfs(v, u); } } void main() { try { for (; ; ) { N = readInt; A = new int[N - 1]; B = new int[N - 1]; foreach (i; 0 .. N - 1) { A[i] = readInt - 1; B[i] = readInt - 1; } K = readInt; V = new int[K]; foreach (k; 0 .. K) { V[k] = readInt - 1; } graph = new int[][N]; foreach (i; 0 .. N - 1) { graph[A[i]] ~= B[i]; graph[B[i]] ~= A[i]; } par = new int[N]; dfs(0, -1); auto ghost = new int[N]; auto damage = new int[N]; foreach (u; V) { ghost[u] = 1; ++damage[u]; foreach (v; graph[u]) { ++damage[v]; } } auto cnt1 = new int[N]; foreach (u; 1 .. N) if (damage[u] == 1) { ++cnt1[par[u]]; } const base = cast(int)(damage.count!"a"); auto ans = new int[N]; foreach (u; 0 .. N) { const p = par[u]; int[3] score; // dist = 0 if (damage[u]) ++score[0]; // dist = 1 if (~p && damage[p] && damage[p] <= ghost[u] + ghost[p]) ++score[1]; foreach (v; graph[u]) if (p != v) { if (damage[v] && damage[v] <= ghost[u] + ghost[v]) ++score[1]; } // dist = 2 if (~p && ghost[p]) { if (~par[p] && damage[par[p]] == 1) ++score[2]; score[2] += (cnt1[par[u]] - (damage[u] == 1)); } foreach (v; graph[u]) if (p != v) { if (ghost[v]) { score[2] += cnt1[v]; } } debug { writeln(u, ": ", score); } ans[u] = base - score[0] - score[1] - score[2]; } foreach (u; 0 .. N) { writeln(ans[u]); } } } catch (EOFException e) { } }