답안 #578311

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
578311	2022-06-16T11:00:56 Z	handlename	게임 (APIO22_game)	C++17	2 / 100	4000 ms	14400 KB

game

#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];
pair<int,int> range[300001];
//rightmost special node to go i, leftmost special node i can go to
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);
		range[i]=mp(i,i);
	}
	for (int i=k+1;i<=n;i++){
		range[i]=mp(0,k+1);
	}
}
bool upd(int u,int v){
	if (range[u].second<=range[v].first) return false;
	if (range[u].first>=range[v].second) return true;
	if (range[u]==range[v]) return false;
	//u1 u u2
	//v1 v v2
	//u2>v1 and u1<v2
	//if we use u->v edge,v1=max(u1,v1) and u2=min(u2,v2)
	if ((range[v].first+range[v].second)/2<=range[u].first){
		while ((range[v].first+range[v].second)/2<=range[u].first){
			range[v].first=(range[v].first+range[v].second)/2;
		}
		for (auto i:adj[v]){
			if (upd(v,i)) return true;
		}
	}
	if ((range[u].second+range[u].first)/2>range[v].second){
		while ((range[u].second+range[u].first)/2>range[v].second){
			range[u].second=(range[u].second+range[u].first)/2;
		}
		for (auto i:rev[u]){
			if (upd(i,u)) return true;
		}
	}
	return false;	
}
int add_teleporter(int u,int v){
	u++;
	v++;
	if (u>=v && u<=k) return 1;
	if (u==v) return 0;
	adj[u].pb(v);
	rev[v].pb(u);
	return upd(u,v);
}

Subtask #1

2.0 / 2.0

#	결과	실행 시간	메모리	Grader output
1	Correct	7 ms	14288 KB	Output is correct
2	Correct	8 ms	14276 KB	Output is correct
3	Correct	8 ms	14288 KB	Output is correct
4	Correct	8 ms	14288 KB	Output is correct
5	Correct	8 ms	14396 KB	Output is correct
6	Correct	8 ms	14400 KB	Output is correct
7	Correct	8 ms	14292 KB	Output is correct

Subtask #2

0.0 / 10.0

#	결과	실행 시간	메모리	Grader output
1	Correct	7 ms	14288 KB	Output is correct
2	Correct	8 ms	14276 KB	Output is correct
3	Correct	8 ms	14288 KB	Output is correct
4	Correct	8 ms	14288 KB	Output is correct
5	Correct	8 ms	14396 KB	Output is correct
6	Correct	8 ms	14400 KB	Output is correct
7	Correct	8 ms	14292 KB	Output is correct
8	Correct	8 ms	14288 KB	Output is correct
9	Correct	9 ms	14288 KB	Output is correct
10	Execution timed out	4037 ms	14288 KB	Time limit exceeded
11	Halted	0 ms	0 KB	-

Subtask #3

0.0 / 18.0

#	결과	실행 시간	메모리	Grader output
1	Correct	7 ms	14288 KB	Output is correct
2	Correct	8 ms	14276 KB	Output is correct
3	Correct	8 ms	14288 KB	Output is correct
4	Correct	8 ms	14288 KB	Output is correct
5	Correct	8 ms	14396 KB	Output is correct
6	Correct	8 ms	14400 KB	Output is correct
7	Correct	8 ms	14292 KB	Output is correct
8	Correct	8 ms	14288 KB	Output is correct
9	Correct	9 ms	14288 KB	Output is correct
10	Execution timed out	4037 ms	14288 KB	Time limit exceeded
11	Halted	0 ms	0 KB	-

Subtask #4

0.0 / 30.0

#	결과	실행 시간	메모리	Grader output
1	Correct	7 ms	14288 KB	Output is correct
2	Correct	8 ms	14276 KB	Output is correct
3	Correct	8 ms	14288 KB	Output is correct
4	Correct	8 ms	14288 KB	Output is correct
5	Correct	8 ms	14396 KB	Output is correct
6	Correct	8 ms	14400 KB	Output is correct
7	Correct	8 ms	14292 KB	Output is correct
8	Correct	8 ms	14288 KB	Output is correct
9	Correct	9 ms	14288 KB	Output is correct
10	Execution timed out	4037 ms	14288 KB	Time limit exceeded
11	Halted	0 ms	0 KB	-

Subtask #5

0.0 / 40.0

#	결과	실행 시간	메모리	Grader output
1	Correct	7 ms	14288 KB	Output is correct
2	Correct	8 ms	14276 KB	Output is correct
3	Correct	8 ms	14288 KB	Output is correct
4	Correct	8 ms	14288 KB	Output is correct
5	Correct	8 ms	14396 KB	Output is correct
6	Correct	8 ms	14400 KB	Output is correct
7	Correct	8 ms	14292 KB	Output is correct
8	Correct	8 ms	14288 KB	Output is correct
9	Correct	9 ms	14288 KB	Output is correct
10	Execution timed out	4037 ms	14288 KB	Time limit exceeded
11	Halted	0 ms	0 KB	-