| # |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
| 602303 |
2022-07-22T21:05:37 Z |
patrikpavic2 |
Game (APIO22_game) |
C++17 |
|
14 ms |
23828 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]){
//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]) 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];
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];
/**
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;
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
12 ms |
23724 KB |
Output is correct |
| 2 |
Correct |
11 ms |
23784 KB |
Output is correct |
| 3 |
Correct |
11 ms |
23760 KB |
Output is correct |
| 4 |
Correct |
11 ms |
23760 KB |
Output is correct |
| 5 |
Correct |
11 ms |
23760 KB |
Output is correct |
| 6 |
Correct |
11 ms |
23760 KB |
Output is correct |
| 7 |
Correct |
12 ms |
23760 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
12 ms |
23724 KB |
Output is correct |
| 2 |
Correct |
11 ms |
23784 KB |
Output is correct |
| 3 |
Correct |
11 ms |
23760 KB |
Output is correct |
| 4 |
Correct |
11 ms |
23760 KB |
Output is correct |
| 5 |
Correct |
11 ms |
23760 KB |
Output is correct |
| 6 |
Correct |
11 ms |
23760 KB |
Output is correct |
| 7 |
Correct |
12 ms |
23760 KB |
Output is correct |
| 8 |
Correct |
12 ms |
23828 KB |
Output is correct |
| 9 |
Correct |
10 ms |
23760 KB |
Output is correct |
| 10 |
Correct |
11 ms |
23768 KB |
Output is correct |
| 11 |
Correct |
12 ms |
23780 KB |
Output is correct |
| 12 |
Correct |
12 ms |
23760 KB |
Output is correct |
| 13 |
Correct |
12 ms |
23760 KB |
Output is correct |
| 14 |
Correct |
14 ms |
23760 KB |
Output is correct |
| 15 |
Correct |
11 ms |
23760 KB |
Output is correct |
| 16 |
Correct |
12 ms |
23816 KB |
Output is correct |
| 17 |
Incorrect |
12 ms |
23776 KB |
Wrong Answer[1] |
| 18 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
12 ms |
23724 KB |
Output is correct |
| 2 |
Correct |
11 ms |
23784 KB |
Output is correct |
| 3 |
Correct |
11 ms |
23760 KB |
Output is correct |
| 4 |
Correct |
11 ms |
23760 KB |
Output is correct |
| 5 |
Correct |
11 ms |
23760 KB |
Output is correct |
| 6 |
Correct |
11 ms |
23760 KB |
Output is correct |
| 7 |
Correct |
12 ms |
23760 KB |
Output is correct |
| 8 |
Correct |
12 ms |
23828 KB |
Output is correct |
| 9 |
Correct |
10 ms |
23760 KB |
Output is correct |
| 10 |
Correct |
11 ms |
23768 KB |
Output is correct |
| 11 |
Correct |
12 ms |
23780 KB |
Output is correct |
| 12 |
Correct |
12 ms |
23760 KB |
Output is correct |
| 13 |
Correct |
12 ms |
23760 KB |
Output is correct |
| 14 |
Correct |
14 ms |
23760 KB |
Output is correct |
| 15 |
Correct |
11 ms |
23760 KB |
Output is correct |
| 16 |
Correct |
12 ms |
23816 KB |
Output is correct |
| 17 |
Incorrect |
12 ms |
23776 KB |
Wrong Answer[1] |
| 18 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
12 ms |
23724 KB |
Output is correct |
| 2 |
Correct |
11 ms |
23784 KB |
Output is correct |
| 3 |
Correct |
11 ms |
23760 KB |
Output is correct |
| 4 |
Correct |
11 ms |
23760 KB |
Output is correct |
| 5 |
Correct |
11 ms |
23760 KB |
Output is correct |
| 6 |
Correct |
11 ms |
23760 KB |
Output is correct |
| 7 |
Correct |
12 ms |
23760 KB |
Output is correct |
| 8 |
Correct |
12 ms |
23828 KB |
Output is correct |
| 9 |
Correct |
10 ms |
23760 KB |
Output is correct |
| 10 |
Correct |
11 ms |
23768 KB |
Output is correct |
| 11 |
Correct |
12 ms |
23780 KB |
Output is correct |
| 12 |
Correct |
12 ms |
23760 KB |
Output is correct |
| 13 |
Correct |
12 ms |
23760 KB |
Output is correct |
| 14 |
Correct |
14 ms |
23760 KB |
Output is correct |
| 15 |
Correct |
11 ms |
23760 KB |
Output is correct |
| 16 |
Correct |
12 ms |
23816 KB |
Output is correct |
| 17 |
Incorrect |
12 ms |
23776 KB |
Wrong Answer[1] |
| 18 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
12 ms |
23724 KB |
Output is correct |
| 2 |
Correct |
11 ms |
23784 KB |
Output is correct |
| 3 |
Correct |
11 ms |
23760 KB |
Output is correct |
| 4 |
Correct |
11 ms |
23760 KB |
Output is correct |
| 5 |
Correct |
11 ms |
23760 KB |
Output is correct |
| 6 |
Correct |
11 ms |
23760 KB |
Output is correct |
| 7 |
Correct |
12 ms |
23760 KB |
Output is correct |
| 8 |
Correct |
12 ms |
23828 KB |
Output is correct |
| 9 |
Correct |
10 ms |
23760 KB |
Output is correct |
| 10 |
Correct |
11 ms |
23768 KB |
Output is correct |
| 11 |
Correct |
12 ms |
23780 KB |
Output is correct |
| 12 |
Correct |
12 ms |
23760 KB |
Output is correct |
| 13 |
Correct |
12 ms |
23760 KB |
Output is correct |
| 14 |
Correct |
14 ms |
23760 KB |
Output is correct |
| 15 |
Correct |
11 ms |
23760 KB |
Output is correct |
| 16 |
Correct |
12 ms |
23816 KB |
Output is correct |
| 17 |
Incorrect |
12 ms |
23776 KB |
Wrong Answer[1] |
| 18 |
Halted |
0 ms |
0 KB |
- |
