結果
問題 | No.886 Direct |
ユーザー | 👑 hos.lyric |
提出日時 | 2019-09-13 21:57:26 |
言語 | D (dmd 2.106.1) |
結果 |
AC
|
実行時間 | 492 ms / 4,000 ms |
コード長 | 3,378 bytes |
コンパイル時間 | 1,757 ms |
コンパイル使用メモリ | 153,956 KB |
実行使用メモリ | 77,764 KB |
最終ジャッジ日時 | 2024-06-22 02:33:27 |
合計ジャッジ時間 | 7,549 ms |
ジャッジサーバーID (参考情報) |
judge2 / judge4 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 1 ms
6,816 KB |
testcase_01 | AC | 1 ms
6,940 KB |
testcase_02 | AC | 1 ms
6,944 KB |
testcase_03 | AC | 3 ms
6,940 KB |
testcase_04 | AC | 1 ms
6,944 KB |
testcase_05 | AC | 1 ms
6,940 KB |
testcase_06 | AC | 1 ms
6,940 KB |
testcase_07 | AC | 1 ms
6,940 KB |
testcase_08 | AC | 1 ms
6,940 KB |
testcase_09 | AC | 1 ms
6,940 KB |
testcase_10 | AC | 1 ms
6,944 KB |
testcase_11 | AC | 1 ms
6,944 KB |
testcase_12 | AC | 1 ms
6,944 KB |
testcase_13 | AC | 1 ms
6,940 KB |
testcase_14 | AC | 1 ms
6,944 KB |
testcase_15 | AC | 1 ms
6,940 KB |
testcase_16 | AC | 1 ms
6,944 KB |
testcase_17 | AC | 3 ms
6,944 KB |
testcase_18 | AC | 4 ms
6,944 KB |
testcase_19 | AC | 2 ms
6,944 KB |
testcase_20 | AC | 2 ms
6,948 KB |
testcase_21 | AC | 5 ms
6,944 KB |
testcase_22 | AC | 4 ms
6,944 KB |
testcase_23 | AC | 214 ms
40,756 KB |
testcase_24 | AC | 232 ms
41,704 KB |
testcase_25 | AC | 137 ms
28,064 KB |
testcase_26 | AC | 186 ms
35,396 KB |
testcase_27 | AC | 426 ms
72,140 KB |
testcase_28 | AC | 422 ms
68,828 KB |
testcase_29 | AC | 466 ms
77,348 KB |
testcase_30 | AC | 441 ms
75,364 KB |
testcase_31 | AC | 481 ms
74,988 KB |
testcase_32 | AC | 480 ms
75,824 KB |
testcase_33 | AC | 492 ms
77,180 KB |
testcase_34 | AC | 482 ms
76,160 KB |
testcase_35 | AC | 486 ms
77,764 KB |
ソースコード
import std.conv, std.functional, std.range, std.stdio, std.string; import std.algorithm, std.array, std.bigint, std.complex, std.container, std.math, 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)); } struct ModInt(long M) { long x; this(in ModInt a) { x = a.x; } this(in long a) { x = a % M; if (x < 0) x += M; } ref ModInt opAssign(in long a) { return this = ModInt(a); } ref ModInt opOpAssign(string op)(in ModInt a) { static if (op == "+") { x += a.x; if (x >= M) x -= M; } else static if (op == "-") { x -= a.x; if (x < 0) x += M; } else static if (op == "*") { x *= a.x; x %= M; } else static assert(false); return this; } ref ModInt opOpAssign(string op)(in long a) { return mixin("this " ~ op ~ "= ModInt(a)"); } ModInt opUnary(string op)() const if (op == "-") { return ModInt(-x); } ModInt opBinary(string op, T)(in T a) const { return mixin("ModInt(this) " ~ op ~ "= a"); } ModInt opBinaryRight(string op)(in long a) const { return mixin("ModInt(a) " ~ op ~ "= this"); } string toString() const { return x.to!string; } } enum MO = 10L^^9 + 7; alias Mint = ModInt!MO; void main() { try { for (; ; ) { const H = readInt(); const W = readInt(); const lim = max(H, W); auto minp = new int[lim + 1]; auto meb = new int[lim + 1]; foreach (p; 2 .. lim + 1) { if (minp[p] == 0) { for (int n = p; n <= lim; n += p) { minp[n] = p; } } } meb[1] = 1; foreach (n; 2 .. lim + 1) { if (n / minp[n] % minp[n] == 0) { meb[n] = 0; } else { meb[n] = -meb[n / minp[n]]; } } debug { writeln("minp = ", minp[0 .. min(31, $)]); writeln("meb = ", meb[0 .. min(31, $)]); } auto cntH = new Mint[lim + 1]; auto cntW = new Mint[lim + 1]; foreach (d; 1 .. lim + 1) { for (int n = d; n <= lim; n += d) { cntH[d] += max(H - n, 0); cntW[d] += max(W - n, 0); } } debug { if (lim <= 10) { writeln("cntH = ", cntH); writeln("cntW = ", cntW); } } Mint ans; foreach (d; 1 .. lim + 1) { ans += meb[d] * cntH[d] * cntW[d]; } ans *= 2; ans += Mint(1) * H * (W - 1); ans += Mint(1) * (H - 1) * W; writeln(ans); } } catch (EOFException e) { } }