結果
問題 | No.1532 Different Products |
ユーザー | 👑 hos.lyric |
提出日時 | 2021-06-04 21:34:57 |
言語 | D (dmd 2.107.1) |
結果 |
AC
|
実行時間 | 608 ms / 4,000 ms |
コード長 | 2,166 bytes |
コンパイル時間 | 1,105 ms |
コンパイル使用メモリ | 113,356 KB |
実行使用メモリ | 22,552 KB |
最終ジャッジ日時 | 2023-09-04 12:48:01 |
合計ジャッジ時間 | 25,463 ms |
ジャッジサーバーID (参考情報) |
judge12 / judge11 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 1 ms
4,384 KB |
testcase_01 | AC | 97 ms
6,196 KB |
testcase_02 | AC | 2 ms
4,376 KB |
testcase_03 | AC | 1 ms
4,380 KB |
testcase_04 | AC | 1 ms
4,380 KB |
testcase_05 | AC | 1 ms
4,380 KB |
testcase_06 | AC | 2 ms
4,376 KB |
testcase_07 | AC | 4 ms
4,376 KB |
testcase_08 | AC | 7 ms
5,612 KB |
testcase_09 | AC | 59 ms
13,180 KB |
testcase_10 | AC | 143 ms
12,588 KB |
testcase_11 | AC | 120 ms
12,828 KB |
testcase_12 | AC | 315 ms
13,352 KB |
testcase_13 | AC | 217 ms
12,888 KB |
testcase_14 | AC | 480 ms
12,352 KB |
testcase_15 | AC | 62 ms
12,660 KB |
testcase_16 | AC | 108 ms
6,436 KB |
testcase_17 | AC | 135 ms
13,196 KB |
testcase_18 | AC | 123 ms
13,328 KB |
testcase_19 | AC | 287 ms
11,860 KB |
testcase_20 | AC | 495 ms
13,064 KB |
testcase_21 | AC | 154 ms
6,196 KB |
testcase_22 | AC | 206 ms
13,056 KB |
testcase_23 | AC | 156 ms
12,600 KB |
testcase_24 | AC | 457 ms
12,376 KB |
testcase_25 | AC | 266 ms
12,932 KB |
testcase_26 | AC | 39 ms
6,432 KB |
testcase_27 | AC | 232 ms
13,292 KB |
testcase_28 | AC | 183 ms
13,232 KB |
testcase_29 | AC | 126 ms
6,456 KB |
testcase_30 | AC | 306 ms
12,848 KB |
testcase_31 | AC | 321 ms
13,240 KB |
testcase_32 | AC | 368 ms
12,860 KB |
testcase_33 | AC | 273 ms
12,948 KB |
testcase_34 | AC | 468 ms
13,736 KB |
testcase_35 | AC | 370 ms
12,920 KB |
testcase_36 | AC | 426 ms
12,884 KB |
testcase_37 | AC | 66 ms
6,700 KB |
testcase_38 | AC | 465 ms
12,704 KB |
testcase_39 | AC | 423 ms
12,524 KB |
testcase_40 | AC | 435 ms
12,604 KB |
testcase_41 | AC | 583 ms
21,884 KB |
testcase_42 | AC | 508 ms
12,660 KB |
testcase_43 | AC | 544 ms
22,552 KB |
testcase_44 | AC | 591 ms
22,152 KB |
testcase_45 | AC | 595 ms
22,180 KB |
testcase_46 | AC | 576 ms
21,444 KB |
testcase_47 | AC | 602 ms
21,444 KB |
testcase_48 | AC | 595 ms
21,788 KB |
testcase_49 | AC | 597 ms
21,400 KB |
testcase_50 | AC | 592 ms
21,556 KB |
testcase_51 | AC | 605 ms
21,440 KB |
testcase_52 | AC | 580 ms
21,264 KB |
testcase_53 | AC | 608 ms
21,912 KB |
testcase_54 | AC | 585 ms
21,824 KB |
testcase_55 | AC | 596 ms
21,664 KB |
testcase_56 | AC | 579 ms
21,412 KB |
testcase_57 | AC | 579 ms
21,184 KB |
testcase_58 | AC | 596 ms
21,284 KB |
testcase_59 | AC | 560 ms
21,688 KB |
testcase_60 | AC | 606 ms
22,348 KB |
testcase_61 | AC | 1 ms
4,380 KB |
testcase_62 | AC | 1 ms
4,376 KB |
testcase_63 | AC | 599 ms
22,160 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)); } void main() { try { for (; ; ) { const N = readInt(); const K = readLong(); long[] ms; for (long i = 0, j; i < K; i = j) { const k = K / (i + 1); j = K / k; ms ~= k; } ms ~= 0; ms.sort; const msLen = cast(int)(ms.length); debug { if (ms.length <= 10) { writeln("ms = ", ms); } } auto crt = new ulong[msLen]; crt[1 .. $] = 1; foreach (x; 1 .. N + 1) { auto nxt = new ulong[msLen]; int f = 0; foreach (e; 0 .. msLen) { const tar = ms[e] / x; for (; f < msLen; ++f) { if (ms[f] == tar) { nxt[e] = crt[f]; break; } } } crt[] += nxt[]; debug { if (ms.length <= 10) { writeln(x, ": ", crt); } } } writeln(crt[$ - 1] - 1); } } catch (EOFException e) { } }