結果
問題 | No.1884 Sequence |
ユーザー | daut-dlang |
提出日時 | 2022-03-25 21:43:28 |
言語 | D (dmd 2.106.1) |
結果 |
RE
|
実行時間 | - |
コード長 | 2,893 bytes |
コンパイル時間 | 936 ms |
コンパイル使用メモリ | 126,732 KB |
実行使用メモリ | 28,080 KB |
最終ジャッジ日時 | 2024-06-22 14:40:25 |
合計ジャッジ時間 | 6,682 ms |
ジャッジサーバーID (参考情報) |
judge1 / judge5 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 1 ms
6,816 KB |
testcase_01 | AC | 1 ms
6,944 KB |
testcase_02 | AC | 1 ms
6,940 KB |
testcase_03 | RE | - |
testcase_04 | RE | - |
testcase_05 | AC | 1 ms
6,944 KB |
testcase_06 | AC | 1 ms
6,944 KB |
testcase_07 | AC | 1 ms
6,940 KB |
testcase_08 | AC | 1 ms
6,940 KB |
testcase_09 | AC | 1 ms
6,944 KB |
testcase_10 | AC | 111 ms
13,024 KB |
testcase_11 | AC | 109 ms
12,884 KB |
testcase_12 | WA | - |
testcase_13 | WA | - |
testcase_14 | AC | 20 ms
6,940 KB |
testcase_15 | AC | 60 ms
11,852 KB |
testcase_16 | AC | 85 ms
13,552 KB |
testcase_17 | AC | 37 ms
12,128 KB |
testcase_18 | AC | 47 ms
11,520 KB |
testcase_19 | AC | 39 ms
12,556 KB |
testcase_20 | AC | 53 ms
11,864 KB |
testcase_21 | AC | 43 ms
12,368 KB |
testcase_22 | AC | 57 ms
12,084 KB |
testcase_23 | AC | 84 ms
12,708 KB |
testcase_24 | AC | 84 ms
12,872 KB |
testcase_25 | AC | 83 ms
12,628 KB |
testcase_26 | AC | 84 ms
12,780 KB |
testcase_27 | RE | - |
testcase_28 | RE | - |
testcase_29 | AC | 24 ms
7,264 KB |
testcase_30 | AC | 25 ms
7,468 KB |
testcase_31 | RE | - |
testcase_32 | RE | - |
testcase_33 | AC | 66 ms
12,956 KB |
testcase_34 | AC | 66 ms
13,148 KB |
testcase_35 | AC | 28 ms
9,200 KB |
testcase_36 | AC | 55 ms
12,188 KB |
testcase_37 | AC | 67 ms
13,148 KB |
testcase_38 | AC | 61 ms
12,392 KB |
testcase_39 | RE | - |
testcase_40 | RE | - |
testcase_41 | AC | 73 ms
11,908 KB |
testcase_42 | AC | 71 ms
12,048 KB |
ソースコード
import std.stdio, std.conv, std.functional, std.string; import std.algorithm, std.array, std.container, std.range, std.typecons; import std.bigint, std.numeric, std.math, std.random; import core.bitop; string FMT_F = "%.10f"; static File _f; void file_io(string fn) { _f = File(fn, "r"); } static string[] s_rd; T _RD(T = long)() { while(!s_rd.length) s_rd = readln.chomp.split; string res = s_rd[0]; s_rd.popFront; return res.to!T; } T _RD(T = long)(File f) { while(!s_rd.length) s_rd = f.readln.chomp.split; string res = s_rd[0]; s_rd.popFront; return res.to!T; } T[] _RDA(T = long)(T fix = 0) { auto r = readln.chomp.split.to!(T[]); r[] += fix; return r; } T[] _RDA(T = long)(File f, T fix = 0) { auto r = f.readln.chomp.split.to!(T[]); r[] += fix; return r; } T RD(T = long)() { if (_f.isOpen) return _RD!T(_f); else return _RD!T; } T[] RDA(T = long)(T fix = 0) { if (_f.isOpen) return _RDA!T(_f, fix); else return _RDA!T(fix); } size_t[] MAKE_IDX(alias less = "a < b", Range)(Range range) { auto idx = new size_t[](range.length); makeIndex!(less)(range, idx); return idx;} size_t MIN_POS(alias less = "a < b", Range)(Range range) { auto r = minPos!(less)(range); return range.length - r.length; } void chmin(T)(ref T x, T y) { x = min(x, y); } void chmax(T)(ref T x, T y) { x = max(x, y); } bool inside(T)(T x, T b, T e) { return x >= b && x < e; } T lcm(T)(T x, T y) { return x * (y / gcd(x, y)); } double euDist(T)(T[] a, T[] b) { auto c = a.dup; c[] -= b[]; c[] *= c[]; return sqrt(cast(double)c.sum); } double[] rotate(double[] vec, double rad) { return [cos(rad)*vec[0] - sin(rad)*vec[1], sin(rad)*vec[0] + cos(rad)*vec[1]]; } double norm(double[] vec) { return sqrt(reduce!((a,b)=>a+b*b)(0.0, vec)); } double dotProd(double[] a, double[] b) { auto r = a.dup; r[] *= b[]; return r.sum; } //long mod = 10^^9 + 7; long mod = 998_244_353; //long mod = 1_000_003; void moda(ref long x, long y) { x = (x + y) % mod; } void mods(ref long x, long y) { x = ((x + mod) - (y % mod)) % mod; } void modm(ref long x, long y) { x = (x * y) % mod; } void modpow(ref long x, long y) { if (!y) { x = 1; return; } auto t = x; x.modpow(y>>1); x.modm(x); if (y&1) x.modm(t); } void modd(ref long x, long y) { y.modpow(mod - 2); x.modm(y); } void main() { auto N = RD; auto A = RDA; A.sort; long cnt; while (!A.empty) { if (A.front != 0) break; ++cnt; A.popFront; } long[long] d; foreach (i; 0..A.length-1) { auto x = A[i+1] - A[i]; ++d[x]; } debug writeln(d); auto keys = d.keys.sort; auto x = keys[0]; bool ans = true; foreach (key; keys[1..$]) { bool ok; foreach (i; 1..cnt) { if (key % x) continue; if (key / x != i+1) continue; cnt -= i * d[key]; if (cnt >= 0) ok = true; break; } if (!ok) { ans = false; break; } debug writeln("key:", key, " cnt:", cnt); } writeln(ans ? "Yes" : "No"); stdout.flush; debug readln; }