結果

問題 No.3058 Deque and Brackets
ユーザー n_vip
提出日時 2025-03-14 22:58:08
言語 C++17
(gcc 13.3.0 + boost 1.87.0)
結果
AC  
実行時間 439 ms / 2,000 ms
コード長 9,464 bytes
コンパイル時間 2,201 ms
コンパイル使用メモリ 151,904 KB
実行使用メモリ 27,084 KB
最終ジャッジ日時 2025-03-14 22:58:18
合計ジャッジ時間 9,247 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge5
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 2
other AC * 22
権限があれば一括ダウンロードができます

ソースコード

diff #
プレゼンテーションモードにする

#include <string>
#include <vector>
#include<iostream>
#include<cstdio>
#include<cstdlib>
#include<stack>
#include<queue>
#include<cmath>
#include<algorithm>
#include<functional>
#include<list>
#include<deque>
#include<bitset>
#include<set>
#include<map>
#include<unordered_map>
#include<unordered_set>
#include<cstring>
#include<sstream>
#include<complex>
#include<iomanip>
#include<numeric>
#include<cassert>
#include<random>
#define X first
#define Y second
#define pb push_back
#define rep(X,Y) for (int X = 0;X < (int)(Y);++X)
#define reps(X,S,Y) for (int X = (int)(S);X < (int)(Y);++X)
#define rrep(X,Y) for (int X = (int)(Y)-1;X >=0;--X)
#define rreps(X,S,Y) for (int X = (int)(Y)-1;X >= (int)(S);--X)
#define repe(X,Y) for (X = 0;X < (Y);++X)
#define peat(X,Y) for (;X < (Y);++X)
#define all(X) X.begin(),X.end()
#define rall(X) X.rbegin(),X.rend()
#define eb emplace_back
#define UNIQUE(X) X.erase(unique(all(X)),X.end())
#define Endl endl
#define NL <<"\n"
#define cauto const auto
using namespace std;
using ll=long long;
using pii=pair<int,int>;
using pll=pair<ll,ll>;
template<class T> using vv=vector<vector<T>>;
template<class T> inline bool MX(T &l,const T &r){return l<r?l=r,1:0;}
template<class T> inline bool MN(T &l,const T &r){return l>r?l=r,1:0;}
//#undef NUIP
#ifdef NUIP
#include "benri.h"
#else
#define out(args...)
#endif
void ouT(ll x,int d=3){auto re=to_string(x);if((int)re.size()>d) re=x>0?"oo":"-oo";cout<<string(d-re.size(),' ')<<re<<",";}
#ifdef __cpp_init_captures
template<typename T>vector<T> table(int n, T v){ return vector<T>(n, v);}
template <class... Args> auto table(int n, Args... args){auto val = table(args...); return vector<decltype(val)>(n, move(val));}
#endif
#ifdef __cpp_init_captures
template<class Tuple, size_t... Is> void read_tuple_impl(istream &is, Tuple& t, index_sequence<Is...>){((is >> get<Is>(t)), ...);}
template<class... Args> auto& operator>>(istream &is, tuple<Args...>& t){ read_tuple_impl(is, t, index_sequence_for<Args...>{}); return is;}
template<typename T, size_t... Is> void addadd(T& t1, const T& t2, integer_sequence<size_t, Is...>){ cauto l = { (get<Is>(t1) += get<Is>(t2), 0)... }
    ; (void)l;}
template <typename...T>tuple<T...>& operator += (tuple<T...>& lhs, const tuple<T...>& rhs){ addadd(lhs, rhs, index_sequence_for<T...>{});   return 
    lhs;}
template <typename...T>tuple<T...> operator +(tuple<T...> lhs, const tuple<T...>& rhs){ return lhs += rhs;}
template<typename T, size_t... Is> void subsub(T& t1, const T& t2, integer_sequence<size_t, Is...>){ cauto l = { (get<Is>(t1) -= get<Is>(t2), 0)... }
    ; (void)l;}
template <typename...T>tuple<T...>& operator -= (tuple<T...>& lhs, const tuple<T...>& rhs){ subsub(lhs, rhs, index_sequence_for<T...>{});   return 
    lhs;}
