oj.uz

Submission #1017955

# Submission time Handle Problem Language Result Execution time Memory
1017955 2024-07-09T11:52:58 Z vjudge1 Klasika (COCI20_klasika) C++17
66 / 110
 4317 ms 490796 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*31];
int nxt[M*31][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 54 ms 151076 KB Output is correct
2 Correct 59 ms 151124 KB Output is correct
3 Correct 53 ms 151132 KB Output is correct
4 Correct 54 ms 151112 KB Output is correct
5 Correct 56 ms 151120 KB Output is correct
6 Correct 53 ms 151120 KB Output is correct
7 Correct 55 ms 151120 KB Output is correct
8 Correct 55 ms 151120 KB Output is correct
9 Correct 53 ms 151120 KB Output is correct
10 Correct 54 ms 151124 KB Output is correct
11 Correct 54 ms 151292 KB Output is correct
12 Correct 54 ms 151296 KB Output is correct

Subtask #2
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 54 ms 151076 KB Output is correct
2 Correct 59 ms 151124 KB Output is correct
3 Correct 53 ms 151132 KB Output is correct
4 Correct 54 ms 151112 KB Output is correct
5 Correct 56 ms 151120 KB Output is correct
6 Correct 53 ms 151120 KB Output is correct
7 Correct 55 ms 151120 KB Output is correct
8 Correct 55 ms 151120 KB Output is correct
9 Correct 53 ms 151120 KB Output is correct
10 Correct 54 ms 151124 KB Output is correct
11 Correct 54 ms 151292 KB Output is correct
12 Correct 54 ms 151296 KB Output is correct
13 Correct 56 ms 151244 KB Output is correct
14 Correct 55 ms 151120 KB Output is correct
15 Correct 54 ms 151380 KB Output is correct
16 Correct 54 ms 151316 KB Output is correct
17 Correct 55 ms 151120 KB Output is correct
18 Correct 57 ms 151120 KB Output is correct
19 Correct 55 ms 151288 KB Output is correct
20 Correct 53 ms 151148 KB Output is correct
21 Correct 53 ms 151120 KB Output is correct
22 Correct 53 ms 151252 KB Output is correct
23 Correct 57 ms 151116 KB Output is correct
24 Correct 56 ms 151124 KB Output is correct

Subtask #3
33.0 / 33.0

# Verdict Execution time Memory Grader output
1 Correct 586 ms 190588 KB Output is correct
2 Correct 966 ms 227644 KB Output is correct
3 Correct 1715 ms 260136 KB Output is correct
4 Correct 2597 ms 299312 KB Output is correct
5 Correct 665 ms 204540 KB Output is correct
6 Correct 1355 ms 289596 KB Output is correct
7 Correct 2456 ms 369792 KB Output is correct
8 Correct 4317 ms 490796 KB Output is correct
9 Correct 542 ms 189384 KB Output is correct
10 Correct 1065 ms 226852 KB Output is correct
11 Correct 1807 ms 258364 KB Output is correct
12 Correct 3004 ms 295724 KB Output is correct

Subtask #4
0 / 44.0

# Verdict Execution time Memory Grader output
1 Correct 54 ms 151076 KB Output is correct
2 Correct 59 ms 151124 KB Output is correct
3 Correct 53 ms 151132 KB Output is correct
4 Correct 54 ms 151112 KB Output is correct
5 Correct 56 ms 151120 KB Output is correct
6 Correct 53 ms 151120 KB Output is correct
7 Correct 55 ms 151120 KB Output is correct
8 Correct 55 ms 151120 KB Output is correct
9 Correct 53 ms 151120 KB Output is correct
10 Correct 54 ms 151124 KB Output is correct
11 Correct 54 ms 151292 KB Output is correct
12 Correct 54 ms 151296 KB Output is correct
13 Correct 56 ms 151244 KB Output is correct
14 Correct 55 ms 151120 KB Output is correct
15 Correct 54 ms 151380 KB Output is correct
16 Correct 54 ms 151316 KB Output is correct
17 Correct 55 ms 151120 KB Output is correct
18 Correct 57 ms 151120 KB Output is correct
19 Correct 55 ms 151288 KB Output is correct
20 Correct 53 ms 151148 KB Output is correct
21 Correct 53 ms 151120 KB Output is correct
22 Correct 53 ms 151252 KB Output is correct
23 Correct 57 ms 151116 KB Output is correct
24 Correct 56 ms 151124 KB Output is correct
25 Correct 586 ms 190588 KB Output is correct
26 Correct 966 ms 227644 KB Output is correct
27 Correct 1715 ms 260136 KB Output is correct
28 Correct 2597 ms 299312 KB Output is correct
29 Correct 665 ms 204540 KB Output is correct
30 Correct 1355 ms 289596 KB Output is correct
31 Correct 2456 ms 369792 KB Output is correct
32 Correct 4317 ms 490796 KB Output is correct
33 Correct 542 ms 189384 KB Output is correct
34 Correct 1065 ms 226852 KB Output is correct
35 Correct 1807 ms 258364 KB Output is correct
36 Correct 3004 ms 295724 KB Output is correct
37 Correct 745 ms 191180 KB Output is correct
38 Correct 1067 ms 228032 KB Output is correct
39 Correct 1798 ms 262720 KB Output is correct
40 Correct 2681 ms 299344 KB Output is correct
41 Incorrect 813 ms 203036 KB Output isn't correct
42 Halted 0 ms 0 KB -