oj.uz

Submission #602310

# Submission time Handle Problem Language Result Execution time Memory
602310 2022-07-22T21:29:56 Z patrikpavic2 Game (APIO22_game) C++17
60 / 100
 4000 ms 59216 KB 
#include "game.h"
#include <vector>
#include <cstdio>
#define PB push_back
 
using namespace std;
 
const int N = 5e5 + 500;
const int BUK = 3000;
 
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]){
		//printf("racL[ %d ] = 1; L[ %d ] = %d\n", x, x, L[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]){ 
		//printf("racR[ %d ] = 1; R[ %d ] = %d\n", x, x, R[x]);
		racR[x] = 1;
	}
}

void cistiL(int x){
	if(bio[x] != cookie - 1) return;
	bio[x] = cookie;
	for(int y : r[x]){
		cistiL(y); L[x] = max(L[x], L[y]);
	}
}

void cistiR(int x){
	if(bio[x] != cookie - 1) return;
	bio[x] = cookie;
	for(int y : v[x]){
		cistiR(y); R[x] = min(R[x], R[y]);
	}
}

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); 
		cookie++; cistiL(a);
	}
	if(bukL[a] == bukR[a] && !racR[a]){	
		cookie++; stariR(a); 
		cookie++; cistiR(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];
	update(a); update(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]);
	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];
	/**
	printf("%d --> %d\n", a, b);
	printf("buk[ %d ] = %d %d\n", a, bukL[a], bukR[a]);
	printf("buk[ %d ] = %d %d\n", b, bukL[b], bukR[b]);
	printf("LR [ %d ] = %d %d\n", a, L[a], R[a]);
	printf("LR [ %d ] = %d %d\n", b, L[b], R[b]);	
	**/
	return ans;
}

Subtask #1
2.0 / 2.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 23808 KB Output is correct
2 Correct 15 ms 23760 KB Output is correct
3 Correct 14 ms 23796 KB Output is correct
4 Correct 15 ms 23784 KB Output is correct
5 Correct 11 ms 23748 KB Output is correct
6 Correct 12 ms 23760 KB Output is correct
7 Correct 16 ms 23728 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 23808 KB Output is correct
2 Correct 15 ms 23760 KB Output is correct
3 Correct 14 ms 23796 KB Output is correct
4 Correct 15 ms 23784 KB Output is correct
5 Correct 11 ms 23748 KB Output is correct
6 Correct 12 ms 23760 KB Output is correct
7 Correct 16 ms 23728 KB Output is correct
8 Correct 11 ms 23760 KB Output is correct
9 Correct 12 ms 23836 KB Output is correct
10 Correct 11 ms 23760 KB Output is correct
11 Correct 11 ms 23760 KB Output is correct
12 Correct 11 ms 23760 KB Output is correct
13 Correct 12 ms 23760 KB Output is correct
14 Correct 12 ms 23736 KB Output is correct
15 Correct 12 ms 23760 KB Output is correct
16 Correct 12 ms 23856 KB Output is correct
17 Correct 12 ms 23848 KB Output is correct
18 Correct 13 ms 23760 KB Output is correct
19 Correct 11 ms 23780 KB Output is correct

Subtask #3
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 23808 KB Output is correct
2 Correct 15 ms 23760 KB Output is correct
3 Correct 14 ms 23796 KB Output is correct
4 Correct 15 ms 23784 KB Output is correct
5 Correct 11 ms 23748 KB Output is correct
6 Correct 12 ms 23760 KB Output is correct
7 Correct 16 ms 23728 KB Output is correct
8 Correct 11 ms 23760 KB Output is correct
9 Correct 12 ms 23836 KB Output is correct
10 Correct 11 ms 23760 KB Output is correct
11 Correct 11 ms 23760 KB Output is correct
12 Correct 11 ms 23760 KB Output is correct
13 Correct 12 ms 23760 KB Output is correct
14 Correct 12 ms 23736 KB Output is correct
15 Correct 12 ms 23760 KB Output is correct
16 Correct 12 ms 23856 KB Output is correct
17 Correct 12 ms 23848 KB Output is correct
18 Correct 13 ms 23760 KB Output is correct
19 Correct 11 ms 23780 KB Output is correct
20 Correct 12 ms 23888 KB Output is correct
21 Correct 11 ms 23784 KB Output is correct
22 Correct 13 ms 23888 KB Output is correct
23 Correct 14 ms 23888 KB Output is correct
24 Correct 14 ms 23888 KB Output is correct
25 Correct 14 ms 23876 KB Output is correct
26 Correct 16 ms 23888 KB Output is correct
27 Correct 16 ms 23876 KB Output is correct
28 Correct 12 ms 23888 KB Output is correct
29 Correct 13 ms 23884 KB Output is correct

