oj.uz

Submission #578146

# Submission time Handle Problem Language Result Execution time Memory
578146 2022-06-16T05:48:00 Z handlename Game (APIO22_game) C++17
30 / 100
 1424 ms 262144 KB 
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define mp make_pair
const int MOD=1e9+7;
int n,k;
vector<int> adj[300001],rev[300001];
struct node{
	node *l,*r;
	//left node stores stuff which can reach m
	//right node stores stuff which m can reach
	int s,m,e;
	unordered_set<int> stuff;
	node(int ss,int ee){
		s=ss;
		e=ee;
		m=(s+e)/2;
		if (s<e){
			l=new node(s,m);
			r=new node(m+1,e);
			for (int i=s;i<=m;i++) l->stuff.insert(i);
			for (int i=m;i<=e;i++) r->stuff.insert(i);
		}
		if (s==e){
			l=new node(s,-1);
			r=new node(s,-1);
			l->stuff.insert(s);
			r->stuff.insert(s);
		}
	}
	bool upd(int u,int v){
		if (e==-1){
			stuff.insert(u);
			stuff.insert(v);
			return false;
		}
		/*
		cout<<"update "<<s<<' '<<m<<' '<<e<<' '<<u<<' '<<v<<'\n';
		cout<<"left: ";
		for (auto i:l->stuff) cout<<i<<' ';
		cout<<'\n';
		cout<<"right: ";
		for (auto i:r->stuff) cout<<i<<' ';
		cout<<'\n';
		*/
		bool uleft=(l->stuff.find(u)!=l->stuff.end());
		bool uright=(r->stuff.find(u)!=r->stuff.end());
		bool vleft=(l->stuff.find(v)!=l->stuff.end());
		bool vright=(r->stuff.find(v)!=r->stuff.end());
		
		if (s==e){
			if (uright){
				if (vleft) return true;
				if (!vright){
					r->stuff.insert(v);
					//if (r->upd(u,v)) return true;
					for (auto i:adj[v]){
						if (upd(v,i)) return true;
					}
				}
			}
			if (vleft){
				if (!uleft){
					l->stuff.insert(u);
					//if (l->upd(u,v)) return true;
					for (auto i:rev[u]){
						if (upd(i,u)) return true;
					}
				}
			}
			return false;
		}
		
		if (uleft){
			if (vleft) return l->upd(u,v);
			if (vright) return false;
			return false; //v can only reach stuff on right, u->m->right, so u->v->right useless
		}
		if (uright){
			if (vleft) return true;
			if (vright) return r->upd(u,v);
			r->stuff.insert(v);
			if (r->upd(u,v)) return true;
			for (auto i:adj[v]){
				if (upd(v,i)) return true;
			}
			return false;
		}
		if (vleft){
			l->stuff.insert(u);
			if (l->upd(u,v)) return true;
			for (auto i:rev[u]){
				if (upd(i,u)) return true;
			}
			return false;
		}
		if (vright){
			return false; //only stuff on left can reach u, left->m->v, so left->u->v useless
		}
		return false;
	}
}*root;
void init(int N,int K){
	n=N;
	k=K;
	for (int i=1;i<k;i++){
		adj[i].pb(i+1);
		rev[i+1].pb(i);
	}
	root=new node(1,k);
}
int add_teleporter(int u,int v){
	u++;
	v++;
	adj[u].pb(v);
	rev[v].pb(u);
	if (u>=v && u<=k) return 1;
	if (u==v) return 0;
	return root->upd(u,v);
}

Subtask #1
2.0 / 2.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 14288 KB Output is correct
2 Correct 9 ms 14288 KB Output is correct
3 Correct 8 ms 14440 KB Output is correct
4 Correct 7 ms 14416 KB Output is correct
5 Correct 7 ms 14416 KB Output is correct
6 Correct 8 ms 14416 KB Output is correct
7 Correct 8 ms 14416 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 14288 KB Output is correct
2 Correct 9 ms 14288 KB Output is correct
3 Correct 8 ms 14440 KB Output is correct
4 Correct 7 ms 14416 KB Output is correct
5 Correct 7 ms 14416 KB Output is correct
6 Correct 8 ms 14416 KB Output is correct
7 Correct 8 ms 14416 KB Output is correct
8 Correct 7 ms 14340 KB Output is correct
9 Correct 8 ms 14288 KB Output is correct
10 Correct 10 ms 14288 KB Output is correct
11 Correct 7 ms 14308 KB Output is correct
12 Correct 8 ms 14416 KB Output is correct
13 Correct 8 ms 14336 KB Output is correct
14 Correct 8 ms 14416 KB Output is correct
15 Correct 8 ms 14428 KB Output is correct
16 Correct 8 ms 14408 KB Output is correct
17 Correct 8 ms 14352 KB Output is correct
18 Correct 9 ms 14416 KB Output is correct
19 Correct 7 ms 14456 KB Output is correct

