oj.uz

답안 #498990

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
498990 2021-12-27T00:15:35 Z inksamurai Klasika (COCI20_klasika) C++17
33 / 110
 5000 ms 468792 KB 
#include <bits/stdc++.h>
#define fi first
#define se second
#define pb push_back
#define sz(a) (int)a.size()
#define all(a) a.begin(),a.end()
#define rep(i,n) for(int i=0;i<n;i++)
#define crep(i,x,n) for(int i=x;i<n;i++)
#define drep(i,n) for(int i=n-1;i>=0;i--)
#define vec(...) vector<__VA_ARGS__>
#define _3qplfh5 ios_base::sync_with_stdio(false),cin.tie(0),cout.tie(0)
using namespace std;
typedef long long ll;
typedef long double ld;
using tupiii=tuple<int,int,int>;
using pii=pair<int,int>;
using vi=vector<int>;
using vll=vector<long long>;
 
int main(){
_3qplfh5;
	int q;
	cin>>q;
	vec(tupiii) qry;
	int n=1;
	rep(_,q){
		string s;
		cin>>s;
		int t=0;
		if(s=="Add"){
			t=1;
			n++;
		}
		int _a,_b;
		cin>>_a>>_b;
		qry.pb({t,_a,_b});
	}
	vec(vec(pii)) adj(n);
	int now=1;
	for(auto [t,_a,_b] : qry){
		if(t==1){
			adj[_a-1].pb({now,_b});
			adj[now].pb({_a-1,_b});
			now++;
		}
	}
	//rabbit tour
	vi tour;
	vi tin(n,0),tout(n,0);
	vi psum(n,0);
	int tm=0;
	auto dfs=[&](auto self,int v,int par)->void{
		tin[v]=tm++;
		tour.pb(v);
		for(auto edge : adj[v]){
			int u=edge.fi;
			if(u!=par){
				psum[u]=psum[v]^edge.se;
				// cout<<edge.se<<"\n";
				self(self,u,v);
			}
		}
		tout[v]=tm++;
		tour.pb(v);
	};
	dfs(dfs,0,-1);
	vec(std::map<ll,set<int>>) rbts(32);
	rep(j,31){
		rbts[j][0].insert(tin[0]);
	}
	now=1;
	for(auto [t,_a,_b] : qry){
		if(t==0){
			_a--,_b--;
			int k=psum[_a];
			int need=0;
			int ans=0;
			drep(j,31){
				if(!(k&(1<<j))){
					need|=(1<<j);
				}
				bool pokita=0;
				if(rbts[j].find(need)!=rbts[j].end()){
					auto it=rbts[j][need].lower_bound(tin[_b]);
					if(it!=rbts[j][need].end() and *it<tout[_b]){
						pokita=1;
					}
				}
				if(not pokita){
					if(!(k&(1<<j))) need^=(1<<j);
					else need|=(1<<j);
				}
			}
			ans=need^k;
			cout<<ans<<"\n";
		}else{
			int v=now;
			int wata=0;
			drep(j,31){
				if(psum[v]&(1<<j)) wata|=(1<<j);
				rbts[j][wata].insert(tin[v]);
			}
			now++;
		}
	}
//	
	return 0;
}

Subtask #1
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 460 KB Output is correct
2 Correct 1 ms 500 KB Output is correct
3 Correct 1 ms 696 KB Output is correct
4 Correct 2 ms 848 KB Output is correct
5 Correct 1 ms 464 KB Output is correct
6 Correct 1 ms 572 KB Output is correct
7 Correct 1 ms 700 KB Output is correct
8 Correct 2 ms 828 KB Output is correct
9 Correct 1 ms 452 KB Output is correct
10 Correct 1 ms 568 KB Output is correct
11 Correct 1 ms 720 KB Output is correct
12 Correct 1 ms 848 KB Output is correct

Subtask #2
22.0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 460 KB Output is correct
2 Correct 1 ms 500 KB Output is correct
3 Correct 1 ms 696 KB Output is correct
4 Correct 2 ms 848 KB Output is correct
5 Correct 1 ms 464 KB Output is correct
6 Correct 1 ms 572 KB Output is correct
7 Correct 1 ms 700 KB Output is correct
8 Correct 2 ms 828 KB Output is correct
9 Correct 1 ms 452 KB Output is correct
10 Correct 1 ms 568 KB Output is correct
11 Correct 1 ms 720 KB Output is correct
12 Correct 1 ms 848 KB Output is correct
13 Correct 7 ms 1872 KB Output is correct
14 Correct 9 ms 3312 KB Output is correct
15 Correct 13 ms 4760 KB Output is correct
16 Correct 13 ms 5980 KB Output is correct
17 Correct 7 ms 1740 KB Output is correct
18 Correct 9 ms 3188 KB Output is correct
19 Correct 12 ms 4588 KB Output is correct
20 Correct 14 ms 5864 KB Output is correct
21 Correct 7 ms 1724 KB Output is correct
22 Correct 10 ms 3228 KB Output is correct
23 Correct 12 ms 4648 KB Output is correct
24 Correct 13 ms 5836 KB Output is correct

Subtask #3
0 / 33.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2150 ms 126976 KB Output is correct
2 Correct 3240 ms 246028 KB Output is correct
3 Correct 4260 ms 357008 KB Output is correct
4 Execution timed out 5115 ms 468792 KB Time limit exceeded
5 Halted 0 ms 0 KB -

Subtask #4
0 / 44.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 460 KB Output is correct
2 Correct 1 ms 500 KB Output is correct
3 Correct 1 ms 696 KB Output is correct
4 Correct 2 ms 848 KB Output is correct
5 Correct 1 ms 464 KB Output is correct
6 Correct 1 ms 572 KB Output is correct
7 Correct 1 ms 700 KB Output is correct
8 Correct 2 ms 828 KB Output is correct
9 Correct 1 ms 452 KB Output is correct
10 Correct 1 ms 568 KB Output is correct
11 Correct 1 ms 720 KB Output is correct
12 Correct 1 ms 848 KB Output is correct
13 Correct 7 ms 1872 KB Output is correct
14 Correct 9 ms 3312 KB Output is correct
15 Correct 13 ms 4760 KB Output is correct
16 Correct 13 ms 5980 KB Output is correct
17 Correct 7 ms 1740 KB Output is correct
18 Correct 9 ms 3188 KB Output is correct
19 Correct 12 ms 4588 KB Output is correct
20 Correct 14 ms 5864 KB Output is correct
21 Correct 7 ms 1724 KB Output is correct
22 Correct 10 ms 3228 KB Output is correct
23 Correct 12 ms 4648 KB Output is correct
24 Correct 13 ms 5836 KB Output is correct
25 Correct 2150 ms 126976 KB Output is correct
26 Correct 3240 ms 246028 KB Output is correct
27 Correct 4260 ms 357008 KB Output is correct
28 Execution timed out 5115 ms 468792 KB Time limit exceeded
29 Halted 0 ms 0 KB -