oj.uz

답안 #1017943

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1017943 2024-07-09T11:41:08 Z vjudge1 Klasika (COCI20_klasika) C++17
66 / 110
 4218 ms 490200 KB 
#include <bits/stdc++.h>

using namespace std;

#define int long long
#define all(v) v.begin(), v.end()

const int M = 2e5 + 2, thres = 2500;

vector<int> nei[M],ver[M*30];
int nxt[M*30][2],val[M],st[M],en[M],sz,t,parr[M];
stack<int> stk;

void dfs(int u)
{
	st[u]=t++;
	for (int i:nei[u])
		dfs(i);
	en[u]=t;
	stk.push(u);
}

void add(int vl,int tm)
{
	int cur=0;
	for (int i=30;i>=0;i--)
	{
		int x=0;
		if ((1<<i)&vl)
			x=1;
		if (!nxt[cur][x])
			nxt[cur][x]=++sz;
		cur=nxt[cur][x];
		ver[cur].push_back(tm);
	}
}

int get(int vl,int s,int e)
{
	int cur=0,ans=0;
	for (int i=30;i>=0;i--)
	{
		int x=1;
		if ((1<<i)&vl)
			x=0;
		if (!nxt[cur][x])
			x=1-x;
		else if(lower_bound(all(ver[nxt[cur][x]]),s)==lower_bound(all(ver[nxt[cur][x]]),e))
			x=1-x;
		else
			ans+=(1<<i);
		cur=nxt[cur][x];
	}
	return ans;
}

void dfs1(int u,int vl,int &ans)
{
	ans=max(ans,val[u]^vl);
	for (int i:nei[u])
		dfs1(i,vl,ans);
}

signed main()
{
	ios::sync_with_stdio(0);
	cin.tie(NULL), cout.tie(NULL);
	int q;
	cin>>q;
	int nodes=2;
	vector<int> pen;
	while (q--)
	{
		string s;
		cin>>s;
		if (s=="Add")
		{
			int x,y;
			cin>>x>>y;
			val[nodes]=val[x]^y;
			pen.push_back(nodes);
			if (x<pen[0])
				parr[nodes]=x;
			else
				parr[nodes]=parr[x];
			nei[x].push_back(nodes++);
		}
		else
		{
			int a,b;
			cin>>a>>b;
			int ans=0;
			if (!pen.empty() && pen[0]<=b)
				dfs1(b,val[a],ans);
			else
			{
				if (nodes>thres)
					ans=get(val[a],st[b],en[b]);
				else
					ans=val[a];
				for (int i:pen)
				{
					if (parr[i]==b || (nodes>thres && st[parr[i]]>=st[b] && st[parr[i]]<en[b]))
						ans=max(ans,val[i]^val[a]);
				}
			}
			cout<<ans<<'\n';
		}
		if (pen.size()==thres)
		{
			for (int i=0;i<sz;i++)
				nxt[i][0]=nxt[i][1]=0,ver[i].clear();
			t=0;
			pen.clear();
			dfs(1);
			sz=0;
			while (!stk.empty())
				add(val[stk.top()],st[stk.top()]),stk.pop();
		}
	}
	
	return 0;
}

Subtask #1
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 55 ms 147432 KB Output is correct
2 Correct 51 ms 147536 KB Output is correct
3 Correct 51 ms 147536 KB Output is correct
4 Correct 51 ms 147540 KB Output is correct
5 Correct 55 ms 147536 KB Output is correct
6 Correct 71 ms 147468 KB Output is correct
7 Correct 57 ms 147536 KB Output is correct
8 Correct 56 ms 147540 KB Output is correct
9 Correct 60 ms 147532 KB Output is correct
10 Correct 53 ms 147548 KB Output is correct
11 Correct 58 ms 147540 KB Output is correct
12 Correct 77 ms 147536 KB Output is correct

