oj.uz

답안 #578156

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
578156 2022-06-16T06:23:06 Z handlename 게임 (APIO22_game) C++17
30 / 100
 1380 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 (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){
			if (uleft) return l->upd(u,v);
			l->stuff.insert(u);
			if (l->upd(u,v)) return true;
			for (auto i:rev[u]){
				if (upd(i,u)) return true;
			}
		}
		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

# 결과 실행 시간 메모리 Grader output
1 Correct 11 ms 14332 KB Output is correct
2 Correct 9 ms 14300 KB Output is correct
3 Correct 9 ms 14524 KB Output is correct
4 Correct 9 ms 14416 KB Output is correct
5 Correct 8 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

# 결과 실행 시간 메모리 Grader output
1 Correct 11 ms 14332 KB Output is correct
2 Correct 9 ms 14300 KB Output is correct
3 Correct 9 ms 14524 KB Output is correct
4 Correct 9 ms 14416 KB Output is correct
5 Correct 8 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 8 ms 14288 KB Output is correct
9 Correct 9 ms 14296 KB Output is correct
10 Correct 10 ms 14288 KB Output is correct
11 Correct 9 ms 14288 KB Output is correct
12 Correct 11 ms 14416 KB Output is correct
13 Correct 8 ms 14344 KB Output is correct
14 Correct 9 ms 14456 KB Output is correct
15 Correct 8 ms 14420 KB Output is correct
16 Correct 9 ms 14416 KB Output is correct
17 Correct 8 ms 14416 KB Output is correct
18 Correct 9 ms 14452 KB Output is correct
19 Correct 9 ms 14364 KB Output is correct

Subtask #3
18.0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 11 ms 14332 KB Output is correct
2 Correct 9 ms 14300 KB Output is correct
3 Correct 9 ms 14524 KB Output is correct
4 Correct 9 ms 14416 KB Output is correct
5 Correct 8 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 8 ms 14288 KB Output is correct
9 Correct 9 ms 14296 KB Output is correct
10 Correct 10 ms 14288 KB Output is correct
11 Correct 9 ms 14288 KB Output is correct
12 Correct 11 ms 14416 KB Output is correct
13 Correct 8 ms 14344 KB Output is correct
14 Correct 9 ms 14456 KB Output is correct
15 Correct 8 ms 14420 KB Output is correct
16 Correct 9 ms 14416 KB Output is correct
17 Correct 8 ms 14416 KB Output is correct
18 Correct 9 ms 14452 KB Output is correct
19 Correct 9 ms 14364 KB Output is correct
20 Correct 8 ms 14416 KB Output is correct
21 Correct 9 ms 14416 KB Output is correct
22 Correct 10 ms 14672 KB Output is correct
23 Correct 12 ms 14424 KB Output is correct
24 Correct 12 ms 15476 KB Output is correct
25 Correct 17 ms 15184 KB Output is correct
26 Correct 17 ms 14884 KB Output is correct
27 Correct 14 ms 15440 KB Output is correct
28 Correct 12 ms 15440 KB Output is correct
29 Correct 15 ms 15568 KB Output is correct

