#pragma GCC optimize ("O3") #pragma GCC target ("avx") #include "bits/stdc++.h" // define macro "/D__MAI" using namespace std; typedef long long int ll; #define xprintf(fmt,...) fprintf(stderr,fmt,__VA_ARGS__) #define debugv(v) {printf("L%d %s > ",__LINE__,#v);for(auto e:v){cout< ",__LINE__,#m);for(int x=0;x<(w);x++){cout<<(m)[x]<<" ";}cout<\n",__LINE__,#m);for(int y=0;y<(h);y++){for(int x=0;x<(w);x++){cout<<(m)[y][x]<<" ";}cout< ostream& operator <<(ostream &o, const pair p) { o << "(" << p.first << ":" << p.second << ")"; return o; } template T& maxset(T& to, const T& val) { return to = max(to, val); } template T& minset(T& to, const T& val) { return to = min(to, val); } void bye(string s, int code = 0) { cout << s << endl; exit(0); } mt19937_64 randdev(8901016); inline ll rand_range(ll l, ll h) { return uniform_int_distribution(l, h)(randdev); } #if defined(_WIN32) || defined(_WIN64) #define getchar_unlocked _getchar_nolock #define putchar_unlocked _putchar_nolock #elif __GNUC__ #else #define getchar_unlocked getchar #define putchar_unlocked putchar #endif namespace { #define isvisiblechar(c) (0x21<=(c)&&(c)<=0x7E) class MaiScanner { public: template void input_integer(T& var) { var = 0; T sign = 1; int cc = getchar_unlocked(); for (; cc<'0' || '9'>(int& var) { input_integer(var); return *this; } inline MaiScanner& operator>>(long long& var) { input_integer(var); return *this; } inline MaiScanner& operator>>(string& var) { int cc = getchar_unlocked(); for (; !isvisiblechar(cc); cc = getchar_unlocked()); for (; isvisiblechar(cc); cc = getchar_unlocked()) var.push_back(cc); } template void in(IT begin, IT end) { for (auto it = begin; it != end; ++it) *this >> *it; } }; class MaiPrinter { public: template void output_integer(T var) { if (var == 0) { putchar_unlocked('0'); return; } if (var < 0) putchar_unlocked('-'), var = -var; char stack[32]; int stack_p = 0; while (var) stack[stack_p++] = '0' + (var % 10), var /= 10; while (stack_p) putchar_unlocked(stack[--stack_p]); } inline MaiPrinter& operator<<(char c) { putchar_unlocked(c); return *this; } inline MaiPrinter& operator<<(int var) { output_integer(var); return *this; } inline MaiPrinter& operator<<(long long var) { output_integer(var); return *this; } inline MaiPrinter& operator<<(char* str_p) { while (*str_p) putchar_unlocked(*(str_p++)); return *this; } inline MaiPrinter& operator<<(const string& str) { const char* p = str.c_str(); const char* l = p + str.size(); while (p < l) putchar_unlocked(*p++); return *this; } template void join(IT begin, IT end, char sep = '\n') { for (auto it = begin; it != end; ++it) *this << *it << sep; } }; } MaiScanner scanner; MaiPrinter printer; template class Bitree { public: int size_; vector data_; Bitree(int size_) :size_(size_ + 1), data_(size_ + 1) {} // 1..rの範囲の値の和を求める. T sum(int r) { T s = 0; while (0 < r) { s += data_[r]; r -= r&-r; // r&-r と書くことで最下のビットを得る } return s; } // idxの要素の値をval増やす void add(int idx, T val) { while (idx <= size_) { data_[idx] += val; idx += idx&-idx; } } }; typedef ll bsearch_t; bsearch_t bin_search(bsearch_t low, bsearch_t high, function func) { ++high; // --l; bsearch_t c; while (low + 1 < high) { c = (low + high) / 2; (func(c) ? high : low) = c; } return high; // return l; } ll m, n, kei, n_q; vector> queries; vector join; int main() { scanner >> n_q; queries.reserve(n_q); map kenq_zip; vector kenq_cv; vector history_in; history_in.reserve(n_q); ll offset = 0; repeat(i, n_q) { int t; ll x; scanner >> t >> x; queries.emplace_back(t, x); switch (t) { case 1: kenq_zip[x - offset] = i; history_in.push_back(x - offset); queries.back().second = x - offset; break; case 2: queries.back().second = history_in[x - 1];// +offset; break; case 3: offset += x; break; } } kenq_cv.resize(kenq_zip.size() + 1); { int i = 1; for (auto& p : kenq_zip) { kenq_cv[i] = p.first; p.second = i++; } } Bitree bit(100010); //debugv(kenq_cv); ll o = 0; repeat(i, n_q) { int t; ll x; tie(t, x) = queries[i]; //cout << queries[i] << endl; switch (t) { case 1: bit.add(kenq_zip[x], 1); //cout << "in: " << kenq_zip[x] << endl; break; case 2: bit.add(kenq_zip[x], -1); //cout << "out: " << kenq_zip[x] << endl; break; case 3: o += x; break; } //for (auto e: kenq_cv) cout << e+o << ' ';cout<