結果
問題 | No.1036 Make One With GCD 2 |
ユーザー | 👑 hos.lyric |
提出日時 | 2020-04-24 21:35:57 |
言語 | D (dmd 2.106.1) |
結果 |
AC
|
実行時間 | 852 ms / 2,000 ms |
コード長 | 4,251 bytes |
コンパイル時間 | 1,126 ms |
コンパイル使用メモリ | 108,452 KB |
実行使用メモリ | 39,848 KB |
最終ジャッジ日時 | 2023-09-04 07:27:06 |
合計ジャッジ時間 | 17,393 ms |
ジャッジサーバーID (参考情報) |
judge14 / judge13 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 852 ms
38,064 KB |
testcase_01 | AC | 167 ms
32,916 KB |
testcase_02 | AC | 286 ms
39,428 KB |
testcase_03 | AC | 25 ms
15,536 KB |
testcase_04 | AC | 41 ms
22,400 KB |
testcase_05 | AC | 1 ms
4,376 KB |
testcase_06 | AC | 1 ms
4,376 KB |
testcase_07 | AC | 60 ms
15,368 KB |
testcase_08 | AC | 51 ms
15,540 KB |
testcase_09 | AC | 225 ms
33,840 KB |
testcase_10 | AC | 211 ms
31,400 KB |
testcase_11 | AC | 228 ms
31,188 KB |
testcase_12 | AC | 210 ms
29,980 KB |
testcase_13 | AC | 360 ms
38,796 KB |
testcase_14 | AC | 363 ms
38,676 KB |
testcase_15 | AC | 339 ms
36,860 KB |
testcase_16 | AC | 345 ms
37,996 KB |
testcase_17 | AC | 353 ms
36,764 KB |
testcase_18 | AC | 2 ms
4,376 KB |
testcase_19 | AC | 2 ms
4,384 KB |
testcase_20 | AC | 3 ms
4,380 KB |
testcase_21 | AC | 2 ms
4,376 KB |
testcase_22 | AC | 336 ms
34,676 KB |
testcase_23 | AC | 248 ms
28,780 KB |
testcase_24 | AC | 347 ms
36,000 KB |
testcase_25 | AC | 317 ms
35,196 KB |
testcase_26 | AC | 331 ms
36,164 KB |
testcase_27 | AC | 2 ms
4,380 KB |
testcase_28 | AC | 2 ms
4,376 KB |
testcase_29 | AC | 1 ms
4,376 KB |
testcase_30 | AC | 1 ms
4,380 KB |
testcase_31 | AC | 2 ms
4,376 KB |
testcase_32 | AC | 1 ms
4,380 KB |
testcase_33 | AC | 1 ms
4,376 KB |
testcase_34 | AC | 1 ms
4,380 KB |
testcase_35 | AC | 2 ms
4,376 KB |
testcase_36 | AC | 2 ms
4,376 KB |
testcase_37 | AC | 2 ms
4,376 KB |
testcase_38 | AC | 279 ms
38,844 KB |
testcase_39 | AC | 689 ms
39,848 KB |
testcase_40 | AC | 251 ms
30,664 KB |
testcase_41 | AC | 598 ms
39,244 KB |
testcase_42 | AC | 572 ms
39,332 KB |
testcase_43 | AC | 635 ms
38,908 KB |
testcase_44 | AC | 670 ms
39,652 KB |
コンパイルメッセージ
/dmd2/linux/bin64/../../src/phobos/std/numeric.d(2999): Warning: cannot inline function `std.numeric.gcdImpl!ulong.gcdImpl` /dmd2/linux/bin64/../../src/phobos/std/numeric.d(2999): Warning: cannot inline function `std.numeric.gcdImpl!ulong.gcdImpl`
ソースコード
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)); } // T: monoid // op: T * T -> T // query(a, b): returns t_a ... t_{b-1} class SegmentTree(T, alias op) { import std.functional : binaryFun; alias opFun = binaryFun!op; const(T) idT; int n; T[] ts; this(int n_, const(T) idT) { this.idT = idT; for (n = 1; n < n_; n <<= 1) {} ts = new T[n << 1]; ts[] = idT; } this(inout(T)[] ts_, const(T) idT) { this.idT = idT; const n_ = cast(int)(ts_.length); for (n = 1; n < n_; n <<= 1) {} ts = new T[n << 1]; ts[0 .. n] = idT; ts[n .. n + n_] = ts_[]; ts[n + n_ .. n << 1] = idT; build(); } ref T at(int a) { return ts[n + a]; } void build() { foreach_reverse (a; 1 .. n) ts[a] = opFun(ts[a << 1], ts[a << 1 | 1]); } void set(int a, const(T) val) { ts[a += n] = val; for (; a >>= 1; ) ts[a] = opFun(ts[a << 1], ts[a << 1 | 1]); } void mulL(int a, const(T) val) { set(a, opFun(val, ts[a + n])); } void mulR(int a, const(T) val) { set(a, opFun(ts[a + n], val)); } T query(int a, int b) const { T prodL = idT, prodR = idT; for (a += n, b += n; a < b; a >>= 1, b >>= 1) { if (a & 1) prodL = opFun(prodL, ts[a++]); if (b & 1) prodR = opFun(ts[--b], prodR); } return opFun(prodL, prodR); } // min b s.t. pred(prod of [a, b)) (or n + 1 if no such b) // 0 <= a <= n // assume pred(prod of [a, b)) is non-decreasing in b int binarySearchR(int a, bool delegate(T) pred) const { if (pred(idT)) return a; if (a == n) return n + 1; T prod = idT; for (a += n; ; a >>= 1) { if (a & 1) { if (pred(opFun(prod, ts[a]))) { for (; a < n; ) { a <<= 1; if (!pred(opFun(prod, ts[a]))) { prod = opFun(prod, ts[a++]); } } return a - n + 1; } prod = opFun(prod, ts[a++]); if (!(a & a - 1)) return n + 1; } } } // max a s.t. pred(prod of [a, b)) (or -1 if no such a) // 0 <= b <= n // assume pred(prod of [a, b)) is non-increasing in a int binarySearchL(int b, bool delegate(T) pred) const { if (pred(idT)) return b; if (b == 0) return -1; T prod = idT; for (b += n; ; b >>= 1) { if ((b & 1) || b == 2) { if (pred(opFun(prod, ts[b - 1]))) { for (; b <= n; ) { b <<= 1; if (!pred(opFun(prod, ts[b - 1]))) { prod = opFun(prod, ts[--b]); } } return b - n - 1; } prod = opFun(prod, ts[--b]); if (!(b & b - 1)) return -1; } } } } void main() { try { for (; ; ) { const N = readInt(); auto A = new long[N]; foreach (i; 0 .. N) { A[i] = readLong(); } auto seg = new SegmentTree!(long, gcd)(A, 0); long ans; foreach (i; 0 .. N) { const res = seg.binarySearchR(i, a => (a == 1)); debug { writeln(i, ": ", res); } ans += max(N - res + 1, 0); } writeln(ans); } } catch (EOFException e) { } }