結果
問題 | No.935 う し た ぷ に き あ く ん 笑 ビ - ム |
ユーザー | daut-dlang |
提出日時 | 2019-11-29 22:59:12 |
言語 | D (dmd 2.106.1) |
結果 |
WA
|
実行時間 | - |
コード長 | 2,606 bytes |
コンパイル時間 | 924 ms |
コンパイル使用メモリ | 108,100 KB |
実行使用メモリ | 227,220 KB |
最終ジャッジ日時 | 2023-09-04 03:29:07 |
合計ジャッジ時間 | 22,348 ms |
ジャッジサーバーID (参考情報) |
judge11 / judge12 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | WA | - |
testcase_01 | AC | 62 ms
20,268 KB |
testcase_02 | AC | 76 ms
21,608 KB |
testcase_03 | AC | 194 ms
59,512 KB |
testcase_04 | AC | 400 ms
69,556 KB |
testcase_05 | AC | 179 ms
59,024 KB |
testcase_06 | AC | 237 ms
59,692 KB |
testcase_07 | AC | 291 ms
65,452 KB |
testcase_08 | AC | 1,099 ms
227,220 KB |
testcase_09 | AC | 476 ms
75,116 KB |
testcase_10 | AC | 510 ms
77,480 KB |
testcase_11 | AC | 990 ms
222,408 KB |
testcase_12 | AC | 1 ms
4,380 KB |
testcase_13 | AC | 1 ms
4,380 KB |
testcase_14 | AC | 1 ms
4,376 KB |
testcase_15 | WA | - |
testcase_16 | AC | 1 ms
4,380 KB |
testcase_17 | AC | 207 ms
4,380 KB |
testcase_18 | AC | 492 ms
75,708 KB |
testcase_19 | AC | 332 ms
60,540 KB |
testcase_20 | AC | 779 ms
84,796 KB |
testcase_21 | AC | 27 ms
5,884 KB |
testcase_22 | AC | 130 ms
23,096 KB |
testcase_23 | AC | 1 ms
4,376 KB |
testcase_24 | AC | 5 ms
4,384 KB |
testcase_25 | AC | 3 ms
4,380 KB |
testcase_26 | AC | 4 ms
4,384 KB |
testcase_27 | AC | 2 ms
4,376 KB |
testcase_28 | AC | 3 ms
4,376 KB |
testcase_29 | AC | 4 ms
4,380 KB |
testcase_30 | AC | 3 ms
4,380 KB |
testcase_31 | AC | 3 ms
4,380 KB |
testcase_32 | AC | 4 ms
4,380 KB |
testcase_33 | AC | 885 ms
220,968 KB |
testcase_34 | AC | 600 ms
77,964 KB |
testcase_35 | AC | 628 ms
80,708 KB |
testcase_36 | AC | 234 ms
62,672 KB |
testcase_37 | AC | 648 ms
83,636 KB |
testcase_38 | AC | 277 ms
61,340 KB |
testcase_39 | AC | 645 ms
78,348 KB |
testcase_40 | AC | 693 ms
81,436 KB |
testcase_41 | AC | 698 ms
81,572 KB |
testcase_42 | AC | 719 ms
84,876 KB |
testcase_43 | AC | 727 ms
82,108 KB |
testcase_44 | AC | 87 ms
20,872 KB |
testcase_45 | AC | 1,051 ms
226,588 KB |
testcase_46 | AC | 28 ms
6,164 KB |
testcase_47 | AC | 172 ms
23,448 KB |
testcase_48 | AC | 488 ms
76,172 KB |
testcase_49 | AC | 184 ms
24,748 KB |
testcase_50 | AC | 486 ms
75,912 KB |
testcase_51 | AC | 407 ms
71,216 KB |
testcase_52 | AC | 395 ms
69,192 KB |
testcase_53 | AC | 1,062 ms
226,056 KB |
testcase_54 | AC | 333 ms
69,196 KB |
testcase_55 | AC | 17 ms
6,220 KB |
testcase_56 | AC | 593 ms
79,084 KB |
testcase_57 | AC | 331 ms
66,076 KB |
testcase_58 | AC | 1 ms
4,380 KB |
testcase_59 | AC | 1 ms
4,380 KB |
コンパイルメッセージ
/dmd2/linux/bin64/../../src/phobos/std/numeric.d(2999): Warning: cannot inline function `std.numeric.gcdImpl!ulong.gcdImpl`
ソースコード
import std.stdio, std.conv, std.functional, std.string; import std.algorithm, std.array, std.container, std.range, std.typecons; import 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; } bool inside(T)(T x, T b, T e) { return x >= b && x < e; } long lcm(long x, long y) { return x * (y / gcd(x, y)); } long mod = 10^^9 + 7; //long mod = 998244353; //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; } int binarySearch(alias pred, T)(in T[] arr, bool isLower = true) { int ok, ng; if (isLower) { ok = cast(int)arr.length; ng = -1; } else { ok = -1; ng = cast(int)arr.length; } while (abs(ok-ng) > 1) { auto mid = (ok+ng) / 2; if (unaryFun!pred(arr[mid])) ok = mid; else ng = mid; } return ok; } void main() { auto N = RD; auto S = RD!string; auto A = RDA; auto Q = RD; auto K = RDA; auto B = new long[2][](N+1); foreach (i; 0..N) { B[i+1][0] = B[i][0] + A[i]; B[i+1][1] = B[i][1] + (S[i] == 'E' ? 1 : 0); } long[long] set; foreach (i; 0..N-1) { foreach (j; i..N) { auto c = B[j+1][0] - B[i][0]; auto last = set.get(c, 0); set[c] = max(last, B[j+1][1] - B[i][1]); } } auto ans = new long[](Q); auto keys = set.keys; keys.sort(); foreach (i; 0..Q) { auto p = keys.binarySearch!((long x) => x > K[i])(); if (p == 0) continue; auto pp = keys[0..p].MIN_POS!((long a, long b) => set[a] > set[b])(); ans[i] = set[keys[pp]]; } foreach (e; ans) writeln(e); stdout.flush; debug readln; }