結果
問題 | No.3148 Min-Cost Destruction of Parentheses |
ユーザー |
![]() |
提出日時 | 2025-05-16 22:23:53 |
言語 | C++23 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 116 ms / 4,000 ms |
コード長 | 3,795 bytes |
コンパイル時間 | 4,169 ms |
コンパイル使用メモリ | 290,740 KB |
実行使用メモリ | 13,740 KB |
最終ジャッジ日時 | 2025-05-16 22:24:02 |
合計ジャッジ時間 | 6,332 ms |
ジャッジサーバーID (参考情報) |
judge1 / judge5 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 31 |
ソースコード
// #pragma GCC target("avx2") // #pragma GCC optimize("O3") // #pragma GCC optimize("unroll-loops") #include<bits/stdc++.h> using namespace std; using uint = unsigned int; using ll = long long; using ull = unsigned long long; using ld = long double; template<class T> using V = vector<T>; template<class T> using VV = V<V<T>>; template<class T> using VVV = V<VV<T>>; template<class T> using VVVV = VV<VV<T>>; #define rep(i,n) for(ll i=0ll;(i)<(n);(i)++) #define REP(i,a,n) for(ll i=(a);(i)<(n);(i)++) #define rrep(i,n) for(ll i=(n)-1;(i)>=(0ll);(i)--) #define RREP(i,a,n) for(ll i=(n)-1;(i)>=(a);(i)--) const long long INF = (1LL << 60); const long long mod99 = 998244353; const long long mod107 = 1000000007; const long long mod = mod99; #define eb emplace_back #define be(v) (v).begin(),(v).end() #define all(v) (v).begin(),(v).end() #define foa(i,v) for(auto& (i) : (v)) #define UQ(v) sort(be(v)), (v).erase(unique(be(v)), (v).end()) #define UQ2(v,cmp) sort(be(v)), (v).erase(unique(be(v),cmp), (v).end()) #define UQ3(v,cmp) sort(be(v),cmp), (v).erase(unique(be(v)), (v).end()) #define UQ4(v,cmp,cmp2) sort(be(v), cmp), (v).erase(unique(be(v),cmp2), (v).end()) #define LB(x,v) (lower_bound(be(v),(x))-(v).begin()) #define LB2(x,v,cmp) (lower_bound(be(v),(x),(cmp))-(v).begin()) #define UB(x,v) (upper_bound(be(v),(x))-(v).begin()) #define UB2(x,v,cmp) (upper_bound(be(v),(x),(cmp))-(v).begin()) #define dout() cout << fixed << setprecision(20) #define randinit() srand((unsigned)time(NULL)) template<class T, class U> bool chmin(T& t, const U& u) { if (t > u){ t = u; return 1;} return 0; } template<class T, class U> bool chmax(T& t, const U& u) { if (t < u){ t = u; return 1;} return 0; } ll Rnd(ll L=0, ll R=mod99){return rand()%(R-L)+L;} struct S{ ll a,b,id; bool operator<(const S&v) const{ if(a*v.b != b*v.a) return a*v.b > b*v.a; return id < v.id; } }; struct UnionFind { vector<long long> par; long long gn; UnionFind(long long N) : par(N, -1), gn(N){ } long long root(long long x) { if (par[x] < 0) return x; return par[x] = root(par[x]); } long long size(long long x) { return -par[root(x)]; } bool merge(long long x, long long y) { long long rx = root(x), ry = root(y); if (rx == ry) return 0; gn --; if (ry > rx) swap(rx, ry); par[ry] += par[rx]; par[rx] = ry; return 1; } bool same(long long x, long long y) { return root(x) == root(y); } }; void solve(){ ll n; string s; cin >> n >> s; V<ll> v(n+1, 0); rep(i,n) cin >> v[i+1]; n++; s = "(" + s + ")"; stack<ll> stk; string t = ""; ll cnt = 0; V<ll> p(n, 0); for(auto c:s){ if(c == '('){ if(cnt) p[cnt] = stk.top(); stk.push(cnt++); t += c; }else{ t.pop_back(); stk.pop(); } } V<ll> a(n, 0), b(n, 0); REP(i,1,n){ b[i] = 1; a[i] = v[i]; } set<S> st; REP(i, 1, n) st.insert(S{a[i], b[i], i}); UnionFind uf(n); ll ans = 0; while(!st.empty()){ auto s = *st.begin(); // cout << s.a << " " << s.b << " " << s.id << endl; st.erase(st.begin()); ll pid = uf.root(p[s.id]); uf.merge(pid, s.id); if(pid != 0) st.erase(S{a[pid], b[pid], pid}); ans += b[pid] * a[s.id]; b[pid] += b[s.id]; a[pid] += a[s.id]; if(pid != 0) st.insert(S{a[pid], b[pid], pid}); } rep(i,n) ans += v[i]; cout << ans << endl; } int main(){ cin.tie(nullptr); ios::sync_with_stdio(false); int t=1; // cin >> t; rep(i,t) solve(); }