結果
問題 | No.1276 3枚のカード |
ユーザー | 👑 hos.lyric |
提出日時 | 2020-11-11 03:47:22 |
言語 | D (dmd 2.106.1) |
結果 |
AC
|
実行時間 | 1,703 ms / 2,000 ms |
コード長 | 3,726 bytes |
コンパイル時間 | 1,429 ms |
コンパイル使用メモリ | 152,304 KB |
実行使用メモリ | 4,384 KB |
最終ジャッジ日時 | 2023-09-04 10:57:49 |
合計ジャッジ時間 | 52,680 ms |
ジャッジサーバーID (参考情報) |
judge13 / judge11 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 1 ms
4,380 KB |
testcase_01 | AC | 1 ms
4,376 KB |
testcase_02 | AC | 1 ms
4,380 KB |
testcase_03 | AC | 1 ms
4,380 KB |
testcase_04 | AC | 1 ms
4,380 KB |
testcase_05 | AC | 2 ms
4,384 KB |
testcase_06 | AC | 1 ms
4,376 KB |
testcase_07 | AC | 1 ms
4,376 KB |
testcase_08 | AC | 1 ms
4,380 KB |
testcase_09 | AC | 1 ms
4,380 KB |
testcase_10 | AC | 1,435 ms
4,380 KB |
testcase_11 | AC | 670 ms
4,380 KB |
testcase_12 | AC | 856 ms
4,380 KB |
testcase_13 | AC | 897 ms
4,380 KB |
testcase_14 | AC | 76 ms
4,380 KB |
testcase_15 | AC | 723 ms
4,376 KB |
testcase_16 | AC | 1,567 ms
4,376 KB |
testcase_17 | AC | 837 ms
4,376 KB |
testcase_18 | AC | 628 ms
4,380 KB |
testcase_19 | AC | 1,033 ms
4,380 KB |
testcase_20 | AC | 595 ms
4,376 KB |
testcase_21 | AC | 624 ms
4,380 KB |
testcase_22 | AC | 1,594 ms
4,380 KB |
testcase_23 | AC | 67 ms
4,384 KB |
testcase_24 | AC | 975 ms
4,380 KB |
testcase_25 | AC | 319 ms
4,380 KB |
testcase_26 | AC | 1,212 ms
4,380 KB |
testcase_27 | AC | 1,395 ms
4,376 KB |
testcase_28 | AC | 1,342 ms
4,380 KB |
testcase_29 | AC | 763 ms
4,376 KB |
testcase_30 | AC | 142 ms
4,380 KB |
testcase_31 | AC | 62 ms
4,376 KB |
testcase_32 | AC | 343 ms
4,380 KB |
testcase_33 | AC | 19 ms
4,384 KB |
testcase_34 | AC | 235 ms
4,380 KB |
testcase_35 | AC | 220 ms
4,380 KB |
testcase_36 | AC | 12 ms
4,376 KB |
testcase_37 | AC | 205 ms
4,380 KB |
testcase_38 | AC | 134 ms
4,380 KB |
testcase_39 | AC | 361 ms
4,376 KB |
testcase_40 | AC | 1,525 ms
4,376 KB |
testcase_41 | AC | 1,252 ms
4,380 KB |
testcase_42 | AC | 1,357 ms
4,380 KB |
testcase_43 | AC | 1,181 ms
4,376 KB |
testcase_44 | AC | 1,689 ms
4,380 KB |
testcase_45 | AC | 1,531 ms
4,376 KB |
testcase_46 | AC | 1,526 ms
4,380 KB |
testcase_47 | AC | 1,252 ms
4,380 KB |
testcase_48 | AC | 1,203 ms
4,380 KB |
testcase_49 | AC | 1,366 ms
4,376 KB |
testcase_50 | AC | 1,509 ms
4,376 KB |
testcase_51 | AC | 1,299 ms
4,380 KB |
testcase_52 | AC | 1,106 ms
4,376 KB |
testcase_53 | AC | 1,308 ms
4,380 KB |
testcase_54 | AC | 1,507 ms
4,376 KB |
testcase_55 | AC | 1,154 ms
4,380 KB |
testcase_56 | AC | 1,118 ms
4,380 KB |
testcase_57 | AC | 1,440 ms
4,380 KB |
testcase_58 | AC | 1,500 ms
4,376 KB |
testcase_59 | AC | 1,308 ms
4,380 KB |
testcase_60 | AC | 1,703 ms
4,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)); } struct ModInt(int M_) { import std.conv : to; alias M = M_; int x; this(ModInt a) { x = a.x; } this(long a) { x = cast(int)(a % M); if (x < 0) x += M; } ref ModInt opAssign(long a) { return (this = ModInt(a)); } ref ModInt opOpAssign(string op)(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 = cast(int)((cast(long)(x) * a.x) % M); } else static if (op == "/") { this *= a.inv(); } else static assert(false); return this; } ref ModInt opOpAssign(string op)(long a) { static if (op == "^^") { if (a < 0) return (this = inv()^^(-a)); ModInt t2 = this, te = ModInt(1); for (long e = a; e > 0; e >>= 1) { if (e & 1) te *= t2; t2 *= t2; } x = cast(int)(te.x); return this; } else return mixin("this " ~ op ~ "= ModInt(a)"); } ModInt inv() const { int a = x, b = M, y = 1, z = 0, t; for (; ; ) { t = a / b; a -= t * b; if (a == 0) { assert(b == 1 || b == -1); return ModInt(b * z); } y -= t * z; t = b / a; b -= t * a; if (b == 0) { assert(a == 1 || a == -1); return ModInt(a * y); } z -= t * y; } } ModInt opUnary(string op: "-")() const { return ModInt(-x); } ModInt opBinary(string op, T)(T a) const { return mixin("ModInt(this) " ~ op ~ "= a"); } ModInt opBinaryRight(string op)(long a) const { return mixin("ModInt(a) " ~ op ~ "= this"); } bool opCast(T: bool)() const { return (x != 0); } string toString() const { return x.to!string; } } enum MO = 1000000007; alias Mint = ModInt!MO; void main() { try { for (; ; ) { const N = readLong(); Mint ans; // (+) b | c // (-) b | a, c for (long i = 0, j; i < N; i = j) { const k = N / (i + 1); j = N / k; // (i, j]: k ans += Mint(j - i) * Mint(k - 1) * Mint(N - 2); ans -= Mint(j - i) * Mint(k - 1) * Mint(k - 2); } // (-) a | b | c for (long i = 0, j; i < N; i = j) { const k = N / (i + 1); j = N / k; // (i, j]: k Mint sum; for (long ii = 1, jj; ii < k; ii = jj) { const kk = k / (ii + 1); jj = k / kk; // (ii, jj]: kk sum += Mint(jj - ii) * Mint(kk - 1); } ans -= Mint(j - i) * sum; } writeln(ans); } } catch (EOFException e) { } }