結果
問題 | No.1024 Children in a Row |
ユーザー | 👑 hos.lyric |
提出日時 | 2020-04-11 02:11:17 |
言語 | D (dmd 2.105.2) |
結果 |
AC
|
実行時間 | 501 ms / 2,000 ms |
コード長 | 3,371 bytes |
コンパイル時間 | 2,391 ms |
コンパイル使用メモリ | 111,924 KB |
実行使用メモリ | 54,160 KB |
最終ジャッジ日時 | 2023-09-04 07:21:33 |
合計ジャッジ時間 | 15,527 ms |
ジャッジサーバーID (参考情報) |
judge11 / judge12 |
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 1 ms
4,380 KB |
testcase_01 | AC | 1 ms
4,380 KB |
testcase_02 | AC | 1 ms
4,380 KB |
testcase_03 | AC | 2 ms
4,380 KB |
testcase_04 | AC | 2 ms
4,380 KB |
testcase_05 | AC | 2 ms
4,376 KB |
testcase_06 | AC | 3 ms
4,380 KB |
testcase_07 | AC | 2 ms
4,380 KB |
testcase_08 | AC | 2 ms
4,380 KB |
testcase_09 | AC | 2 ms
4,384 KB |
testcase_10 | AC | 450 ms
24,300 KB |
testcase_11 | AC | 454 ms
23,884 KB |
testcase_12 | AC | 458 ms
24,744 KB |
testcase_13 | AC | 482 ms
24,032 KB |
testcase_14 | AC | 438 ms
23,368 KB |
testcase_15 | AC | 456 ms
23,716 KB |
testcase_16 | AC | 449 ms
27,872 KB |
testcase_17 | AC | 440 ms
28,596 KB |
testcase_18 | AC | 435 ms
18,120 KB |
testcase_19 | AC | 501 ms
26,160 KB |
testcase_20 | AC | 495 ms
34,524 KB |
testcase_21 | AC | 497 ms
28,064 KB |
testcase_22 | AC | 491 ms
27,088 KB |
testcase_23 | AC | 480 ms
33,760 KB |
testcase_24 | AC | 480 ms
33,932 KB |
testcase_25 | AC | 471 ms
34,460 KB |
testcase_26 | AC | 439 ms
34,272 KB |
testcase_27 | AC | 408 ms
26,924 KB |
testcase_28 | AC | 460 ms
54,160 KB |
testcase_29 | AC | 424 ms
47,000 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)); } void main() { try { for (; ; ) { const N = readInt(); const M = readInt(); auto A = new int[M]; auto B = new int[M]; auto K = new int[M]; foreach (i; 0 .. M) { A[i] = readInt() - 1; B[i] = readInt() - 1; K[i] = readInt() - 1; } auto heads = iota(N).array; auto befs = new int[N + M]; befs[] = -1; auto graph = new int[][N + M]; foreach (i; 0 .. M) { befs[N + i] = heads[A[i]]; heads[A[i]] = N + i; graph[heads[B[i]]] ~= N + i; } auto on = new bool[N + M]; foreach (j; 0 .. N) { on[heads[j]] = true; } auto dis = new int[N + M]; auto fin = new int[N + M]; int[] us; void dfs(int u) { dis[u] = cast(int)(us.length); if (on[u]) { us ~= u; } foreach_reverse (v; graph[u]) { dfs(v); } fin[u] = cast(int)(us.length); } foreach (j; 0 .. N) { dfs(j); } debug { writeln("us = ", us); } assert(us.length == N); foreach (i; 0 .. M) { const a = dis[N + i]; const b = fin[N + i]; const c = dis[befs[N + i]]; debug { writefln("cut [%s, %s) and insert at %s", a, b, c); } alias Slice = Tuple!(int, "l", int, "r"); Slice[] slices; if (c <= a) { slices ~= Slice(0, c); slices ~= Slice(a, b); slices ~= Slice(c, a); slices ~= Slice(b, N); } else if (b <= c) { slices ~= Slice(0, a); slices ~= Slice(b, c); slices ~= Slice(a, b); slices ~= Slice(c, N); } else { assert(false); } int ans = -1; int k = K[i]; foreach (ref slice; slices) { const len = slice.r - slice.l; if (k < len) { const u = us[slice.l + k]; ans = (u < N) ? u : A[u - N]; break; } else { k -= len; } } assert(ans != -1); writeln(ans + 1); } } } catch (EOFException e) { } }