Subtask #4
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 23808 KB Output is correct
2 Correct 15 ms 23760 KB Output is correct
3 Correct 14 ms 23796 KB Output is correct
4 Correct 15 ms 23784 KB Output is correct
5 Correct 11 ms 23748 KB Output is correct
6 Correct 12 ms 23760 KB Output is correct
7 Correct 16 ms 23728 KB Output is correct
8 Correct 11 ms 23760 KB Output is correct
9 Correct 12 ms 23836 KB Output is correct
10 Correct 11 ms 23760 KB Output is correct
11 Correct 11 ms 23760 KB Output is correct
12 Correct 11 ms 23760 KB Output is correct
13 Correct 12 ms 23760 KB Output is correct
14 Correct 12 ms 23736 KB Output is correct
15 Correct 12 ms 23760 KB Output is correct
16 Correct 12 ms 23856 KB Output is correct
17 Correct 12 ms 23848 KB Output is correct
18 Correct 13 ms 23760 KB Output is correct
19 Correct 11 ms 23780 KB Output is correct
20 Correct 12 ms 23888 KB Output is correct
21 Correct 11 ms 23784 KB Output is correct
22 Correct 13 ms 23888 KB Output is correct
23 Correct 14 ms 23888 KB Output is correct
24 Correct 14 ms 23888 KB Output is correct
25 Correct 14 ms 23876 KB Output is correct
26 Correct 16 ms 23888 KB Output is correct
27 Correct 16 ms 23876 KB Output is correct
28 Correct 12 ms 23888 KB Output is correct
29 Correct 13 ms 23884 KB Output is correct
30 Correct 28 ms 25584 KB Output is correct
31 Correct 21 ms 24784 KB Output is correct
32 Correct 32 ms 27428 KB Output is correct
33 Correct 31 ms 26528 KB Output is correct
34 Correct 1098 ms 28320 KB Output is correct
35 Correct 391 ms 27444 KB Output is correct
36 Correct 50 ms 26452 KB Output is correct
37 Correct 43 ms 26452 KB Output is correct
38 Correct 38 ms 26232 KB Output is correct
39 Correct 44 ms 26228 KB Output is correct
40 Correct 899 ms 28448 KB Output is correct
41 Correct 166 ms 26744 KB Output is correct
42 Correct 115 ms 26552 KB Output is correct
43 Correct 73 ms 28412 KB Output is correct
44 Correct 826 ms 28332 KB Output is correct

Subtask #5
0.0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 23808 KB Output is correct
2 Correct 15 ms 23760 KB Output is correct
3 Correct 14 ms 23796 KB Output is correct
4 Correct 15 ms 23784 KB Output is correct
5 Correct 11 ms 23748 KB Output is correct
6 Correct 12 ms 23760 KB Output is correct
7 Correct 16 ms 23728 KB Output is correct
8 Correct 11 ms 23760 KB Output is correct
9 Correct 12 ms 23836 KB Output is correct
10 Correct 11 ms 23760 KB Output is correct
11 Correct 11 ms 23760 KB Output is correct
12 Correct 11 ms 23760 KB Output is correct
13 Correct 12 ms 23760 KB Output is correct
14 Correct 12 ms 23736 KB Output is correct
15 Correct 12 ms 23760 KB Output is correct
16 Correct 12 ms 23856 KB Output is correct
17 Correct 12 ms 23848 KB Output is correct
18 Correct 13 ms 23760 KB Output is correct
19 Correct 11 ms 23780 KB Output is correct
20 Correct 12 ms 23888 KB Output is correct
21 Correct 11 ms 23784 KB Output is correct
22 Correct 13 ms 23888 KB Output is correct
23 Correct 14 ms 23888 KB Output is correct
24 Correct 14 ms 23888 KB Output is correct
25 Correct 14 ms 23876 KB Output is correct
26 Correct 16 ms 23888 KB Output is correct
27 Correct 16 ms 23876 KB Output is correct
28 Correct 12 ms 23888 KB Output is correct
29 Correct 13 ms 23884 KB Output is correct
30 Correct 28 ms 25584 KB Output is correct
31 Correct 21 ms 24784 KB Output is correct
32 Correct 32 ms 27428 KB Output is correct
33 Correct 31 ms 26528 KB Output is correct
34 Correct 1098 ms 28320 KB Output is correct
35 Correct 391 ms 27444 KB Output is correct
36 Correct 50 ms 26452 KB Output is correct
37 Correct 43 ms 26452 KB Output is correct
38 Correct 38 ms 26232 KB Output is correct
39 Correct 44 ms 26228 KB Output is correct
40 Correct 899 ms 28448 KB Output is correct
41 Correct 166 ms 26744 KB Output is correct
42 Correct 115 ms 26552 KB Output is correct
43 Correct 73 ms 28412 KB Output is correct
44 Correct 826 ms 28332 KB Output is correct
45 Correct 264 ms 40176 KB Output is correct
46 Correct 20 ms 28964 KB Output is correct
47 Correct 22 ms 28816 KB Output is correct
48 Correct 487 ms 59216 KB Output is correct
49 Correct 301 ms 50444 KB Output is correct
50 Execution timed out 4019 ms 55696 KB Time limit exceeded
51 Halted 0 ms 0 KB -