Subtask #3
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 14288 KB Output is correct
2 Correct 9 ms 14288 KB Output is correct
3 Correct 8 ms 14440 KB Output is correct
4 Correct 7 ms 14416 KB Output is correct
5 Correct 7 ms 14416 KB Output is correct
6 Correct 8 ms 14416 KB Output is correct
7 Correct 8 ms 14416 KB Output is correct
8 Correct 7 ms 14340 KB Output is correct
9 Correct 8 ms 14288 KB Output is correct
10 Correct 10 ms 14288 KB Output is correct
11 Correct 7 ms 14308 KB Output is correct
12 Correct 8 ms 14416 KB Output is correct
13 Correct 8 ms 14336 KB Output is correct
14 Correct 8 ms 14416 KB Output is correct
15 Correct 8 ms 14428 KB Output is correct
16 Correct 8 ms 14408 KB Output is correct
17 Correct 8 ms 14352 KB Output is correct
18 Correct 9 ms 14416 KB Output is correct
19 Correct 7 ms 14456 KB Output is correct
20 Correct 9 ms 14404 KB Output is correct
21 Correct 8 ms 14496 KB Output is correct
22 Correct 9 ms 14608 KB Output is correct
23 Correct 9 ms 14424 KB Output is correct
24 Correct 11 ms 15308 KB Output is correct
25 Correct 13 ms 15060 KB Output is correct
26 Correct 12 ms 14708 KB Output is correct
27 Correct 12 ms 15264 KB Output is correct
28 Correct 13 ms 15312 KB Output is correct
29 Correct 14 ms 15468 KB Output is correct

Subtask #4
0.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 14288 KB Output is correct
2 Correct 9 ms 14288 KB Output is correct
3 Correct 8 ms 14440 KB Output is correct
4 Correct 7 ms 14416 KB Output is correct
5 Correct 7 ms 14416 KB Output is correct
6 Correct 8 ms 14416 KB Output is correct
7 Correct 8 ms 14416 KB Output is correct
8 Correct 7 ms 14340 KB Output is correct
9 Correct 8 ms 14288 KB Output is correct
10 Correct 10 ms 14288 KB Output is correct
11 Correct 7 ms 14308 KB Output is correct
12 Correct 8 ms 14416 KB Output is correct
13 Correct 8 ms 14336 KB Output is correct
14 Correct 8 ms 14416 KB Output is correct
15 Correct 8 ms 14428 KB Output is correct
16 Correct 8 ms 14408 KB Output is correct
17 Correct 8 ms 14352 KB Output is correct
18 Correct 9 ms 14416 KB Output is correct
19 Correct 7 ms 14456 KB Output is correct
20 Correct 9 ms 14404 KB Output is correct
21 Correct 8 ms 14496 KB Output is correct
22 Correct 9 ms 14608 KB Output is correct
23 Correct 9 ms 14424 KB Output is correct
24 Correct 11 ms 15308 KB Output is correct
25 Correct 13 ms 15060 KB Output is correct
26 Correct 12 ms 14708 KB Output is correct
27 Correct 12 ms 15264 KB Output is correct
28 Correct 13 ms 15312 KB Output is correct
29 Correct 14 ms 15468 KB Output is correct
30 Correct 29 ms 15836 KB Output is correct
31 Correct 16 ms 16120 KB Output is correct
32 Correct 33 ms 18196 KB Output is correct
33 Correct 41 ms 16792 KB Output is correct
34 Correct 112 ms 33656 KB Output is correct
35 Correct 131 ms 34492 KB Output is correct
36 Correct 80 ms 21468 KB Output is correct
37 Correct 163 ms 29740 KB Output is correct
38 Correct 224 ms 39520 KB Output is correct
39 Correct 190 ms 37144 KB Output is correct
40 Correct 123 ms 33572 KB Output is correct
41 Correct 163 ms 35600 KB Output is correct
42 Correct 108 ms 29512 KB Output is correct
43 Runtime error 1424 ms 262144 KB Execution killed with signal 9
44 Halted 0 ms 0 KB -

Subtask #5
0.0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 14288 KB Output is correct
2 Correct 9 ms 14288 KB Output is correct
3 Correct 8 ms 14440 KB Output is correct
4 Correct 7 ms 14416 KB Output is correct
5 Correct 7 ms 14416 KB Output is correct
6 Correct 8 ms 14416 KB Output is correct
7 Correct 8 ms 14416 KB Output is correct
8 Correct 7 ms 14340 KB Output is correct
9 Correct 8 ms 14288 KB Output is correct
10 Correct 10 ms 14288 KB Output is correct
11 Correct 7 ms 14308 KB Output is correct
12 Correct 8 ms 14416 KB Output is correct
13 Correct 8 ms 14336 KB Output is correct
14 Correct 8 ms 14416 KB Output is correct
15 Correct 8 ms 14428 KB Output is correct
16 Correct 8 ms 14408 KB Output is correct
17 Correct 8 ms 14352 KB Output is correct
18 Correct 9 ms 14416 KB Output is correct
19 Correct 7 ms 14456 KB Output is correct
20 Correct 9 ms 14404 KB Output is correct
21 Correct 8 ms 14496 KB Output is correct
22 Correct 9 ms 14608 KB Output is correct
23 Correct 9 ms 14424 KB Output is correct
24 Correct 11 ms 15308 KB Output is correct
25 Correct 13 ms 15060 KB Output is correct
26 Correct 12 ms 14708 KB Output is correct
27 Correct 12 ms 15264 KB Output is correct
28 Correct 13 ms 15312 KB Output is correct
29 Correct 14 ms 15468 KB Output is correct
30 Correct 29 ms 15836 KB Output is correct
31 Correct 16 ms 16120 KB Output is correct
32 Correct 33 ms 18196 KB Output is correct
33 Correct 41 ms 16792 KB Output is correct
34 Correct 112 ms 33656 KB Output is correct
35 Correct 131 ms 34492 KB Output is correct
36 Correct 80 ms 21468 KB Output is correct
37 Correct 163 ms 29740 KB Output is correct
38 Correct 224 ms 39520 KB Output is correct
39 Correct 190 ms 37144 KB Output is correct
40 Correct 123 ms 33572 KB Output is correct
41 Correct 163 ms 35600 KB Output is correct
42 Correct 108 ms 29512 KB Output is correct
43 Runtime error 1424 ms 262144 KB Execution killed with signal 9
44 Halted 0 ms 0 KB -