oj.uz

답안 #602309

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
602309 2022-07-22T21:29:23 Z patrikpavic2 게임 (APIO22_game) C++17
60 / 100
 4000 ms 59248 KB 
#include "game.h"
#include <vector>
#include <cstdio>
#define PB push_back
 
using namespace std;
 
const int N = 5e5 + 500;
const int BUK = 1500;
 
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

# 결과 실행 시간 메모리 Grader output
1 Correct 12 ms 23760 KB Output is correct
2 Correct 11 ms 23760 KB Output is correct
3 Correct 12 ms 23856 KB Output is correct
4 Correct 12 ms 23852 KB Output is correct
5 Correct 12 ms 23828 KB Output is correct
6 Correct 12 ms 23760 KB Output is correct
7 Correct 13 ms 23856 KB Output is correct

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 12 ms 23760 KB Output is correct
2 Correct 11 ms 23760 KB Output is correct
3 Correct 12 ms 23856 KB Output is correct
4 Correct 12 ms 23852 KB Output is correct
5 Correct 12 ms 23828 KB Output is correct
6 Correct 12 ms 23760 KB Output is correct
7 Correct 13 ms 23856 KB Output is correct
8 Correct 12 ms 23760 KB Output is correct
9 Correct 11 ms 23760 KB Output is correct
10 Correct 13 ms 23760 KB Output is correct
11 Correct 11 ms 23796 KB Output is correct
12 Correct 13 ms 23760 KB Output is correct
13 Correct 13 ms 23740 KB Output is correct
14 Correct 12 ms 23784 KB Output is correct
15 Correct 14 ms 23860 KB Output is correct
16 Correct 12 ms 23780 KB Output is correct
17 Correct 12 ms 23836 KB Output is correct
18 Correct 15 ms 23760 KB Output is correct
19 Correct 15 ms 23792 KB Output is correct

Subtask #3
18.0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 12 ms 23760 KB Output is correct
2 Correct 11 ms 23760 KB Output is correct
3 Correct 12 ms 23856 KB Output is correct
4 Correct 12 ms 23852 KB Output is correct
5 Correct 12 ms 23828 KB Output is correct
6 Correct 12 ms 23760 KB Output is correct
7 Correct 13 ms 23856 KB Output is correct
8 Correct 12 ms 23760 KB Output is correct
9 Correct 11 ms 23760 KB Output is correct
10 Correct 13 ms 23760 KB Output is correct
11 Correct 11 ms 23796 KB Output is correct
12 Correct 13 ms 23760 KB Output is correct
13 Correct 13 ms 23740 KB Output is correct
14 Correct 12 ms 23784 KB Output is correct
15 Correct 14 ms 23860 KB Output is correct
16 Correct 12 ms 23780 KB Output is correct
17 Correct 12 ms 23836 KB Output is correct
18 Correct 15 ms 23760 KB Output is correct
19 Correct 15 ms 23792 KB Output is correct
20 Correct 15 ms 23796 KB Output is correct
21 Correct 12 ms 23760 KB Output is correct
22 Correct 13 ms 23876 KB Output is correct
23 Correct 15 ms 23888 KB Output is correct
24 Correct 17 ms 23888 KB Output is correct
25 Correct 15 ms 23880 KB Output is correct
26 Correct 15 ms 23872 KB Output is correct
27 Correct 14 ms 23876 KB Output is correct
28 Correct 14 ms 23888 KB Output is correct
29 Correct 14 ms 23944 KB Output is correct