Subtask #4
0.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 11 ms 14332 KB Output is correct
2 Correct 9 ms 14300 KB Output is correct
3 Correct 9 ms 14524 KB Output is correct
4 Correct 9 ms 14416 KB Output is correct
5 Correct 8 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 8 ms 14288 KB Output is correct
9 Correct 9 ms 14296 KB Output is correct
10 Correct 10 ms 14288 KB Output is correct
11 Correct 9 ms 14288 KB Output is correct
12 Correct 11 ms 14416 KB Output is correct
13 Correct 8 ms 14344 KB Output is correct
14 Correct 9 ms 14456 KB Output is correct
15 Correct 8 ms 14420 KB Output is correct
16 Correct 9 ms 14416 KB Output is correct
17 Correct 8 ms 14416 KB Output is correct
18 Correct 9 ms 14452 KB Output is correct
19 Correct 9 ms 14364 KB Output is correct
20 Correct 8 ms 14416 KB Output is correct
21 Correct 9 ms 14416 KB Output is correct
22 Correct 10 ms 14672 KB Output is correct
23 Correct 12 ms 14424 KB Output is correct
24 Correct 12 ms 15476 KB Output is correct
25 Correct 17 ms 15184 KB Output is correct
26 Correct 17 ms 14884 KB Output is correct
27 Correct 14 ms 15440 KB Output is correct
28 Correct 12 ms 15440 KB Output is correct
29 Correct 15 ms 15568 KB Output is correct
30 Correct 27 ms 15652 KB Output is correct
31 Correct 14 ms 16080 KB Output is correct
32 Correct 33 ms 18208 KB Output is correct
33 Correct 34 ms 16792 KB Output is correct
34 Correct 133 ms 35000 KB Output is correct
35 Correct 147 ms 35328 KB Output is correct
36 Correct 143 ms 26820 KB Output is correct
37 Correct 226 ms 33436 KB Output is correct
38 Correct 351 ms 71784 KB Output is correct
39 Correct 415 ms 64272 KB Output is correct
40 Correct 105 ms 34724 KB Output is correct
41 Correct 156 ms 38300 KB Output is correct
42 Correct 134 ms 30332 KB Output is correct
43 Runtime error 1380 ms 262144 KB Execution killed with signal 9
44 Halted 0 ms 0 KB -

Subtask #5
0.0 / 40.0

# 결과 실행 시간 메모리 Grader output
1 Correct 11 ms 14332 KB Output is correct
2 Correct 9 ms 14300 KB Output is correct
3 Correct 9 ms 14524 KB Output is correct
4 Correct 9 ms 14416 KB Output is correct
5 Correct 8 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 8 ms 14288 KB Output is correct
9 Correct 9 ms 14296 KB Output is correct
10 Correct 10 ms 14288 KB Output is correct
11 Correct 9 ms 14288 KB Output is correct
12 Correct 11 ms 14416 KB Output is correct
13 Correct 8 ms 14344 KB Output is correct
14 Correct 9 ms 14456 KB Output is correct
15 Correct 8 ms 14420 KB Output is correct
16 Correct 9 ms 14416 KB Output is correct
17 Correct 8 ms 14416 KB Output is correct
18 Correct 9 ms 14452 KB Output is correct
19 Correct 9 ms 14364 KB Output is correct
20 Correct 8 ms 14416 KB Output is correct
21 Correct 9 ms 14416 KB Output is correct
22 Correct 10 ms 14672 KB Output is correct
23 Correct 12 ms 14424 KB Output is correct
24 Correct 12 ms 15476 KB Output is correct
25 Correct 17 ms 15184 KB Output is correct
26 Correct 17 ms 14884 KB Output is correct
27 Correct 14 ms 15440 KB Output is correct
28 Correct 12 ms 15440 KB Output is correct
29 Correct 15 ms 15568 KB Output is correct
30 Correct 27 ms 15652 KB Output is correct
31 Correct 14 ms 16080 KB Output is correct
32 Correct 33 ms 18208 KB Output is correct
33 Correct 34 ms 16792 KB Output is correct
34 Correct 133 ms 35000 KB Output is correct
35 Correct 147 ms 35328 KB Output is correct
36 Correct 143 ms 26820 KB Output is correct
37 Correct 226 ms 33436 KB Output is correct
38 Correct 351 ms 71784 KB Output is correct
39 Correct 415 ms 64272 KB Output is correct
40 Correct 105 ms 34724 KB Output is correct
41 Correct 156 ms 38300 KB Output is correct
42 Correct 134 ms 30332 KB Output is correct
43 Runtime error 1380 ms 262144 KB Execution killed with signal 9
44 Halted 0 ms 0 KB -