Submission #43162433

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;

typedef long long ll;

#define vvi vector<vector<ll>>
#define vi vector<ll>
#define umap unordered_map
#define pi pair<ll,ll>
#define vpi vector<pi>
#define ff first
#define ss second
#define yeah cout <<"Yes"<<'\n';
#define nope cout <<"No"<< '\n';
#define _print(a)  for(auto &x : a ) cout << x << " "; cout<<'\n';
#define inp(a)  for(auto &x : a) cin>>x;
#define nl cout<<'\n';
#define pb push_back
#define forn(i,n)  for(ll i=0;i < ll(n);i++)
#define all(x) (x).begin(), (x).end()
#define pq priority_queue

const int MOD = 1e9+7;
ll inf = 11e17;

ll bpm(ll  a, ll  b, ll  m) { a %= m; a+= (a<0)*m;
    ll res = 1;
    while (b > 0) {
        if (b & 1) res = (res * a)% m;
        a = (a * a) % m;
        b >>= 1;
    }
    return res;
}

ll inv(ll n) {return bpm(n, MOD-2, MOD);}

// ll phi(ll n){
//     ll result = n;
//     for(ll p = 2; p * p <= n; ++p){
//         if (n % p == 0){
//             while (n % p == 0)
//                 n /= p;
//                 result -= result / p;
//         }
//     }
//     if(n > 1) result -= result / n;   
//     return result;
// }

//vector<pi> dr ={{1,0},{0,1},{-1,0},{0,-1}};

template<class a, class b>
istream& operator>>(istream& is, pair<a, b> & v){
    is>>v.first>>v.second;
    return is;
}
template<class a, class b>
ostream& operator<<(ostream& os, pair<a, b> & v){
    os<<(v.first)<< ' ' <<(v.second)<<'\n';
    return os;
}

template<class T>
istream& operator>>(istream& is, vector<T> & v){
    for(auto &x: v) is>>x;
    return is;
}
template<class T>
ostream& operator<<(ostream& os, const vector<T> & v)
{
    for(auto x: v) os<<x<<' '; cout<<'\n';
    return os;
}
template<class T>
ostream& operator<<(ostream& os, const set<T> & v)
{
    for(auto x: v) os<<x<<' '; cout<<'\n';
    return os;
}
template<class T>
ostream& operator<<(ostream& os, const multiset<T> & v)
{
    for(auto x: v) os<<x<<' '; cout<<'\n';
    return os;
}


const int nax = 3e5+100;
// vi adj[nax];

// int inf = (1<<31);
const int SZ = 1<<30;
template<class T> struct node {
	T val = inf; node<T>* c[2];
    ll num = -1;
    int sz = 0;
	node() { c[0] = c[1] = NULL; }


    void recalc(int ind){
        if(sz>1){
            val = 0;
            num = -1;
        } 
        else {
            val = inf;
            if(sz) num = ind;
            else num = -1;
        }
        return;
    }
    void combine(){
        val = inf;
        if(sz==0){
            num = -1;
        }else if(sz == 1){
            for(int i=0; i<2; i++){
                if(c[i] && c[i]->num != -1){
                    num = c[i] -> num;
                }
            }
        }else{
            for(int i=0; i<2; i++)
                if(c[i]) val = min(val, c[i]->val);
            if(val==inf){
                val = c[0]->num ^ c[1]->num;
            }
        }
    }


	void add(int ind, int L = 0, int R = SZ-1) { // add v
        sz++;
		if (L == ind && R == ind){
            recalc(ind);
            return;
        } 
		int M = (L+R)/2;
		if (ind <= M) {
			if (!c[0]) c[0] = new node();
			c[0]->add(ind,L,M);
		} else {
			if (!c[1]) c[1] = new node();
			c[1]->add(ind,M+1,R);
		}
        combine();

	}
    void rem(int ind, int L = 0, int R = SZ-1) { 
        sz--;
		if (L == ind && R == ind){
            recalc(ind);
            return;
        }
		int M = (L+R)/2;
		if (ind <= M) {
			if (!c[0]) c[0] = new node();
			c[0]->rem(ind,L,M);
		} else {
			if (!c[1]) c[1] = new node();
			c[1]->rem(ind,M+1,R);
		}

        combine();
    }

};


ll n,m,k;


ll i, j;

void solve(int tc = 0){
    //cout<<'#'<<tc<<'\n';
    int q;
    cin>>q;
    node<ll> n;
    while(q--){
        int t; cin>>t;
        if(t==1){
            int x; cin>>x;
            n.add(x);
        }else if(t==2){
            int x; cin>>x;
            n.rem(x);
        }else{
            cout<<n.val<<'\n';
        }
    }
}


int main()
{
    ios_base::sync_with_stdio(false);  
    cin.tie(NULL);
    cout<<setprecision(15)<<fixed;

    // ncr();

    srand(chrono::steady_clock::now().time_since_epoch().count());

    ll tt=1;
    // cin>>tt;
    for(ll t =1 ; t <= tt ; t++) {
        solve(t);
    }
    cerr<<"Time:"<<1000*((double)clock())/(double)CLOCKS_PER_SEC<<"ms\n";

    return 0;

}

Submission Info

Compile Error

./Main.cpp: In function ‘std::ostream& operator<<(std::ostream&, const std::vector<_Tp>&)’:
./Main.cpp:72:5: warning: this ‘for’ clause does not guard... [-Wmisleading-indentation]
   72 |     for(auto x: v) os<<x<<' '; cout<<'\n';
      |     ^~~
./Main.cpp:72:32: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the ‘for’
   72 |     for(auto x: v) os<<x<<' '; cout<<'\n';
      |                                ^~~~
./Main.cpp: In function ‘std::ostream& operator<<(std::ostream&, const std::set<T>&)’:
./Main.cpp:78:5: warning: this ‘for’ clause does not guard... [-Wmisleading-indentation]
   78 |     for(auto x: v) os<<x<<' '; cout<<'\n';
      |     ^~~
./Main.cpp:78:32: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the ‘for’
   78 |     for(auto x: v) os<<x<<' '; cout<<'\n';
      |                                ^~~~
./Main.cpp: In function ‘std::ostream& operator<<(std::ostream&, const std::multiset<T>&)’:
./Main.cpp:84:5: warning: this ‘for’ clause does not guard... [-Wmisleading-indentation]
   84 |     for(auto x: v) os<<x<<' '; cout<<'\n';
      |     ^~~
./Main.cpp:84:32: note: ...this statement, but the latter is misleadingly indented as if it were guarded by the ‘for’
   84 |     for(auto x: v) os<<x<<' '; cout<<'\n';
      |                                ^~~~
./Main.cpp: In function ‘void solve(int)’:
./Main.cpp:176:16: warning: unused parameter ‘tc’ [-Wunused-parameter]
  176 | void solve(int tc = 0){
      |            ~~~~^~~~~~

Judge Result