結果
問題 |
No.3292 World Map Distance
|
ユーザー |
|
提出日時 | 2025-10-03 21:56:50 |
言語 | D (dmd 2.109.1) |
結果 |
AC
|
実行時間 | 456 ms / 3,000 ms |
コード長 | 2,309 bytes |
コンパイル時間 | 1,988 ms |
コンパイル使用メモリ | 112,660 KB |
実行使用メモリ | 25,308 KB |
最終ジャッジ日時 | 2025-10-03 21:57:06 |
合計ジャッジ時間 | 10,337 ms |
ジャッジサーバーID (参考情報) |
judge2 / judge1 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 34 |
ソースコード
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)); } long solve(long A, long[] X) { const N = cast(int)(X.length); auto xs = X.dup; xs.sort; xs.length *= 2; foreach (i; 0 .. N) xs[i + N] = xs[i] + A; auto xsSum = new long[2*N + 1]; foreach (i; 0 .. 2*N) xsSum[i + 1] = xsSum[i] + xs[i]; long ans; void check(long x) { x %= A; const l = xs.lowerBound(x); const m = xs.lowerBound(x + (A - A/2)); const r = l + N; long score; score += ((xsSum[m] - xsSum[l]) - (m - l) * x); score += ((r - m) * (x + A) - (xsSum[r] - xsSum[m])); debug writeln(x, ": ", xs[l .. m], " ", xs[m .. r], "; ", score); chmax(ans, score); } foreach (i; 0 .. N) { check(xs[i]); check(xs[i] + A/2); check(xs[i] + (A-A/2)); } return ans; } void main() { try { for (; ; ) { const N = readInt; const A = readLong; const B = readLong; auto X = new long[N]; auto Y = new long[N]; foreach (i; 0 .. N) { X[i] = readLong; Y[i] = readLong; } long ans; ans += solve(A, X); ans += solve(B, Y); writeln(ans); } } catch (EOFException e) { } }