oj.uz

Submission #1017953

# Submission time Handle Problem Language Result Execution time Memory
1017953 2024-07-09T11:49:37 Z vjudge1 Klasika (COCI20_klasika) C++17
66 / 110
 4123 ms 487224 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+=(1LL<<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

# Verdict Execution time Memory Grader output
1 Correct 56 ms 147536 KB Output is correct
2 Correct 56 ms 147380 KB Output is correct
3 Correct 59 ms 147524 KB Output is correct
4 Correct 65 ms 147500 KB Output is correct
5 Correct 51 ms 147548 KB Output is correct
6 Correct 54 ms 147388 KB Output is correct
7 Correct 55 ms 147352 KB Output is correct
8 Correct 53 ms 147452 KB Output is correct
9 Correct 55 ms 147540 KB Output is correct
10 Correct 54 ms 147536 KB Output is correct
11 Correct 55 ms 147536 KB Output is correct
12 Correct 67 ms 147468 KB Output is correct

Subtask #2
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 56 ms 147536 KB Output is correct
2 Correct 56 ms 147380 KB Output is correct
3 Correct 59 ms 147524 KB Output is correct
4 Correct 65 ms 147500 KB Output is correct
5 Correct 51 ms 147548 KB Output is correct
6 Correct 54 ms 147388 KB Output is correct
7 Correct 55 ms 147352 KB Output is correct
8 Correct 53 ms 147452 KB Output is correct
9 Correct 55 ms 147540 KB Output is correct
10 Correct 54 ms 147536 KB Output is correct
11 Correct 55 ms 147536 KB Output is correct
12 Correct 67 ms 147468 KB Output is correct
13 Correct 55 ms 147500 KB Output is correct
14 Correct 54 ms 147536 KB Output is correct
15 Correct 53 ms 147536 KB Output is correct
16 Correct 66 ms 147540 KB Output is correct
17 Correct 57 ms 147588 KB Output is correct
18 Correct 68 ms 147536 KB Output is correct
19 Correct 54 ms 147540 KB Output is correct
20 Correct 53 ms 147540 KB Output is correct
21 Correct 53 ms 147540 KB Output is correct
22 Correct 53 ms 147536 KB Output is correct
23 Correct 54 ms 147536 KB Output is correct
24 Correct 59 ms 147652 KB Output is correct

Subtask #3
33.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 561 ms 187408 KB Output is correct
2 Correct 904 ms 224508 KB Output is correct
3 Correct 1575 ms 256952 KB Output is correct
4 Correct 2656 ms 295664 KB Output is correct
5 Correct 662 ms 200880 KB Output is correct
6 Correct 1391 ms 286140 KB Output is correct
7 Correct 2348 ms 366116 KB Output is correct
8 Correct 4123 ms 487224 KB Output is correct
9 Correct 526 ms 185544 KB Output is correct
10 Correct 1006 ms 223036 KB Output is correct
11 Correct 1866 ms 254784 KB Output is correct
12 Correct 3017 ms 292176 KB Output is correct

Subtask #4
0 / 44.0

# Verdict Execution time Memory Grader output
1 Correct 56 ms 147536 KB Output is correct
2 Correct 56 ms 147380 KB Output is correct
3 Correct 59 ms 147524 KB Output is correct
4 Correct 65 ms 147500 KB Output is correct
5 Correct 51 ms 147548 KB Output is correct
6 Correct 54 ms 147388 KB Output is correct
7 Correct 55 ms 147352 KB Output is correct
8 Correct 53 ms 147452 KB Output is correct
9 Correct 55 ms 147540 KB Output is correct
10 Correct 54 ms 147536 KB Output is correct
11 Correct 55 ms 147536 KB Output is correct
12 Correct 67 ms 147468 KB Output is correct
13 Correct 55 ms 147500 KB Output is correct
14 Correct 54 ms 147536 KB Output is correct
15 Correct 53 ms 147536 KB Output is correct
16 Correct 66 ms 147540 KB Output is correct
17 Correct 57 ms 147588 KB Output is correct
18 Correct 68 ms 147536 KB Output is correct
19 Correct 54 ms 147540 KB Output is correct
20 Correct 53 ms 147540 KB Output is correct
21 Correct 53 ms 147540 KB Output is correct
22 Correct 53 ms 147536 KB Output is correct
23 Correct 54 ms 147536 KB Output is correct
24 Correct 59 ms 147652 KB Output is correct
25 Correct 561 ms 187408 KB Output is correct
26 Correct 904 ms 224508 KB Output is correct
27 Correct 1575 ms 256952 KB Output is correct
28 Correct 2656 ms 295664 KB Output is correct
29 Correct 662 ms 200880 KB Output is correct
30 Correct 1391 ms 286140 KB Output is correct
31 Correct 2348 ms 366116 KB Output is correct
32 Correct 4123 ms 487224 KB Output is correct
33 Correct 526 ms 185544 KB Output is correct
34 Correct 1006 ms 223036 KB Output is correct
35 Correct 1866 ms 254784 KB Output is correct
36 Correct 3017 ms 292176 KB Output is correct
37 Correct 704 ms 187508 KB Output is correct
38 Correct 1037 ms 224216 KB Output is correct
39 Correct 1722 ms 258868 KB Output is correct
40 Correct 2621 ms 295476 KB Output is correct
41 Incorrect 837 ms 199236 KB Output isn't correct
42 Halted 0 ms 0 KB -