template <typename...T>tuple<T...> operator - (tuple<T...> lhs, const tuple<T...>& rhs){ return lhs -= rhs;}
#endif
template<class T=ll> T read(){ T re; cin>>re; return re;}
template<class T=ll> T read(const T &dec){ T re; cin>>re; return re-dec;}
template<class T=ll> vector<T> readV(const int sz){ vector<T> re(sz); for(auto &x:re) x=read<T>(); return re;}
template<class T=ll> vector<T> readV(const int sz, const T &dec){ vector<T> re(sz); for(auto &x:re) x=read<T>(dec); return re;}
vv<int> readG(const int &n,const int &m){ vv<int> g(n); rep(_,m){ cauto a=read<int>(1),b=read<int>(1); g[a].pb(b); g[b].pb(a);} return g;}
vv<int> readG(const int &n){ return readG(n,n-1);}
vv<int> readD(const int &n,const int &m){ vv<int> g(n); rep(_,m){ cauto a=read<int>(1),b=read<int>(1); g[a].pb(b); } return g;}
vv<int> readD(const int &n){ return readD(n,n-1);}
template<class T> vv<pair<int,T>> readG(const int &n,const int &m){ vv<pair<int,T>> g(n); rep(_,m){ cauto a=read<int>(1),b=read<int>(1); cauto c=read
    <T>(); g[a].eb(b,c); g[b].eb(a,c);} return g;}
template<class T> vv<pair<int,T>> readG(const int &n){ return readG<T>(n,n-1);}
template<class T> vv<pair<int,T>> readD(const int &n,const int &m){ vv<pair<int,T>> g(n); rep(_,m){ cauto a=read<int>(1),b=read<int>(1); cauto c=read
    <T>(); g[a].eb(b,c); } return g;}
template<class T> vv<pair<int,T>> readD(const int &n){ return readD<T>(n,n-1);}
#ifdef __cpp_deduction_guides
template<typename T> vector<T> readT(int n, T v){ return readV(n,v);}
template <class... Args> auto readT(int n, Args... args){ vector re(1,readT(args...));rep(_,n-1) re.eb(readT(args...)); return re;}
#endif
template<class T> bool erase(multiset<T> &st, const T &v){if(cauto it=st.find(v); it==st.end()) return false; else{ st.erase(it); return true;}}
#ifdef NUIP
#define TT cauto TTT=read();rep(kase,TTT)if(cerr<<"Case #"<<kase<<endl)
#else
#define TT cauto TTT=read();rep(kase,TTT)
#endif
struct sorted_impl{template<class T>friend vector<T>operator-(vector<T>a,sorted_impl){sort(all(a));return a;}friend string operator-(string a
    ,sorted_impl){sort(all(a));return a;}}sorted;struct reversed_impl{template<class T>friend vector<T>operator-(vector<T> a,reversed_impl){reverse
    (all(a));return a;}friend string operator-(string a,reversed_impl){reverse(all(a));return a;}}reversed;struct distinct_impl{template<class T
    >friend vector<T>operator-(vector<T> a,distinct_impl){sort(all(a));UNIQUE(a);return a;}}distinct;template<class S>struct sortedWith{const S f
    ;sortedWith(const S &f):f(f){}template<class T>friend vector<T>operator-(vector<T> a,const sortedWith&b){sort(all(a),[&](cauto&i,cauto&j){return 
    b.f(i)<b.f(j);});return a;}};
template<class T>int operator/(const T&v,const vector<T>&vs){return lower_bound(all(vs),v)-vs.begin();}
vector<int> Inds(const int n){vector<int> inds(n);iota(all(inds),0);return inds;}
const ll MOD=1e9+7; //998244353;
template<class T>
struct MinMax{
    T mn,mx;
    MinMax(T mn,T mx):mn(mn),mx(mx){}
    MinMax(T v):mn(v),mx(v){}
    MinMax():mn(MOD),mx(0){}
    MinMax operator+(const MinMax &seg){
        return MinMax(min(mn,seg.mn),max(mx,seg.mx));
    }
  static MinMax e;
};
template<class T> MinMax<T> MinMax<T>::e=MinMax();
template<class T>ostream&  operator<<(ostream &os, const MinMax<T> &seg){ return os<<"("<<seg.mn<<","<<seg.mx<<")";}
template<class T>
struct Add{
    T ad;
  Add(T ad={}):ad(ad){}
    void operator+=(const Add &lfun){
        ad+=lfun.ad;
    }
    bool operator==(const Add &lfun){ return ad==lfun.ad;}
    void eval(MinMax<T> &s,int l,int r){
        s.mn+=ad;
        s.mx+=ad;
    }
    static Add e;
};
template<class T> Add<T> Add<T>::e=Add();
template<class T>ostream&  operator<<(ostream &os, const Add<T> &lfun){ return os<<"("<<lfun.ad<<")";}
template<class Seg, class Ope>
struct LazySegTree{
    vector<Seg> segs;
    vector<Ope> opes;
    