Subtask #4
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 12 ms 23760 KB Output is correct
2 Correct 11 ms 23760 KB Output is correct
3 Correct 12 ms 23856 KB Output is correct
4 Correct 12 ms 23852 KB Output is correct
5 Correct 12 ms 23828 KB Output is correct
6 Correct 12 ms 23760 KB Output is correct
7 Correct 13 ms 23856 KB Output is correct
8 Correct 12 ms 23760 KB Output is correct
9 Correct 11 ms 23760 KB Output is correct
10 Correct 13 ms 23760 KB Output is correct
11 Correct 11 ms 23796 KB Output is correct
12 Correct 13 ms 23760 KB Output is correct
13 Correct 13 ms 23740 KB Output is correct
14 Correct 12 ms 23784 KB Output is correct
15 Correct 14 ms 23860 KB Output is correct
16 Correct 12 ms 23780 KB Output is correct
17 Correct 12 ms 23836 KB Output is correct
18 Correct 15 ms 23760 KB Output is correct
19 Correct 15 ms 23792 KB Output is correct
20 Correct 15 ms 23796 KB Output is correct
21 Correct 12 ms 23760 KB Output is correct
22 Correct 13 ms 23876 KB Output is correct
23 Correct 15 ms 23888 KB Output is correct
24 Correct 17 ms 23888 KB Output is correct
25 Correct 15 ms 23880 KB Output is correct
26 Correct 15 ms 23872 KB Output is correct
27 Correct 14 ms 23876 KB Output is correct
28 Correct 14 ms 23888 KB Output is correct
29 Correct 14 ms 23944 KB Output is correct
30 Correct 35 ms 25508 KB Output is correct
31 Correct 17 ms 24716 KB Output is correct
32 Correct 33 ms 27380 KB Output is correct
33 Correct 27 ms 26440 KB Output is correct
34 Correct 1155 ms 28316 KB Output is correct
35 Correct 365 ms 27308 KB Output is correct
36 Correct 48 ms 26468 KB Output is correct
37 Correct 57 ms 26476 KB Output is correct
38 Correct 47 ms 26196 KB Output is correct
39 Correct 40 ms 26216 KB Output is correct
40 Correct 939 ms 28308 KB Output is correct
41 Correct 168 ms 26904 KB Output is correct
42 Correct 115 ms 26568 KB Output is correct
43 Correct 58 ms 28376 KB Output is correct
44 Correct 756 ms 28436 KB Output is correct

Subtask #5
0.0 / 40.0

# 결과 실행 시간 메모리 Grader output
1 Correct 12 ms 23760 KB Output is correct
2 Correct 11 ms 23760 KB Output is correct
3 Correct 12 ms 23856 KB Output is correct
4 Correct 12 ms 23852 KB Output is correct
5 Correct 12 ms 23828 KB Output is correct
6 Correct 12 ms 23760 KB Output is correct
7 Correct 13 ms 23856 KB Output is correct
8 Correct 12 ms 23760 KB Output is correct
9 Correct 11 ms 23760 KB Output is correct
10 Correct 13 ms 23760 KB Output is correct
11 Correct 11 ms 23796 KB Output is correct
12 Correct 13 ms 23760 KB Output is correct
13 Correct 13 ms 23740 KB Output is correct
14 Correct 12 ms 23784 KB Output is correct
15 Correct 14 ms 23860 KB Output is correct
16 Correct 12 ms 23780 KB Output is correct
17 Correct 12 ms 23836 KB Output is correct
18 Correct 15 ms 23760 KB Output is correct
19 Correct 15 ms 23792 KB Output is correct
20 Correct 15 ms 23796 KB Output is correct
21 Correct 12 ms 23760 KB Output is correct
22 Correct 13 ms 23876 KB Output is correct
23 Correct 15 ms 23888 KB Output is correct
24 Correct 17 ms 23888 KB Output is correct
25 Correct 15 ms 23880 KB Output is correct
26 Correct 15 ms 23872 KB Output is correct
27 Correct 14 ms 23876 KB Output is correct
28 Correct 14 ms 23888 KB Output is correct
29 Correct 14 ms 23944 KB Output is correct
30 Correct 35 ms 25508 KB Output is correct
31 Correct 17 ms 24716 KB Output is correct
32 Correct 33 ms 27380 KB Output is correct
33 Correct 27 ms 26440 KB Output is correct
34 Correct 1155 ms 28316 KB Output is correct
35 Correct 365 ms 27308 KB Output is correct
36 Correct 48 ms 26468 KB Output is correct
37 Correct 57 ms 26476 KB Output is correct
38 Correct 47 ms 26196 KB Output is correct
39 Correct 40 ms 26216 KB Output is correct
40 Correct 939 ms 28308 KB Output is correct
41 Correct 168 ms 26904 KB Output is correct
42 Correct 115 ms 26568 KB Output is correct
43 Correct 58 ms 28376 KB Output is correct
44 Correct 756 ms 28436 KB Output is correct
45 Correct 271 ms 40288 KB Output is correct
46 Correct 20 ms 28880 KB Output is correct
47 Correct 19 ms 28880 KB Output is correct
48 Correct 467 ms 59248 KB Output is correct
49 Correct 271 ms 50536 KB Output is correct
50 Execution timed out 4103 ms 55612 KB Time limit exceeded
51 Halted 0 ms 0 KB -