Subtask #2
22.0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 55 ms 147432 KB Output is correct
2 Correct 51 ms 147536 KB Output is correct
3 Correct 51 ms 147536 KB Output is correct
4 Correct 51 ms 147540 KB Output is correct
5 Correct 55 ms 147536 KB Output is correct
6 Correct 71 ms 147468 KB Output is correct
7 Correct 57 ms 147536 KB Output is correct
8 Correct 56 ms 147540 KB Output is correct
9 Correct 60 ms 147532 KB Output is correct
10 Correct 53 ms 147548 KB Output is correct
11 Correct 58 ms 147540 KB Output is correct
12 Correct 77 ms 147536 KB Output is correct
13 Correct 53 ms 147536 KB Output is correct
14 Correct 56 ms 147536 KB Output is correct
15 Correct 56 ms 147700 KB Output is correct
16 Correct 61 ms 147540 KB Output is correct
17 Correct 57 ms 147536 KB Output is correct
18 Correct 55 ms 147516 KB Output is correct
19 Correct 58 ms 147524 KB Output is correct
20 Correct 60 ms 147540 KB Output is correct
21 Correct 55 ms 147536 KB Output is correct
22 Correct 51 ms 147544 KB Output is correct
23 Correct 54 ms 147536 KB Output is correct
24 Correct 60 ms 147536 KB Output is correct

Subtask #3
33.0 / 33.0

# 결과 실행 시간 메모리 Grader output
1 Correct 580 ms 189912 KB Output is correct
2 Correct 1043 ms 227276 KB Output is correct
3 Correct 1733 ms 260092 KB Output is correct
4 Correct 2716 ms 299080 KB Output is correct
5 Correct 729 ms 203824 KB Output is correct
6 Correct 1472 ms 288860 KB Output is correct
7 Correct 2488 ms 369116 KB Output is correct
8 Correct 4218 ms 490200 KB Output is correct
9 Correct 655 ms 188512 KB Output is correct
10 Correct 1140 ms 226288 KB Output is correct
11 Correct 1900 ms 258144 KB Output is correct
12 Correct 3056 ms 295776 KB Output is correct

Subtask #4
0 / 44.0

# 결과 실행 시간 메모리 Grader output
1 Correct 55 ms 147432 KB Output is correct
2 Correct 51 ms 147536 KB Output is correct
3 Correct 51 ms 147536 KB Output is correct
4 Correct 51 ms 147540 KB Output is correct
5 Correct 55 ms 147536 KB Output is correct
6 Correct 71 ms 147468 KB Output is correct
7 Correct 57 ms 147536 KB Output is correct
8 Correct 56 ms 147540 KB Output is correct
9 Correct 60 ms 147532 KB Output is correct
10 Correct 53 ms 147548 KB Output is correct
11 Correct 58 ms 147540 KB Output is correct
12 Correct 77 ms 147536 KB Output is correct
13 Correct 53 ms 147536 KB Output is correct
14 Correct 56 ms 147536 KB Output is correct
15 Correct 56 ms 147700 KB Output is correct
16 Correct 61 ms 147540 KB Output is correct
17 Correct 57 ms 147536 KB Output is correct
18 Correct 55 ms 147516 KB Output is correct
19 Correct 58 ms 147524 KB Output is correct
20 Correct 60 ms 147540 KB Output is correct
21 Correct 55 ms 147536 KB Output is correct
22 Correct 51 ms 147544 KB Output is correct
23 Correct 54 ms 147536 KB Output is correct
24 Correct 60 ms 147536 KB Output is correct
25 Correct 580 ms 189912 KB Output is correct
26 Correct 1043 ms 227276 KB Output is correct
27 Correct 1733 ms 260092 KB Output is correct
28 Correct 2716 ms 299080 KB Output is correct
29 Correct 729 ms 203824 KB Output is correct
30 Correct 1472 ms 288860 KB Output is correct
31 Correct 2488 ms 369116 KB Output is correct
32 Correct 4218 ms 490200 KB Output is correct
33 Correct 655 ms 188512 KB Output is correct
34 Correct 1140 ms 226288 KB Output is correct
35 Correct 1900 ms 258144 KB Output is correct
36 Correct 3056 ms 295776 KB Output is correct
37 Correct 683 ms 190768 KB Output is correct
38 Correct 1127 ms 227944 KB Output is correct
39 Correct 1855 ms 262716 KB Output is correct
40 Correct 2811 ms 299312 KB Output is correct
41 Incorrect 924 ms 202580 KB Output isn't correct
42 Halted 0 ms 0 KB -