結果

問題 No.2242 Cities and Teleporters
ユーザー 👑 hos.lyric
提出日時 2023-03-10 22:23:10
言語 D
(dmd 2.109.1)
結果
AC  
実行時間 454 ms / 3,000 ms
コード長 3,194 bytes
コンパイル時間 1,161 ms
コンパイル使用メモリ 126,856 KB
実行使用メモリ 26,604 KB
最終ジャッジ日時 2024-06-22 17:38:29
合計ジャッジ時間 11,814 ms
ジャッジサーバーID
(参考情報)
judge5 / judge4
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
other AC * 26
権限があれば一括ダウンロードができます

ソースコード

diff #
プレゼンテーションモードにする

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; }
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 E = 18;
void main() {
try {
for (; ; ) {
const N = readInt;
auto H = new int[N]; foreach (i; 0 .. N) H[i] = readInt;
auto T = new int[N]; foreach (i; 0 .. N) T[i] = readInt;
const Q = readInt;
auto A = new int[Q];
auto B = new int[Q];
foreach (q; 0 .. Q) {
A[q] = readInt - 1;
B[q] = readInt - 1;
}
auto js = iota(N).array;
js.sort!((i, j) => (H[i] < H[j]));
H = iota(N).map!(u => H[js[u]]).array;
T = iota(N).map!(u => T[js[u]]).array;
auto tr = new int[N];
foreach (u; 0 .. N) {
tr[js[u]] = u;
}
foreach (q; 0 .. Q) {
A[q] = tr[A[q]];
B[q] = tr[B[q]];
}
debug {
writeln("H = ", H);
writeln("T = ", T);
}
auto once = new int[N];
foreach (u; 0 .. N) {
once[u] = H.upperBound(T[u]) - 1;
}
auto mxs = once.dup;
foreach (u; 1 .. N) {
chmax(mxs[u], mxs[u - 1]);
}
debug {
writeln("once = ", once);
writeln("mxs = ", mxs);
}
auto f = new int[][](E, N);
f[0][] = mxs[];
foreach (e; 0 .. E - 1) {
foreach (u; 0 .. N) {
f[e + 1][u] = (~f[e][u]) ? f[e][f[e][u]] : -1;
}
}
foreach (q; 0 .. Q) {
int ans = 0;
int u = A[q];
if (u != B[q]) {
ans += 1;
u = once[u];
// [0, u]
if (~u) {
if (u < B[q]) {
foreach_reverse (e; 0 .. E) {
if (~u && f[e][u] < B[q]) {
ans += (1 << e);
u = f[e][u];
}
}
if (~u) {
ans += 1;
u = f[0][u];
if (u < B[q]) {
ans = -1;
}
} else {
ans = -1;
}
}
} else {
ans = -1;
}
}
writeln(ans);
}
}
} catch (EOFException e) {
}
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0