結果
問題 | No.684 Prefix Parenthesis |
ユーザー | te-sh |
提出日時 | 2020-01-27 20:21:50 |
言語 | D (dmd 2.106.1) |
結果 |
AC
|
実行時間 | 15 ms / 2,000 ms |
コード長 | 2,438 bytes |
コンパイル時間 | 1,741 ms |
コンパイル使用メモリ | 149,992 KB |
実行使用メモリ | 6,944 KB |
最終ジャッジ日時 | 2024-06-22 04:37:25 |
合計ジャッジ時間 | 2,719 ms |
ジャッジサーバーID (参考情報) |
judge2 / judge4 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 1 ms
6,816 KB |
testcase_01 | AC | 1 ms
6,940 KB |
testcase_02 | AC | 1 ms
6,944 KB |
testcase_03 | AC | 5 ms
6,944 KB |
testcase_04 | AC | 10 ms
6,944 KB |
testcase_05 | AC | 11 ms
6,940 KB |
testcase_06 | AC | 5 ms
6,940 KB |
testcase_07 | AC | 10 ms
6,944 KB |
testcase_08 | AC | 2 ms
6,944 KB |
testcase_09 | AC | 2 ms
6,940 KB |
testcase_10 | AC | 14 ms
6,940 KB |
testcase_11 | AC | 8 ms
6,940 KB |
testcase_12 | AC | 3 ms
6,944 KB |
testcase_13 | AC | 12 ms
6,940 KB |
testcase_14 | AC | 12 ms
6,940 KB |
testcase_15 | AC | 6 ms
6,940 KB |
testcase_16 | AC | 12 ms
6,940 KB |
testcase_17 | AC | 7 ms
6,940 KB |
testcase_18 | AC | 1 ms
6,940 KB |
testcase_19 | AC | 13 ms
6,940 KB |
testcase_20 | AC | 15 ms
6,944 KB |
testcase_21 | AC | 13 ms
6,940 KB |
testcase_22 | AC | 12 ms
6,940 KB |
testcase_23 | AC | 13 ms
6,940 KB |
testcase_24 | AC | 12 ms
6,940 KB |
testcase_25 | AC | 13 ms
6,940 KB |
testcase_26 | AC | 1 ms
6,944 KB |
testcase_27 | AC | 1 ms
6,940 KB |
testcase_28 | AC | 1 ms
6,944 KB |
testcase_29 | AC | 14 ms
6,944 KB |
testcase_30 | AC | 13 ms
6,940 KB |
ソースコード
// URL: https://yukicoder.me/problems/no/684import std.algorithm, std.array, std.container, std.math, std.range, std.typecons, std.string;version(unittest) {} elsevoid main(){long N; io.getV(N);string S; io.getV(S);auto a = new long[](N);foreach (i; 0..N) a[i] = S[i] == '(' ? 1 : -1;foreach (i; 1..N) a[i] = a[i-1] + a[i];struct AM { long a, m; }auto am = new AM[](N), m = 0L;foreach (i; 0..N) {m = min(m, a[i]);am[i] = AM(a[i], m);}am.sort!((a, b) => min(a.m, a.a+b.m) > min(b.m, b.a+a.m));auto ami = am[0];foreach (i; 1..N) {ami.m = min(ami.m, ami.a + am[i].m);ami.a += am[i].a;}io.put(N*(N+1)/2 - ami.a + ami.m*2);}auto io = IO!()();import std.stdio;struct IO(string floatFormat = "%.10f", string delimiter = " ", alias IN = stdin, alias OUT = stdout){import std.conv, std.format, std.meta, std.traits;auto getV(T...)(ref T v) { foreach (ref w; v) get(w); }auto getA(T)(size_t n, ref T v) if (hasAssignableElements!T){ v = new T(n); foreach (ref w; v) get(w); }auto getC(T...)(size_t n, ref T v)if (allSatisfy!(hasAssignableElements, T)){foreach (ref w; v) w = new typeof(w)(n);foreach (i; 0..n) foreach (ref w; v) get(w[i]);}auto getM(T)(size_t r, size_t c, ref T v)if (hasAssignableElements!T && hasAssignableElements!(ElementType!T)){v = new T(r); foreach (ref w; v) getA(c, w);}template getS(E...){auto getS(T)(size_t n, ref T v){v = new T(n); foreach (ref w; v) foreach (e; E) mixin("get(w."~e~");");}}auto put(bool flush = false, T...)(T v){foreach (i, w; v) { putA(w); if (i < v.length-1) OUT.write(delimiter); }OUT.writeln;static if (flush) OUT.flush();}auto putB(S, T)(bool c, S t, T f) { if (c) put(t); else put(f); }auto putRaw(T...)(T v) { OUT.write(v); OUT.writeln; }private{dchar[] buf;auto sp = (new dchar[](0)).splitter;void nextLine() { IN.readln(buf); sp = buf.splitter; }auto get(T)(ref T v) { if (sp.empty) nextLine(); v = sp.front.to!T; sp.popFront(); }auto putR(T)(T v){auto w = v;while (!w.empty) { putA(w.front); w.popFront(); if (!w.empty) OUT.write(delimiter); }}auto putA(T)(T v){static if (isInputRange!T && !isSomeString!T) putR(v);else if (isFloatingPoint!T) OUT.write(format(floatFormat, v));else OUT.write(v);}}}