結果
問題 | No.935 う し た ぷ に き あ く ん 笑 ビ - ム |
ユーザー | daut-dlang |
提出日時 | 2019-11-29 23:01:53 |
言語 | D (dmd 2.109.1) |
結果 |
AC
|
実行時間 | 1,134 ms / 2,000 ms |
コード長 | 2,604 bytes |
コンパイル時間 | 1,046 ms |
コンパイル使用メモリ | 121,516 KB |
実行使用メモリ | 230,028 KB |
最終ジャッジ日時 | 2024-06-22 03:12:35 |
合計ジャッジ時間 | 23,820 ms |
ジャッジサーバーID (参考情報) |
judge5 / judge3 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 12 ms
6,812 KB |
testcase_01 | AC | 71 ms
18,400 KB |
testcase_02 | AC | 88 ms
20,668 KB |
testcase_03 | AC | 220 ms
58,356 KB |
testcase_04 | AC | 407 ms
69,676 KB |
testcase_05 | AC | 208 ms
58,676 KB |
testcase_06 | AC | 267 ms
61,064 KB |
testcase_07 | AC | 314 ms
64,512 KB |
testcase_08 | AC | 1,113 ms
230,028 KB |
testcase_09 | AC | 539 ms
74,880 KB |
testcase_10 | AC | 576 ms
77,460 KB |
testcase_11 | AC | 1,014 ms
222,152 KB |
testcase_12 | AC | 2 ms
6,940 KB |
testcase_13 | AC | 1 ms
6,944 KB |
testcase_14 | AC | 1 ms
6,940 KB |
testcase_15 | AC | 1 ms
6,940 KB |
testcase_16 | AC | 2 ms
6,940 KB |
testcase_17 | AC | 210 ms
6,940 KB |
testcase_18 | AC | 546 ms
74,352 KB |
testcase_19 | AC | 341 ms
59,632 KB |
testcase_20 | AC | 845 ms
84,904 KB |
testcase_21 | AC | 28 ms
6,944 KB |
testcase_22 | AC | 154 ms
24,664 KB |
testcase_23 | AC | 1 ms
6,944 KB |
testcase_24 | AC | 4 ms
6,944 KB |
testcase_25 | AC | 4 ms
6,944 KB |
testcase_26 | AC | 5 ms
6,944 KB |
testcase_27 | AC | 1 ms
6,940 KB |
testcase_28 | AC | 3 ms
6,940 KB |
testcase_29 | AC | 3 ms
6,940 KB |
testcase_30 | AC | 3 ms
6,940 KB |
testcase_31 | AC | 3 ms
6,944 KB |
testcase_32 | AC | 5 ms
6,940 KB |
testcase_33 | AC | 966 ms
221,524 KB |
testcase_34 | AC | 664 ms
77,468 KB |
testcase_35 | AC | 689 ms
80,480 KB |
testcase_36 | AC | 274 ms
62,592 KB |
testcase_37 | AC | 728 ms
85,268 KB |
testcase_38 | AC | 305 ms
61,572 KB |
testcase_39 | AC | 709 ms
78,084 KB |
testcase_40 | AC | 766 ms
83,020 KB |
testcase_41 | AC | 765 ms
82,528 KB |
testcase_42 | AC | 778 ms
83,296 KB |
testcase_43 | AC | 797 ms
82,412 KB |
testcase_44 | AC | 90 ms
17,656 KB |
testcase_45 | AC | 1,128 ms
228,044 KB |
testcase_46 | AC | 30 ms
6,944 KB |
testcase_47 | AC | 195 ms
23,156 KB |
testcase_48 | AC | 547 ms
75,328 KB |
testcase_49 | AC | 209 ms
24,544 KB |
testcase_50 | AC | 560 ms
75,652 KB |
testcase_51 | AC | 464 ms
70,548 KB |
testcase_52 | AC | 444 ms
69,028 KB |
testcase_53 | AC | 1,134 ms
227,216 KB |
testcase_54 | AC | 375 ms
69,188 KB |
testcase_55 | AC | 19 ms
6,940 KB |
testcase_56 | AC | 643 ms
79,524 KB |
testcase_57 | AC | 363 ms
66,708 KB |
testcase_58 | AC | 1 ms
6,944 KB |
testcase_59 | AC | 1 ms
6,944 KB |
コンパイルメッセージ
/home/linuxbrew/.linuxbrew/opt/dmd/include/dlang/dmd/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){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;}