oj.uz

답안 #602101

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
602101 2022-07-22T14:54:02 Z patrikpavic2 게임 (APIO22_game) C++17
0 / 100
 13 ms 23764 KB 
#include "game.h"
#include <vector>
#include <cstdio>
#define PB push_back
 
using namespace std;
 
const int N = 5e5 + 500;
const int BUK = 400;
 
int n, k, ans;
vector < int > v[N], r[N];
int L[N], R[N], bukL[N], bukR[N], pos[N], kad[N], tme, SAD, tocL[N], tocR[N];
 
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] = n, pos[i] = -1;
	for(int i = 0;i < k;i++)
		L[i] = i, R[i] = i, bukL[i] = i / BUK, bukR[i] = i / BUK, pos[i] = i / BUK, tocL[i] = 1, tocR[i] = 1;
}

void buk_noviL(int x, int vr){
	bukL[x] = vr / BUK;
	for(int y : v[x]) 
		if(bukL[y] < vr / BUK) buk_noviL(y, vr);
}

void buk_noviR(int x, int vr){
	bukR[x] = vr / BUK;
	for(int y : r[x])
		if(bukR[y] > vr / BUK) buk_noviR(y, vr);
}
 
void noviL(int x, int vr){
	printf("novi x = %d sa vr = %d\n", x, vr);
	L[x] = vr;
	for(int y : v[x]) 
		if(L[y] < vr && pos[y] == vr / BUK) noviL(y, vr);
}
 
void noviR(int x, int vr){
	R[x] = vr;
	for(int y : r[x])
		if(R[y] > vr && pos[y] == vr / BUK) noviR(y, vr);
}

void oznaci_nap(int x, int vr){
	pos[x] = vr; tocR[x] = 1; kad[x] = tme;
	for(int y : v[x]){
		if(!tocR[y] || kad[y] == SAD) 
			oznaci_nap(y, vr);
		R[x] = min(R[x], R[y]);
	}
}

void oznaci_naz(int x, int vr){
	pos[x] = vr; tocL[x] = 1; kad[x] = tme;
	for(int y : r[x]){
		if(!tocL[y] || kad[y] == SAD) 
			oznaci_naz(y, vr);
		L[x] = max(L[x], L[y]);
	}
}

void update(int a){
	if(pos[a] == -1 && bukL[a] == bukR[a]){
		SAD = -1; tme++; oznaci_nap(a, bukL[a] / BUK);
		SAD = tme; tme++; oznaci_nap(a, bukL[a] / BUK);
		SAD = -1; tme++; oznaci_naz(a, bukL[a] / BUK);
		SAD = tme; tme++; oznaci_naz(a, bukL[a] / BUK);
	}
	if(pos[a] != -1 && !tocR[a]){
		SAD = -1; tme++; oznaci_nap(a, bukL[a] / BUK);
		SAD = tme; tme++; oznaci_nap(a, bukL[a] / BUK);
	}
	if(pos[a] != -1 && !tocL[a]) {
		SAD = -1; tme++; oznaci_naz(a, bukL[a] / BUK);
		SAD = tme; tme++; oznaci_naz(a, bukL[a] / BUK);
	}
}

int add_teleporter(int a, int b) {
	printf("%d --> %d\n", a, b);
	v[a].PB(b), r[b].PB(a);
	if(a == b && a < k) ans = 1;
	if(bukL[b] < bukL[a]) buk_noviL(b, L[a]);
	if(bukR[a] > bukR[b]) buk_noviR(a, R[b]);
	ans |= bukL[a] > bukR[a];
	ans |= bukL[b] > bukR[b];
	update(a);
	update(b);
	if(L[b] < L[a] && pos[b] == L[a] / BUK) noviL(b, L[a]);
	if(R[a] > R[b] && pos[a] == R[b] / BUK) noviR(a, R[b]);
	//printf("pos[ 3 ] = %d   %d\n", pos[3], L[3]);
	//printf("a = %d : L %d R %d pos %d\n", a, L[a], R[a], pos[a]);
	//printf("b = %d : L %d R %d pos %d\n", b, L[b], R[b], pos[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;
}

Subtask #1
0.0 / 2.0

# 결과 실행 시간 메모리 Grader output
1 Correct 13 ms 23748 KB Output is correct
2 Incorrect 12 ms 23764 KB Wrong Answer[1]
3 Halted 0 ms 0 KB -

Subtask #2
0.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 13 ms 23748 KB Output is correct
2 Incorrect 12 ms 23764 KB Wrong Answer[1]
3 Halted 0 ms 0 KB -

Subtask #3
0.0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 13 ms 23748 KB Output is correct
2 Incorrect 12 ms 23764 KB Wrong Answer[1]
3 Halted 0 ms 0 KB -

Subtask #4
0.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 13 ms 23748 KB Output is correct
2 Incorrect 12 ms 23764 KB Wrong Answer[1]
3 Halted 0 ms 0 KB -

Subtask #5
0.0 / 40.0

# 결과 실행 시간 메모리 Grader output
1 Correct 13 ms 23748 KB Output is correct
2 Incorrect 12 ms 23764 KB Wrong Answer[1]
3 Halted 0 ms 0 KB -