結果
| 問題 | No.3147 Parentheses Modification and Rotation (RM Ver.) |
| ユーザー |
 dyktr_06
|
| 提出日時 | 2025-05-16 22:45:04 |
| 言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
| 結果 |
AC
|
| 実行時間 | 26 ms / 2,000 ms |
| コード長 | 9,173 bytes |
| コンパイル時間 | 1,883 ms |
| コンパイル使用メモリ | 201,476 KB |
| 実行使用メモリ | 11,804 KB |
| 最終ジャッジ日時 | 2025-05-16 22:45:09 |
| 合計ジャッジ時間 | 3,292 ms |
|
ジャッジサーバーID （参考情報） |
judge4 / judge2 |
（要ログイン）
| ファイルパターン | 結果 |
|---|---|
| sample | AC * 2 |
| other | AC * 33 |
ソースコード
#include <bits/stdc++.h>
using namespace std;
#define overload4(_1, _2, _3, _4, name, ...) name
#define rep1(n) for(int i = 0; i < (int)(n); ++i)
#define rep2(i, n) for(int i = 0; i < (int)(n); ++i)
#define rep3(i, a, b) for(int i = (a); i < (int)(b); ++i)
#define rep4(i, a, b, c) for(int i = (a); i < (int)(b); i += (c))
#define rep(...) overload4(__VA_ARGS__, rep4, rep3, rep2, rep1)(__VA_ARGS__)
#define rrep(i,n) for(int i = (int)(n) - 1; i >= 0; --i)
#define ALL(a) (a).begin(), (a).end()
#define Sort(a) (sort((a).begin(), (a).end()))
#define RSort(a) (sort((a).rbegin(), (a).rend()))
#define UNIQUE(a) (a.erase(unique((a).begin(), (a).end()), (a).end()))
typedef long long int ll;
typedef unsigned long long ul;
typedef long double ld;
typedef vector<int> vi;
typedef vector<long long> vll;
typedef vector<char> vc;
typedef vector<string> vst;
typedef vector<double> vd;
typedef vector<long double> vld;
typedef pair<long long, long long> P;
template<class T> long long sum(const T &a){ return accumulate(a.begin(), a.end(), 0LL); }
template<class T> auto min(const T &a){ return *min_element(a.begin(), a.end()); }
template<class T> auto max(const T &a){ return *max_element(a.begin(), a.end()); }
const long long MINF = 0x7fffffffffff;
const long long INF = 0x1fffffffffffffff;
const long long MOD = 998244353;
const long double EPS = 1e-9;
const long double PI = acos(-1);
template<class T> inline bool chmax(T &a, T b) { if(a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T &a, T b) { if(a > b) { a = b; return 1; } return 0; }
template<typename T1, typename T2> istream &operator>>(istream &is, pair<T1, T2> &p){ is >> p.first >> p.second; return is; }
template<typename T1, typename T2> ostream &operator<<(ostream &os, const pair<T1, T2> &p){ os << "(" << p.first << ", " << p.second << ")"; return os; }
template<typename T> istream &operator>>(istream &is, vector<T> &v){ for(T &in : v) is >> in; return is; }
template<typename T> ostream &operator<<(ostream &os, const vector<T> &v){ for(int i = 0; i < (int) v.size(); ++i){ os << v[i] << (i + 1 != (int) v.size() ? " " : ""); } return os; }
template <typename T, typename S> ostream &operator<<(ostream &os, const map<T, S> &mp){ for(auto &[key, val] : mp){ os << key << ":" << val << " "; } return os; }
template <typename T> ostream &operator<<(ostream &os, const set<T> &st){ auto itr = st.begin(); for(int i = 0; i < (int) st.size(); ++i){ os << *itr << (i + 1 != (int) st.size() ? " " : ""); itr++; } return os; }
template <typename T> ostream &operator<<(ostream &os, const multiset<T> &st){ auto itr = st.begin(); for(int i = 0; i < (int) st.size(); ++i){ os << *itr << (i + 1 != (int) st.size() ? " " : ""); itr++; } return os; }
template <typename T> ostream &operator<<(ostream &os, queue<T> q){ while(q.size()){ os << q.front() << " "; q.pop(); } return os; }
template <typename T> ostream &operator<<(ostream &os, deque<T> q){ while(q.size()){ os << q.front() << " "; q.pop_front(); } return os; }
template <typename T> ostream &operator<<(ostream &os, stack<T> st){ while(st.size()){ os << st.top() << " "; st.pop(); } return os; }
template <class T, class Container, class Compare> ostream &operator<<(ostream &os, priority_queue<T, Container, Compare> pq){ while(pq.size()){ os << pq.top() << " "; pq.pop(); } return os; }
template <typename T>
long long binary_search(long long ok, long long ng, T check){
while(abs(ok - ng) > 1){
long long mid = (ok + ng) / 2;
if(check(mid)) ok = mid;
else ng = mid;
}
return ok;
}
template <typename T>
long double binary_search_real(long double ok, long double ng, T check, int iter = 100){
for(int i = 0; i < iter; ++i){
long double mid = (ok + ng) / 2;
if(check(mid)) ok = mid;
else ng = mid;
}
return ok;
}
template <typename T>
long long trisum(T a, T b){
long long res = ((b - a + 1) * (a + b)) / 2;
return res;
}
template <typename T>
T intpow(T x, int n){
T ret = 1;
while(n > 0) {
if(n & 1) (ret *= x);
(x *= x);
n >>= 1;
}
return ret;
}
template <typename T>
T getReminder(T a, T b){
if(b == 0) return -1;
if(a >= 0 && b > 0){
return a % b;
} else if(a < 0 && b > 0){
return ((a % b) + b) % b;
} else if(a >= 0 && b < 0){
return a % b;
} else{
return (abs(b) - abs(a % b)) % b;
}
}
template<class T, class U> inline T vin(T &vec, U n) { vec.resize(n); for(int i = 0; i < (int) n; ++i) cin >> vec[i]; return vec; }
template<class T> inline void vout(T vec, string s = "\n"){ for(auto x : vec) cout << x << s; }
template<class... T> void in(T&... a){ (cin >> ... >> a); }
void out(){ cout << '\n'; }
template<class T, class... Ts> void out(const T &a, const Ts&... b){ cout << a; (cout << ... << (cout << ' ', b)); cout << '\n'; }
template<class T, class U> void inGraph(vector<vector<T>> &G, U n, U m, bool directed = false){ G.resize(n); for(int i = 0; i < m; ++i){ int a, b; cin >> a >> b; a--, b--; G[a].push_back(b); if(!directed) G[b].push_back(a); } }
template <typename T, T (*op)(T, T), T(*e)()>
struct SegTree{
int _n, n;
std::vector<T> dat;
SegTree(int _n) : _n(_n) {
int x = 1;
while(_n > x){
x *= 2;
}
n = x;
dat.resize(n * 2);
for(int i = 0; i < n * 2; ++i){
dat[i] = e();
}
}
SegTree(std::vector<T> &v) : _n((int) v.size()) {
int x = 1;
while((int) v.size() > x){
x *= 2;
}
n = x;
dat.resize(n * 2);
for(int i = 0; i < n; ++i){
set(i, (i < (int) v.size() ? v[i] : e()));
}
build();
}
private:
void set(int i, const T &x){ dat[i + n] = x; }
void build(){
for(int k = n - 1; k >= 1; k--) dat[k] = op(dat[k * 2], dat[k * 2 + 1]);
}
public:
T get(int i) const {
assert(0 <= i && i < n);
return dat[i + n];
}
void update(int i, const T &x){
assert(0 <= i && i < n);
i += n;
dat[i] = x;
while(i > 0){
i >>= 1; // parent
dat[i] = op(dat[i * 2], dat[i * 2 + 1]);
}
}
T query(int a, int b){
assert(0 <= a && a <= b && b <= n);
T vl = e();
T vr = e();
int l = a + n;
int r = b + n;
while(l < r){
if(l & 1) vl = op(vl, dat[l++]);
if(r & 1) vr = op(dat[--r], vr);
l >>= 1;
r >>= 1;
}
return op(vl, vr);
}
template <class F>
int max_right(int l, F f) const {
assert(0 <= l && l <= _n);
assert(f(e()));
if(l == _n) return _n;
l += n;
T sm = e();
do{
while(l % 2 == 0) l >>= 1;
if(!f(op(sm, dat[l]))){
while(l < n){
l = (2 * l);
if(f(op(sm, dat[l]))){
sm = op(sm, dat[l]);
l++;
}
}
return l - n;
}
sm = op(sm, dat[l]);
l++;
}while((l & -l) != l);
return _n;
}
template <class F>
int min_left(int r, F f) const {
assert(0 <= r && r <= _n);
assert(f(e()));
if(r == 0) return 0;
r += n;
T sm = e();
do{
r--;
while(r > 1 && (r % 2)) r >>= 1;
if(!f(op(dat[r], sm))){
while(r < n){
r = (2 * r + 1);
if(f(op(dat[r], sm))){
sm = op(dat[r], sm);
r--;
}
}
return r + 1 - n;
}
sm = op(dat[r], sm);
}while((r & -r) != r);
return 0;
}
};
P op(P a, P b){ return {min(a.first, a.second + b.first), a.second + b.second}; }
P e(){ return {0, 0}; }
ll T;
void input(){
in(T);
}
void solve(){
ll n; in(n);
string s; in(s);
ll r, m; in(r, m);
if(n % 2){
out(-1);
return;
}
s += s;
SegTree<P, op, e> seg(n * 2);
rep(i, n * 2){
if(s[i] == '('){
seg.update(i, {0, 1});
}else{
seg.update(i, {-1, -1});
}
}
ll ans = INF;
for(int i = n; i > 0; i--){
ll cost = r * (n - i);
auto [csmin, cs] = seg.query(i, i + n);
ll d = (-csmin + 1) / 2;
cost += d * m;
cs += d * 2;
cost += m * (abs(cs) / 2);
// ll cs = 0;
// rep(j, i, i + n){
// if(s[j] == '('){
// cs++;
// }else{
// if(cs == 0){
// cs++;
// cost += m;
// }else{
// cs--;
// }
// }
// }
// cost += m * cs / 2;
chmin(ans, cost);
}
out(ans);
}
int main(){
ios::sync_with_stdio(false);
cin.tie(nullptr);
cout << fixed << setprecision(20);
T = 1;
// input();
while(T--) solve();
}