#1156845 (C++23) No.3503 Brackets Stack Query 2

• 問題: No.3503 Brackets Stack Query 2
• ユーザー: irinoirino
• 提出日時: 2026-04-09 09:43:40
• 言語: C++23 (gcc 15.2.0 + boost 1.89.0)
• 結果: AC
• 実行時間: 1,254 ms / 2,000 ms
• コード長: 4,628 bytes
• コンパイル時間: 3,209 ms
• コンパイル使用メモリ: 226,832 KB
• 実行使用メモリ: 83,168 KB
• 最終ジャッジ日時: 2026-04-17 20:07:23
• 合計ジャッジ時間: 38,367 ms
• ジャッジサーバーID （参考情報）: judge1_1 / judge3_1

ファイルパターン	結果
sample	AC * 1
other	AC * 30

ソースコード

#include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <set>
#include <cmath>
#include <iomanip>
#include <stack>
#include <queue>
#include <deque>
#include <bitset>
#include <tuple>
#include <map>
#include <functional>
#include <fstream>
#include <climits>
#include <numeric>
#include <cassert>
//#include <atcoder/all>

#define fi first
#define se second
#define rep(i,n) for(ll i=0;i<(n);i++)
#define rrep(i,n) for(ll i=(n)-1;i>=0;i--)
#define orep(i,n) for(ll i=1;i<=(n);i++)

#define nfor(i,s,n) for(ll i=(s);i<(n);i++)
#define dfor(i,s,n) for(ll i=(s)-1;i>=n;i--)
#define INF 2e18//9223372036854775807

#define all(a)  a.begin(),a.end()
#define rall(a) a.rbegin(),a.rend()

#define chmax(x,y) x = max(x,y)
#define chmin(x,y) x = min(x,y)

#define pb push_back
#define pob pop_back

#define vc vector

#define YES cout << "Yes" << endl;
#define NO cout << "No" << endl;
#define YN {cout << "Yes" << endl;}else{cout << "No" << endl;}
#define dame cout << -1 << endl;

#define vc_unique(v) v.erase(unique(v.begin(), v.end()), v.end())
#define vc_remove(v,x) v.erase(remove(v.begin(), v.end(),x), v.end())
#define vc_rotate(v) rotate(v.begin(), v.begin()+1, v.end())

#define pop_cnt(s) ll(popcount(uint64_t(s)))
#define next_p(v) next_permutation(v.begin(),v.end())

#ifndef ONLINE_JUDGE
#define _GLIBCXX_DEBUG
#endif

using namespace std;
//using namespace atcoder;
using ll = long long;
using ld = long double;
using pll = pair<ll,ll>;
using vvvvvl = vector<vector<vector<vector<vector<ll> > > > >;
using vvvvl = vector<vector<vector<vector<ll> > > >;
using vvvl = vector<vector<vector<ll> > >;
using vvl = vector<vector<ll> >;
using vl = vector<ll>;
using vb = vector<bool>;
using vvb = vector<vector<bool> >;
using Graph = vector<vector<ll> >;

template<class T> using pq = priority_queue<T,vc<T>,less<T> >;
template<class T> using pq_g = priority_queue<T,vc<T>,greater<T> >;

ll dx[4] = {0,1,0,-1};ll ddx[8] = {1,1,0,-1,-1,-1,0,1};
ll dy[4] = {1,0,-1,0};ll ddy[8] = {0,1,1,1,0,-1,-1,-1};

bool out_grid(ll i, ll j, ll h, ll w){//trueならcontinueする
    return(!(0 <= i && i < h && 0 <= j && j<w));
}

ll MOD = 998244353;

ll modpow(ll x,ll y,ll m){
    ll a = x;
    a %= m;
    ll cnt = 0;
    ll ans = 1;
    while(y > 0){
        if((1ll << cnt) & y){
            y ^= (1ll << cnt);
            ans *= a;
            ans %= m;
        }
        a = a*a;
        a %= m;
        cnt++;
    }
    return ans;
}

ll npow(ll x,ll y){
    ll a = x;
    ll cnt = 0;
    ll ans = 1;
    while(y > 0){
        if((1ll << cnt) & y){
            y ^= (1ll << cnt);
            ans *= a;
        }
        a = a*a;
        cnt++;
    }
    return ans;
}

void print(ld x){printf("%.20Lf\n", x);}

////////////////////////////////////////////////////////////////
int main(){
    ll Q;
    cin >> Q;
    vc<pair<char,ll>> sta;
    vc<pair<char,ll>> arr;
    ll cnt = 0;

    vvl group(1e6,vl(3,-1));
    rep(i,Q){
        ll ty;
        cin >> ty;
        if(ty == 1){
            char c;
            cin >> c;
            sta.pb({c,arr.size()});
            if(c == '('){
                arr.pb({c,cnt});
                cnt++;
            }else if(c == '|'){
                arr.pb({c,-1});
            }else{
                arr.pb({c,-1});
            }
        }else{
            char x = arr[arr.size()-1].fi;
            ll g = arr[arr.size()-1].se;
            if(g == -1){
                arr.pob();
                sta.pob();
            }else{
                if(x == ')'){
                    sta.pb({'(',group[g][0]});
                    sta.pb({'|',group[g][1]});
                    group[g][2] = -1;
                    arr[group[g][1]].se = -1;
                    group[g][1] = -1;
                    arr.pob();
                }else if(x == '('){
                    group[g][0] = -1;
                    arr.pob();
                    sta.pob();
                    cnt--;
                }
            }
        }
        while(sta.size() > 2){
            if(sta[sta.size()-3].fi == '(' && sta[sta.size()-2].fi == '|' && sta[sta.size()-1].fi == ')'){
                ll g = arr[sta[sta.size()-3].se].se;
                group[g][0] = sta[sta.size()-3].se;
                group[g][1] = sta[sta.size()-2].se;
                group[g][2] = sta[sta.size()-1].se;
                sta.pob();
                sta.pob();
                sta.pob();
                arr[group[g][0]].se = g;
                arr[group[g][1]].se = g;
                arr[group[g][2]].se = g;
            }else{
                break;
            }
        }

        if(sta.size() == 0)YN;

    }
}