結果
問題 | No.2440 Accuracy of Integer Division Approximate Functions |
ユーザー | 👑 hos.lyric |
提出日時 | 2023-08-24 21:12:57 |
言語 | D (dmd 2.106.1) |
結果 |
AC
|
実行時間 | 609 ms / 2,000 ms |
コード長 | 2,591 bytes |
コンパイル時間 | 4,153 ms |
コンパイル使用メモリ | 171,520 KB |
実行使用メモリ | 5,376 KB |
最終ジャッジ日時 | 2024-06-02 10:33:36 |
合計ジャッジ時間 | 13,213 ms |
ジャッジサーバーID (参考情報) |
judge4 / judge3 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 1 ms
5,248 KB |
testcase_01 | AC | 604 ms
5,376 KB |
testcase_02 | AC | 595 ms
5,376 KB |
testcase_03 | AC | 577 ms
5,376 KB |
testcase_04 | AC | 580 ms
5,376 KB |
testcase_05 | AC | 590 ms
5,376 KB |
testcase_06 | AC | 307 ms
5,376 KB |
testcase_07 | AC | 313 ms
5,376 KB |
testcase_08 | AC | 309 ms
5,376 KB |
testcase_09 | AC | 309 ms
5,376 KB |
testcase_10 | AC | 309 ms
5,376 KB |
testcase_11 | AC | 594 ms
5,376 KB |
testcase_12 | AC | 595 ms
5,376 KB |
testcase_13 | AC | 609 ms
5,376 KB |
testcase_14 | AC | 597 ms
5,376 KB |
testcase_15 | AC | 592 ms
5,376 KB |
testcase_16 | AC | 113 ms
5,376 KB |
testcase_17 | AC | 118 ms
5,376 KB |
testcase_18 | AC | 118 ms
5,376 KB |
testcase_19 | AC | 115 ms
5,376 KB |
testcase_20 | AC | 115 ms
5,376 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)); } // floor(a / b) Int divFloor(Int)(Int a, Int b) { return a / b - (((a ^ b) < 0 && a % b != 0) ? 1 : 0); } // sum_{x=l}^r floor((a x + b) / m) // m > 0 BigInt sumFloors(BigInt m, BigInt a, BigInt b, BigInt l, BigInt r) in { assert(m > 0, "sumFloors: m > 0 must hold"); } do { BigInt sum; for (; l <= r; ) { const q = divFloor(a, m); const aa = a - q * m; const ll = divFloor(aa * l + b, m) + 1; const rr = divFloor(aa * r + b, m); // TODO: overflow if ll or rr is big in recursion sum += q * ((r + 1) * r / 2 - l * (l - 1) / 2) + r * rr - (l - 1) * (ll - 1) + (rr - ll + 1); a = m; m = aa; l = -rr; r = -ll; } return sum; } void main() { try { for (; ; ) { const numCases = readInt; foreach (caseId; 0 .. numCases) { BigInt N = readLong; const BigInt D = readLong; const BigInt M = readLong; const S = readInt; const T = BigInt(1) << S; const denom = T - M * D; if (denom != 0) { chmin(N, D * T / abs(denom)); } debug { writeln([N, D, M, T]); } BigInt ans; if (1 <= N) { ans += sumFloors(D, BigInt(1), BigInt(0), BigInt(1), N); ans -= sumFloors(T, M, BigInt(0), BigInt(1), N); } ans = abs(ans); ans = N - ans; writeln(ans); } } } catch (EOFException e) { } }