    void lazy_eval(int k,int a,int b){
        if(opes[k]==Ope::e) return;
        opes[k].eval(segs[k],a,b);
        if(2*k+2<(int)opes.size()){
            opes[2*k+1]+=opes[k];
            opes[2*k+2]+=opes[k];
        }
        opes[k]=Ope::e;
    }
    void upd_node(int k){segs[k]=segs[2*k+1]+segs[2*k+2];}
    void upd(int l,int r,Ope ope,int k,int a,int b){
        lazy_eval(k,a,b);
        if(b<=l || r<=a) return; 
        if(l<=a && b<=r){
            opes[k]+=ope;
            lazy_eval(k,a,b);
            return;
        }   
        int m=(a+b)/2;
        upd(l,r,ope,2*k+1,a,m);
        upd(l,r,ope,2*k+2,m,b);
        upd_node(k);
    }
    void upd(int l,int r, const Ope &ope){ upd(l,r,ope,0,0,segs.size()/2);}
    Seg query(int l,int r,int k,int a,int b){
        lazy_eval(k,a,b);
        if(b<=l || r<=a)return Seg::e; 
        if(l<=a && b<=r){return segs[k];}
  
        int m=(a+b)/2;
        Seg vl=query(l,r,2*k+1,a,m);
        Seg vr=query(l,r,2*k+2,m,b);
        upd_node(k);
        return vl+vr;
    }
    LazySegTree(int n){
        int pw=1;
        while(pw<n) pw*=2;
        segs.resize(2*pw);
        opes.resize(2*pw);
    }
    template<class Int>
    LazySegTree(vector<Int> vs){
        int n=vs.size();
        int pw=1;
        while(pw<n) pw*=2;
        segs.resize(2*pw);
        opes.resize(2*pw);
        rep(i,n) segs[pw-1+i]=vs[i];
        rrep(i,pw-1) segs[i]=segs[i*2+1]+segs[i*2+2];
    }
    template<class Int>
    LazySegTree(vector<Int> vs, const int i0){
        int n=vs.size();
        int pw=1;
        while(pw<n) pw*=2;
        segs.resize(2*pw);
        opes.resize(2*pw);
        rep(i,n) segs[pw-1+i]={vs[i],i0+i};
        rrep(i,pw-1) segs[i]=segs[i*2+1]+segs[i*2+2];
    }
    void operator()(int l,int r, const Ope &ope){ upd(l,r,ope,0,0,segs.size()/2);};
    void first(int r, const Ope &ope){ return operator()(0,r,ope); }
    void take(int r, const Ope &ope){ return operator()(0,r,ope); }
    void drop(int l, const Ope &ope){ return operator()(l,segs.size()/2,ope); }
    void last(int k, const Ope &ope){ return operator()((int)segs.size()/2-k,segs.size()/2,ope); }
    // void rb(int r,Ope ope){ operator()(0,r,ope); }
    // void lb(int l,Ope ope){ operator()(l,segs.size()/2,ope); }
    Seg operator()(int l,int r){ return query(l,r,0,0,segs.size()/2);};
    Seg first(int r){ return operator()(0,r); }
    Seg take(int r){ return operator()(0,r); }
    Seg drop(int l){ return operator()(l,segs.size()/2); }
    Seg last(int k){ return operator()((int)segs.size()/2-k,segs.size()/2); }
    Seg operator()(){ return segs[0];}
};
int main(){
    ios_base::sync_with_stdio(false); cin.tie(0);
    cout<<fixed<<setprecision(0);
    cauto n=read(0)*2;
    cauto tps=readV<tuple<char,ll,ll>>(n)-reversed;
    ll re=0;
    vector<pair<ll,int>> ps;
    LazySegTree<MinMax<int>,Add<int>> st0(vector(n,0));
    LazySegTree<MinMax<int>,Add<int>> st1(vector(n,0));
    rep(i,n){
        cauto [c,l,r]=tps[i];
        if(c=='('){
            re+=l;
            st0.drop(i,1);
            if(r>l) ps.eb(r-l,i);
        }else{
            re+=r;
            st1.drop(i,1);
            if(l>r) ps.eb(l-r,i);
        }
    }
    rep(i,n) out(i,st0(i,i+1),st1(i,i+1),1);
    sort(rall(ps));
    out(tps,re,ps,1);
    for(cauto [s,i]:ps){
        if(st0.drop(i).mn>0 && st1.drop(i).mn>0){
            re+=s;
            st0.drop(i,-1);
            st1.drop(i,-1);
        }
    }
    cout<<re NL;        
    return 0;
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0