Submission #602293

# Submission time Handle Problem Language Result Execution time Memory
602293 2022-07-22T20:49:41 Z patrikpavic2 Game (APIO22_game) C++17
60 / 100
4000 ms 57904 KB
#include "game.h"
#include <vector>
#include <cstdio>
#define PB push_back
 
using namespace std;
 
const int N = 5e5 + 500;
const int BUK = 100;
 
int n, k, ans;
vector < int > v[N], r[N];
int L[N], R[N], bukL[N], bukR[N], racL[N], racR[N], bio[N], cookie;
 
void init(int _n, int _k) {
	n = _n, k = _k;
	for(int i = 0;i < n;i++)
		L[i] = -1, R[i] = n, bukL[i] = -1, bukR[i] = k;
	for(int i = 0;i < k;i++)
		L[i] = i, R[i] = i, bukL[i] = i / BUK, bukR[i] = i / BUK, racL[i] = 1, racR[i] = 1;
}
 
void buk_noviL(int x, int vr){
	bukL[x] = vr;
	for(int y : v[x]) 
		if(bukL[y] < vr) buk_noviL(y, vr);
}
 
void buk_noviR(int x, int vr){
	bukR[x] = vr;
	for(int y : r[x])
		if(bukR[y] > vr) buk_noviR(y, vr);
}
 
void noviL(int x, int vr){
	L[x] = vr;
	for(int y : v[x]) 
		if(L[y] < vr && bukR[y] <= vr / BUK) noviL(y, vr);
}
 
void stariL(int x){
	if(bio[x] == cookie || racL[x]) return;
	bio[x] = cookie;
	for(int y : r[x]){
		if(bukL[y] < bukL[x]) continue;
		stariL(y); L[x] = max(L[x], L[y]);
	}
	//if(bukL[x] == bukR[x]) racL[x] = 1;
}
 
void stariR(int x){
	if(bio[x] == cookie || racR[x]) return;
	bio[x] = cookie;
	for(int y : v[x]){
		if(bukR[y] > bukR[x]) continue;
		stariR(y); R[x] = min(R[x], R[y]);
	}
	//if(bukL[x] == bukR[x]) racR[x] = 1;
}
 
void noviR(int x, int vr){
	R[x] = vr;
	for(int y : r[x])
		if(R[y] > vr && bukL[y] >= vr / BUK) noviR(y, vr);
}
 
void update(int a){
	if(bukL[a] == bukR[a] && !racL[a]){
		cookie++; stariL(a); 
	}
	if(bukL[a] == bukR[a] && !racR[a]){	
		cookie++; stariR(a); 
	}
}
 
