oj.uz

답안 #1017946

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1017946 2024-07-09T11:44:18 Z vjudge1 Klasika (COCI20_klasika) C++17
66 / 110
 4753 ms 487232 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++);
			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();
			}
		}
		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';
		}
	}
	
	return 0;
}

Subtask #1
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 52 ms 147536 KB Output is correct
2 Correct 53 ms 147568 KB Output is correct
3 Correct 53 ms 147368 KB Output is correct
4 Correct 53 ms 147540 KB Output is correct
5 Correct 53 ms 147536 KB Output is correct
6 Correct 54 ms 147540 KB Output is correct
7 Correct 56 ms 147428 KB Output is correct
8 Correct 56 ms 147420 KB Output is correct
9 Correct 54 ms 147552 KB Output is correct
10 Correct 54 ms 147536 KB Output is correct
11 Correct 62 ms 147344 KB Output is correct
12 Correct 53 ms 147576 KB Output is correct

Subtask #2
22.0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 52 ms 147536 KB Output is correct
2 Correct 53 ms 147568 KB Output is correct
3 Correct 53 ms 147368 KB Output is correct
4 Correct 53 ms 147540 KB Output is correct
5 Correct 53 ms 147536 KB Output is correct
6 Correct 54 ms 147540 KB Output is correct
7 Correct 56 ms 147428 KB Output is correct
8 Correct 56 ms 147420 KB Output is correct
9 Correct 54 ms 147552 KB Output is correct
10 Correct 54 ms 147536 KB Output is correct
11 Correct 62 ms 147344 KB Output is correct
12 Correct 53 ms 147576 KB Output is correct
13 Correct 66 ms 147440 KB Output is correct
14 Correct 56 ms 147540 KB Output is correct
15 Correct 55 ms 147480 KB Output is correct
16 Correct 53 ms 147540 KB Output is correct
17 Correct 54 ms 147416 KB Output is correct
18 Correct 55 ms 147540 KB Output is correct
19 Correct 54 ms 147536 KB Output is correct
20 Correct 71 ms 147504 KB Output is correct
21 Correct 52 ms 147536 KB Output is correct
22 Correct 53 ms 147536 KB Output is correct
23 Correct 57 ms 147624 KB Output is correct
24 Correct 52 ms 147524 KB Output is correct

Subtask #3
33.0 / 33.0

# 결과 실행 시간 메모리 Grader output
1 Correct 558 ms 187240 KB Output is correct
2 Correct 969 ms 224384 KB Output is correct
3 Correct 1569 ms 256948 KB Output is correct
4 Correct 2581 ms 295724 KB Output is correct
5 Correct 672 ms 201040 KB Output is correct
6 Correct 1366 ms 285932 KB Output is correct
7 Correct 2575 ms 366116 KB Output is correct
8 Correct 4753 ms 487232 KB Output is correct
9 Correct 664 ms 185500 KB Output is correct
10 Correct 1040 ms 222972 KB Output is correct
11 Correct 1785 ms 254644 KB Output is correct
12 Correct 2910 ms 292084 KB Output is correct

Subtask #4
0 / 44.0

# 결과 실행 시간 메모리 Grader output
1 Correct 52 ms 147536 KB Output is correct
2 Correct 53 ms 147568 KB Output is correct
3 Correct 53 ms 147368 KB Output is correct
4 Correct 53 ms 147540 KB Output is correct
5 Correct 53 ms 147536 KB Output is correct
6 Correct 54 ms 147540 KB Output is correct
7 Correct 56 ms 147428 KB Output is correct
8 Correct 56 ms 147420 KB Output is correct
9 Correct 54 ms 147552 KB Output is correct
10 Correct 54 ms 147536 KB Output is correct
11 Correct 62 ms 147344 KB Output is correct
12 Correct 53 ms 147576 KB Output is correct
13 Correct 66 ms 147440 KB Output is correct
14 Correct 56 ms 147540 KB Output is correct
15 Correct 55 ms 147480 KB Output is correct
16 Correct 53 ms 147540 KB Output is correct
17 Correct 54 ms 147416 KB Output is correct
18 Correct 55 ms 147540 KB Output is correct
19 Correct 54 ms 147536 KB Output is correct
20 Correct 71 ms 147504 KB Output is correct
21 Correct 52 ms 147536 KB Output is correct
22 Correct 53 ms 147536 KB Output is correct
23 Correct 57 ms 147624 KB Output is correct
24 Correct 52 ms 147524 KB Output is correct
25 Correct 558 ms 187240 KB Output is correct
26 Correct 969 ms 224384 KB Output is correct
27 Correct 1569 ms 256948 KB Output is correct
28 Correct 2581 ms 295724 KB Output is correct
29 Correct 672 ms 201040 KB Output is correct
30 Correct 1366 ms 285932 KB Output is correct
31 Correct 2575 ms 366116 KB Output is correct
32 Correct 4753 ms 487232 KB Output is correct
33 Correct 664 ms 185500 KB Output is correct
34 Correct 1040 ms 222972 KB Output is correct
35 Correct 1785 ms 254644 KB Output is correct
36 Correct 2910 ms 292084 KB Output is correct
37 Correct 755 ms 187372 KB Output is correct
38 Correct 1035 ms 224344 KB Output is correct
39 Correct 1676 ms 258876 KB Output is correct
40 Correct 2593 ms 295548 KB Output is correct
41 Incorrect 868 ms 199236 KB Output isn't correct
42 Halted 0 ms 0 KB -