#313297 (D) No.684 Prefix Parenthesis

• 問題: No.684 Prefix Parenthesis
• ユーザー: 👑 hos.lyric
• 提出日時: 2019-01-28 02:28:01
• 言語: D (dmd 2.106.1)
• 結果: WA
• 実行時間: -
• コード長: 3,046 bytes
• コンパイル時間: 1,187 ms
• コンパイル使用メモリ: 127,296 KB
• 実行使用メモリ: 6,948 KB
• 最終ジャッジ日時: 2024-06-13 03:47:45
• 合計ジャッジ時間: 2,363 ms
• ジャッジサーバーID （参考情報）: judge5 / judge2

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	1 ms; 5,248 KB
testcase_01	AC	1 ms; 5,376 KB
testcase_02	AC	2 ms; 5,376 KB
testcase_03	AC	10 ms; 5,376 KB
testcase_04	AC	20 ms; 5,376 KB
testcase_05	AC	23 ms; 5,376 KB
testcase_06	AC	10 ms; 5,376 KB
testcase_07	AC	19 ms; 5,376 KB
testcase_08	AC	3 ms; 5,376 KB
testcase_09	AC	5 ms; 5,376 KB
testcase_10	AC	29 ms; 5,376 KB
testcase_11	AC	17 ms; 5,376 KB
testcase_12	AC	5 ms; 5,376 KB
testcase_13	AC	36 ms; 5,376 KB
testcase_14	AC	30 ms; 5,376 KB
testcase_15	AC	15 ms; 5,376 KB
testcase_16	WA	-
testcase_17	AC	8 ms; 5,376 KB
testcase_18	AC	1 ms; 5,376 KB
testcase_19	AC	25 ms; 5,376 KB
testcase_20	AC	29 ms; 5,376 KB
testcase_21	AC	27 ms; 5,376 KB
testcase_22	WA	-
testcase_23	AC	15 ms; 5,376 KB
testcase_24	AC	16 ms; 5,376 KB
testcase_25	AC	16 ms; 5,376 KB
testcase_26	AC	1 ms; 5,376 KB
testcase_27	AC	1 ms; 5,376 KB
testcase_28	AC	1 ms; 5,376 KB
testcase_29	AC	25 ms; 5,376 KB
testcase_30	AC	25 ms; 5,376 KB

ソースコード

import std.conv, std.functional, std.stdio, std.string;
import std.algorithm, std.array, std.bigint, std.container, std.math, std.numeric, std.range, std.regex, std.typecons;
import core.bitop;

class EOFException : Throwable { this() { super("EOF"); } }
string[] tokens;
string readToken() { for (; tokens.empty; ) { if (stdin.eof) { throw new EOFException; } tokens = readln.split; } auto token = tokens.front; tokens.popFront; return token; }
int readInt() { return readToken.to!int; }
long readLong() { return readToken.to!long; }
real readReal() { return readToken.to!real; }

bool chmin(T)(ref T t, in T f) { if (t > f) { t = f; return true; } else { return false; } }
bool chmax(T)(ref T t, in T f) { if (t < f) { t = f; return true; } else { return false; } }

int binarySearch(alias pred, T)(in T[] as) { int lo = -1, hi = cast(int)(as.length); for (; lo + 1 < hi; ) { const mid = (lo + hi) >> 1; (unaryFun!pred(as[mid]) ? hi : lo) = mid; } return hi; }
int lowerBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a >= val)); }
int upperBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a > val)); }


int N;
string S;

void main() {
  /*
  int opt = -1;
  int[][][] ps;
  {
    // auto p = [[3, 1], [4, 1], [5, 9], [2, 1]];
    auto p = [[3, 1], [4, 1], [5, 9], [1, 2]];
    p.sort;
    do {
      int score;
      int[] a = [0, 0];
      foreach (b; p) {
        if (a[1] <= b[0]) {
          score += a[1];
          a = [a[0] + (b[0] - a[1]), b[1]];
        } else {
          score += b[0];
          a = [a[0], (a[1] - b[0]) + b[1]];
        }
      }
      if (chmax(opt, score)) {
        ps = [];
      }
      if (opt == score) {
        ps ~= p.dup;
      }
    } while (p.nextPermutation);
  }
  writeln(opt);
  foreach (p; ps) {
    writeln(p);
  }
  return;
  //*/
  
  try {
    for (; ; ) {
      N = readInt();
      S = readToken();
      long ans;
      alias Entry = Tuple!(int, int);
      Entry[] es;
      Entry e;
      int cnt;
      foreach (c; S) {
        switch (c) {
          case '(': {
            ++e[1];
          } break;
          case ')': {
            if (e[1] > 0) {
              ++cnt;
              --e[1];
            } else {
              ++e[0];
            }
          } break;
          default: assert(false);
        }
        ans += cnt;
        es ~= e;
      }
      debug {
        writeln("es = ", es);
      }
      es.sort!((a, b){
        const sa = sgn(a[0] - a[1]);
        const sb = sgn(b[0] - b[1]);
        if (sa != sb) {
          return (sa < sb);
        } else if (sa <= 0) {
          return ((a[0] != b[0]) ? (a[0] < b[0]) : (a[1] > b[1]));
        } else {
          return ((a[1] != b[1]) ? (a[1] > b[1]) : (a[0] < b[0]));
        }
      });
      debug {
        writeln("es = ", es);
      }
      Entry f;
      foreach (i; 0 .. N) {
        const t = min(f[1], es[i][0]);
        ans += t;
        f = tuple(f[0] + (es[i][0] - t), (f[1] - t) + es[i][1]);
      }
      ans *= 2;
      writeln(ans);
    }
  } catch (EOFException e) {
  }
}