int add_teleporter(int a, int b) {
	v[a].PB(b), r[b].PB(a);
	if(a == b && a < k) ans = 1;
	if(bukL[b] < bukL[a]) buk_noviL(b, bukL[a]);
	if(bukR[a] > bukR[b]) buk_noviR(a, bukR[b]);
		
	ans |= bukL[a] > bukR[a];
	ans |= bukL[b] > bukR[b];
	if(L[b] < L[a] && bukR[b] <= L[a] / BUK) noviL(b, L[a]);
	if(R[a] > R[b] && bukL[a] >= R[b] / BUK) noviR(a, R[b]);
	update(a); update(b);
	if(a >= k) ans |= L[a] == R[a];
	if(b >= k) ans |= L[b] == R[b];
	ans |= L[a] > R[a];
	ans |= L[b] > R[b];
	
	
	return ans;
}
# Verdict Execution time Memory Grader output
1 Correct 11 ms 23760 KB Output is correct
2 Correct 12 ms 23760 KB Output is correct
3 Correct 12 ms 23760 KB Output is correct
4 Correct 12 ms 23760 KB Output is correct
5 Correct 12 ms 23760 KB Output is correct
6 Correct 13 ms 23784 KB Output is correct
7 Correct 14 ms 23760 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 11 ms 23760 KB Output is correct
2 Correct 12 ms 23760 KB Output is correct
3 Correct 12 ms 23760 KB Output is correct
4 Correct 12 ms 23760 KB Output is correct
5 Correct 12 ms 23760 KB Output is correct
6 Correct 13 ms 23784 KB Output is correct
7 Correct 14 ms 23760 KB Output is correct
8 Correct 12 ms 23760 KB Output is correct
9 Correct 11 ms 23760 KB Output is correct
10 Correct 12 ms 23760 KB Output is correct
11 Correct 11 ms 23760 KB Output is correct
12 Correct 12 ms 23760 KB Output is correct
13 Correct 12 ms 23760 KB Output is correct
14 Correct 13 ms 23852 KB Output is correct
15 Correct 14 ms 23748 KB Output is correct
16 Correct 12 ms 23760 KB Output is correct
17 Correct 12 ms 23808 KB Output is correct
18 Correct 12 ms 23760 KB Output is correct
19 Correct 12 ms 23760 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 11 ms 23760 KB Output is correct
2 Correct 12 ms 23760 KB Output is correct
3 Correct 12 ms 23760 KB Output is correct
4 Correct 12 ms 23760 KB Output is correct
5 Correct 12 ms 23760 KB Output is correct
6 Correct 13 ms 23784 KB Output is correct
7 Correct 14 ms 23760 KB Output is correct
8 Correct 12 ms 23760 KB Output is correct
9 Correct 11 ms 23760 KB Output is correct
10 Correct 12 ms 23760 KB Output is correct
11 Correct 11 ms 23760 KB Output is correct
12 Correct 12 ms 23760 KB Output is correct
13 Correct 12 ms 23760 KB Output is correct
14 Correct 13 ms 23852 KB Output is correct
15 Correct 14 ms 23748 KB Output is correct
16 Correct 12 ms 23760 KB Output is correct
17 Correct 12 ms 23808 KB Output is correct
18 Correct 12 ms 23760 KB Output is correct
19 Correct 12 ms 23760 KB Output is correct
20 Correct 12 ms 23888 KB Output is correct
21 Correct 12 ms 23780 KB Output is correct
22 Correct 12 ms 23876 KB Output is correct
23 Correct 14 ms 23836 KB Output is correct
24 Correct 14 ms 23832 KB Output is correct
25 Correct 16 ms 23988 KB Output is correct
26 Correct 72 ms 23896 KB Output is correct
27 Correct 15 ms 23888 KB Output is correct
28 Correct 15 ms 23920 KB Output is correct
29 Correct 14 ms 23888 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 11 ms 23760 KB Output is correct
2 Correct 12 ms 23760 KB Output is correct
3 Correct 12 ms 23760 KB Output is correct
4 Correct 12 ms 23760 KB Output is correct
5 Correct 12 ms 23760 KB Output is correct
6 Correct 13 ms 23784 KB Output is correct
7 Correct 14 ms 23760 KB Output is correct
8 Correct 12 ms 23760 KB Output is correct
9 Correct 11 ms 23760 KB Output is correct
10 Correct 12 ms 23760 KB Output is correct
11 Correct 11 ms 23760 KB Output is correct
12 Correct 12 ms 23760 KB Output is correct
13 Correct 12 ms 23760 KB Output is correct
14 Correct 13 ms 23852 KB Output is correct
15 Correct 14 ms 23748 KB Output is correct
16 Correct 12 ms 23760 KB Output is correct
17 Correct 12 ms 23808 KB Output is correct
18 Correct 12 ms 23760 KB Output is correct
19 Correct 12 ms 23760 KB Output is correct
20 Correct 12 ms 23888 KB Output is correct
21 Correct 12 ms 23780 KB Output is correct
22 Correct 12 ms 23876 KB Output is correct
23 Correct 14 ms 23836 KB Output is correct
24 Correct 14 ms 23832 KB Output is correct
25 Correct 16 ms 23988 KB Output is correct
26 Correct 72 ms 23896 KB Output is correct
27 Correct 15 ms 23888 KB Output is correct
28 Correct 15 ms 23920 KB Output is correct
29 Correct 14 ms 23888 KB Output is correct
30 Correct 29 ms 25416 KB Output is correct
31 Correct 17 ms 24660 KB Output is correct
32 Correct 33 ms 27136 KB Output is correct
33 Correct 29 ms 26220 KB Output is correct
34 Correct 68 ms 28028 KB Output is correct
35 Correct 53 ms 26932 KB Output is correct
36 Correct 2468 ms 26420 KB Output is correct
37 Correct 1946 ms 26332 KB Output is correct
38 Correct 44 ms 25984 KB Output is correct
39 Correct 55 ms 25968 KB Output is correct
40 Correct 57 ms 27976 KB Output is correct
41 Correct 57 ms 26528 KB Output is correct
42 Correct 54 ms 26300 KB Output is correct
43 Correct 2831 ms 28240 KB Output is correct
44 Correct 134 ms 26828 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 11 ms 23760 KB Output is correct
2 Correct 12 ms 23760 KB Output is correct
3 Correct 12 ms 23760 KB Output is correct
4 Correct 12 ms 23760 KB Output is correct
5 Correct 12 ms 23760 KB Output is correct
6 Correct 13 ms 23784 KB Output is correct
7 Correct 14 ms 23760 KB Output is correct
8 Correct 12 ms 23760 KB Output is correct
9 Correct 11 ms 23760 KB Output is correct
10 Correct 12 ms 23760 KB Output is correct
11 Correct 11 ms 23760 KB Output is correct
12 Correct 12 ms 23760 KB Output is correct
13 Correct 12 ms 23760 KB Output is correct
14 Correct 13 ms 23852 KB Output is correct
15 Correct 14 ms 23748 KB Output is correct
16 Correct 12 ms 23760 KB Output is correct
17 Correct 12 ms 23808 KB Output is correct
18 Correct 12 ms 23760 KB Output is correct
19 Correct 12 ms 23760 KB Output is correct
20 Correct 12 ms 23888 KB Output is correct
21 Correct 12 ms 23780 KB Output is correct
22 Correct 12 ms 23876 KB Output is correct
23 Correct 14 ms 23836 KB Output is correct
24 Correct 14 ms 23832 KB Output is correct
25 Correct 16 ms 23988 KB Output is correct
26 Correct 72 ms 23896 KB Output is correct
27 Correct 15 ms 23888 KB Output is correct
28 Correct 15 ms 23920 KB Output is correct
29 Correct 14 ms 23888 KB Output is correct
30 Correct 29 ms 25416 KB Output is correct
31 Correct 17 ms 24660 KB Output is correct
32 Correct 33 ms 27136 KB Output is correct
33 Correct 29 ms 26220 KB Output is correct
34 Correct 68 ms 28028 KB Output is correct
35 Correct 53 ms 26932 KB Output is correct
36 Correct 2468 ms 26420 KB Output is correct
37 Correct 1946 ms 26332 KB Output is correct
38 Correct 44 ms 25984 KB Output is correct
39 Correct 55 ms 25968 KB Output is correct
40 Correct 57 ms 27976 KB Output is correct
41 Correct 57 ms 26528 KB Output is correct
42 Correct 54 ms 26300 KB Output is correct
43 Correct 2831 ms 28240 KB Output is correct
44 Correct 134 ms 26828 KB Output is correct
45 Correct 272 ms 40004 KB Output is correct
46 Correct 20 ms 28880 KB Output is correct
47 Correct 19 ms 28880 KB Output is correct
48 Correct 490 ms 57904 KB Output is correct
49 Correct 294 ms 48336 KB Output is correct
50 Execution timed out 4029 ms 42736 KB Time limit exceeded
51 Halted 0 ms 0 KB -