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

• 問題: No.3503 Brackets Stack Query 2
• ユーザー: porkleoi
• 提出日時: 2026-04-18 08:06:28
• 言語: C++23 (gcc 15.2.0 + boost 1.89.0)
• 結果: AC
• 実行時間: 796 ms / 2,000 ms
• コード長: 4,712 bytes
• コンパイル時間: 3,012 ms
• コンパイル使用メモリ: 355,576 KB
• 実行使用メモリ: 33,472 KB
• 最終ジャッジ日時: 2026-04-18 08:07:03
• 合計ジャッジ時間: 30,372 ms
• ジャッジサーバーID （参考情報）: judge3_1 / judge1_0

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

ソースコード

#include <bits/stdc++.h>
using namespace std;
#define rep(i, a, b) for (int i = a; i < b; i++)
#define rrep(i, a, b) for (int i = a-1; i >= b; i--)
typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<vvi> vvvi;
typedef vector<vvvi> vvvvi;
typedef vector<string> vs;
typedef vector<vs> vvs;
typedef vector<vvs> vvvs;
typedef vector<char> vc;
typedef vector<vc> vvc;
typedef vector<vvc> vvvc;
typedef vector<ll> vll;
typedef vector<vll> vvll;
typedef vector<vvll> vvvll;
typedef vector<vvvll> vvvvll;
typedef vector<double> vd;
typedef vector<vd> vvd;
typedef vector<vvd> vvvd;
typedef vector<ld> vld;
typedef vector<vld> vvld;
typedef vector<vvld> vvvld;
typedef vector<bool> vb;
typedef vector<vd> vvb;
typedef vector<vvd> vvvb;
typedef vector<pair<int, int>> vpi;
typedef vector<pair<ll, ll>> vpll;
typedef pair<int, int> pi;
typedef vector<pi> vpi;
typedef vector<vpi> vvpi;
typedef pair<ll, ll> pll;
typedef vector<pll> vpll;
typedef vector<vpll> vvpll;
typedef tuple<int, int, int> tui3;
typedef tuple<ll, ll, ll> tull3;
typedef priority_queue<int, vector<int>, greater<int>> pqi;
typedef priority_queue<vi, vector<vi>, greater<vi>> pqvi;
typedef priority_queue<pi, vector<pi>, greater<pi>> pqpi;
typedef priority_queue<ll, vector<ll>, greater<ll>> pqll;
typedef priority_queue<vll, vector<vll>, greater<vll>> pqvll;
typedef priority_queue<pll, vector<pll>, greater<pll>> pqpll;
typedef priority_queue<pll, vector<pll>, less<pll>> rpqpll;
typedef priority_queue<int, vector<int>, less<int>> rpqi;
typedef priority_queue<vi, vector<vi>, less<vi>> rpqvi;
typedef priority_queue<tui3, vector<tui3>, greater<tui3>> pqtui3;
typedef priority_queue<tui3, vector<tui3>, less<tui3>> rpqtui3;
typedef priority_queue<tull3, vector<tull3>, greater<tull3>> pqtull3;
typedef priority_queue<tull3, vector<tull3>, less<tull3>> rpqtull3;
#define yes(ans) if(ans)cout << "yes"<< endl; else cout << "no" << endl
#define Yes(ans) if(ans)cout << "Yes"<< endl; else cout << "No" << endl
#define YES(ans) if(ans)cout << "YES"<< endl ;else cout << "NO" << endl
#define pos(ans) if(ans)cout << "Possible"<< endl ;else cout << "Impossible" << endl
#define printv(vec) {rep(i, 0, vec.size()) cout << vec[i] << ' '; cout << endl;}
#define printvv(vec) rep(i, 0, vec.size()) {rep(j, 0, vec[i].size()) cout << vec[i][j] << ' '; cout << endl;};
#define printvvv(vec) rep(i, 0, vec.size()) { rep(j, 0, vec[i].size()) { rep(k, 0, vec[i][j].size()) cout << vec[i][j][k] << ' '; cout << "	"; }cout << endl; };
#define all(x) x.begin(), x.end()
#define so(x) sort(all(x))
#define re(x) reverse(all(x))
#define rso(x) sort(x.rbegin(), x.rend())
#define vco(x, a) count(all(x), a)
#define per(x) next_permutation(all(x))
#define out(x) cout << x << endl
#define iINF 2147483647
#define llINF 9223372036854775807
#define INF 4000000000000000000
#define mod 998244353
#define mod2 1000000007
template<typename T> bool chmin(T& a, T b){if(a > b){a = b; return true;} return false;}
template<typename T> bool chmax(T& a, T b){if(a < b){a = b; return true;} return false;}

int main() {
    int q; cin >> q;
    string s;
    deque<char> st;
    deque<int> num;
    num.push_back(-1);
    int x = -1;
    map<int, vi> mp;
    set<int> st2;
    while(q--){
        int t; cin >> t;
        if(t==1){
            x++;
            char c; cin >> c;
            s += c;
            st.push_back(c);
            num.push_back(x);
            if(st.size()>=3 && st[st.size()-3]=='(' && st[st.size()-2]=='|' && st[st.size()-1]==')'){
                st.pop_back();
                st.pop_back();
                st.pop_back();
                mp[num[num.size()-1]].push_back(num[num.size()-2]);
                mp[num[num.size()-1]].push_back(num[num.size()-3]);
                num.pop_back();
                num.pop_back();
                num.pop_back();
            }
        }
        else{
            s.pop_back();
            if(num.size()>0 && num[num.size()-1]==x){
                st.pop_back();
                num.pop_back();
            }
            else{
                st2.insert(mp[x][0]);
                st2.insert(mp[x][1]);
                mp[x] = {};
            }
            x--;
        }
        int y = num[num.size()-1];
        auto it = st2.lower_bound(y);
        int z = 0;
        while(it!=st2.end()){
            num.push_back(*it);
            st.push_back(s[*it]);
            it++;
            z++;
        }
        while(z--){
            st2.erase(*st2.rbegin());
        }
        Yes(st.size()==0 && st2.size()==0);
        // cout << x << endl;
        // printv(s);
        // printv(st);
        // printv(num);
    }
}