結果
問題 | No.2015 Stair Counter |
ユーザー | daut-dlang |
提出日時 | 2022-07-22 21:32:39 |
言語 | D (dmd 2.107.1) |
結果 |
AC
|
実行時間 | 35 ms / 2,000 ms |
コード長 | 2,781 bytes |
コンパイル時間 | 1,212 ms |
コンパイル使用メモリ | 108,192 KB |
実行使用メモリ | 13,764 KB |
最終ジャッジ日時 | 2023-09-04 17:53:51 |
合計ジャッジ時間 | 2,777 ms |
ジャッジサーバーID (参考情報) |
judge13 / judge11 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 2 ms
4,380 KB |
testcase_01 | AC | 23 ms
4,380 KB |
testcase_02 | AC | 27 ms
4,380 KB |
testcase_03 | AC | 28 ms
4,376 KB |
testcase_04 | AC | 22 ms
4,380 KB |
testcase_05 | AC | 19 ms
4,380 KB |
testcase_06 | AC | 32 ms
4,388 KB |
testcase_07 | AC | 32 ms
4,380 KB |
testcase_08 | AC | 32 ms
4,380 KB |
testcase_09 | AC | 15 ms
6,900 KB |
testcase_10 | AC | 15 ms
6,920 KB |
testcase_11 | AC | 17 ms
6,924 KB |
testcase_12 | AC | 14 ms
6,140 KB |
testcase_13 | AC | 14 ms
6,428 KB |
testcase_14 | AC | 16 ms
6,616 KB |
testcase_15 | AC | 20 ms
7,232 KB |
testcase_16 | AC | 32 ms
10,156 KB |
testcase_17 | AC | 16 ms
10,200 KB |
testcase_18 | AC | 27 ms
8,540 KB |
testcase_19 | AC | 35 ms
13,764 KB |
testcase_20 | AC | 20 ms
10,168 KB |
testcase_21 | AC | 22 ms
4,380 KB |
testcase_22 | AC | 26 ms
4,380 KB |
testcase_23 | AC | 30 ms
4,380 KB |
testcase_24 | AC | 23 ms
4,380 KB |
testcase_25 | AC | 22 ms
4,380 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)); } T euDist2(T)(T[] a, T[] b) { auto c = a.dup; c[] -= b[]; c[] *= c[]; return c.sum; } double euDist(T)(T[] a, T[] b) { return sqrt(cast(double)euDist2(a,b)); } 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 T = RD; auto ans = new bool[](T); foreach (ti; 0..T) { auto N = RD; auto M = RD; auto A = RDA; ans[ti] = true; auto b = new long[](N+2); b[1] = M; foreach (i; 0..N) { b[i+2] += b[i]; auto rem = A[i] - b[i+2]; if (rem < 0 || b[i+1] < rem) { ans[ti] = false; break; } b[i+1] -= rem; b[i+2] += rem; } if (b[$-2] != 0) ans[ti] = false; } foreach (e; ans) writeln(e ? "Yes" : "No"); stdout.flush; debug readln; }