結果

問題 No.3147 Parentheses Modification and Rotation (RM Ver.)
ユーザー 👑 hos.lyric
提出日時 2025-05-16 21:50:28
言語 D
(dmd 2.109.1)
結果
AC  
実行時間 9 ms / 2,000 ms
コード長 3,404 bytes
コンパイル時間 2,296 ms
コンパイル使用メモリ 108,332 KB
実行使用メモリ 7,844 KB
最終ジャッジ日時 2025-05-16 21:50:33
合計ジャッジ時間 3,736 ms
ジャッジサーバーID
（参考情報） 		judge5 / judge2
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 2
other AC * 33
権限があれば一括ダウンロードができます

ソースコード

diff # 

import std.conv, std.functional, std.range, std.stdio, std.string;
import std.algorithm, std.array, std.bigint, std.bitmanip, std.complex, std.container, std.math, std.mathspecial, std.numeric, 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; }

string COLOR(string s = "") { return "\x1b[" ~ s ~ "m"; }

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)); }


// op: T * T -> T, associative
struct Queue(T, alias op) {
  import std.functional : binaryFun;
  alias opFun = binaryFun!op;

  int asLen, bsLen;
  T[] as, aas, bs, bbs;

  this(int n) {
    asLen = bsLen = 0;
    reserve(n);
  }
  void reserve(int n) {
    assert(asLen + bsLen <= n);
    as.length = aas.length = bs.length = bbs.length = n;
  }
  void reduce() {
    for (; bsLen != 0; ++asLen, --bsLen) {
      as[asLen] = bs[bsLen - 1];
      aas[asLen] = (asLen == 0) ? bs[bsLen - 1] : opFun(bs[bsLen - 1], aas[asLen - 1]);
    }
  }
  int size() const {
    return asLen + bsLen;
  }
  void push(T t) {
    insertBack(t);
  }
  void pop() {
    removeFront();
  }
  T get() {
    if (asLen == 0) reduce();
    assert(asLen != 0);
    return (bsLen == 0) ? aas[asLen - 1] : opFun(aas[asLen - 1], bbs[bsLen - 1]);
  }

  bool empty() const {
    return (asLen == 0 && bsLen == 0);
  }
  void clear() {
    asLen = bsLen = 0;
  }
  T front() {
    if (asLen == 0) reduce();
    assert(asLen != 0);
    return as[asLen - 1];
  }
  void insertBack(T t) {
    bs[bsLen] = t;
    bbs[bsLen] = (bsLen == 0) ? t : opFun(bbs[bsLen - 1], t);
    ++bsLen;
  }
  void removeFront() {
    if (asLen == 0) reduce();
    assert(asLen != 0);
    --asLen;
  }
}


void main() {
  try {
    for (; ; ) {
      const N = readInt;
      const S = readToken;
      const CR = readLong;
      const CM = readLong;
      
      if (N & 1) {
        writeln(-1);
      } else {
        auto H = new int[2*N + 1];
        foreach (i; 0 .. 2*N) {
          H[i + 1] = H[i] + ((S[i % N] == ')') ? -1 : +1);
        }
        debug writeln("H = ", H);
        auto que = Queue!(int, "min(a, b)")(2*N + 1);
        foreach (i; 0 .. N) que.push(H[i]);
        long ans = long.max;
        foreach (i; 0 .. N) {
          // H[i, i+N]
          que.push(H[i + N]);
          const mn = que.get;
          que.pop;
          const a = H[i] - mn;
          const b = H[i + N] - mn;
          long cost;
          cost += CR * (i ? (N - i) : 0);
          cost += CM * ((a + 1) / 2 + (b + 1) / 2);
          debug writeln(i, ": ", cost);
          chmin(ans, cost);
        }
        writeln(ans);
      }
    }
  } catch (EOFException e) {
  }
}
0