| # |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
| 602079 |
2022-07-22T14:34:46 Z |
patrikpavic2 |
Game (APIO22_game) |
C++17 |
|
15 ms |
23844 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){
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;
for(int y : v[x]){
if(!tocR[y])
oznaci_nap(y, vr);
R[x] = min(R[x], R[y]);
}
}
void oznaci_naz(int x, int vr){
pos[x] = vr; tocL[x] = 1;
for(int y : r[x]){
if(!tocL[y])
oznaci_naz(y, vr);
L[x] = max(L[x], L[y]);
}
}
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, L[a]);
if(bukR[a] > bukR[b]) buk_noviR(a, R[b]);
ans |= bukL[a] > bukR[a];
ans |= bukL[b] > bukR[b];
if(pos[a] == -1 && bukL[a] == bukR[a]){
oznaci_nap(a, bukL[a] / BUK);
oznaci_naz(a, bukL[a] / BUK);
}
if(pos[a] != -1 && !tocR[a]) oznaci_nap(a, pos[a]);
if(pos[a] != -1 && !tocL[a]) oznaci_naz(a, pos[a]);
if(pos[b] == -1 && bukL[b] == bukR[b]){
oznaci_nap(b, bukL[b] / BUK);
oznaci_naz(b, bukL[b] / BUK);
}
if(pos[b] != -1 && !tocR[b]) oznaci_nap(b, pos[b]);
if(pos[b] != -1 && !tocL[b]) oznaci_naz(b, pos[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("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;
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
12 ms |
23844 KB |
Output is correct |
| 2 |
Correct |
15 ms |
23764 KB |
Output is correct |
| 3 |
Correct |
14 ms |
23760 KB |
Output is correct |
| 4 |
Correct |
12 ms |
23760 KB |
Output is correct |
| 5 |
Correct |
11 ms |
23828 KB |
Output is correct |
| 6 |
Correct |
12 ms |
23760 KB |
Output is correct |
| 7 |
Correct |
14 ms |
23744 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
12 ms |
23844 KB |
Output is correct |
| 2 |
Correct |
15 ms |
23764 KB |
Output is correct |
| 3 |
Correct |
14 ms |
23760 KB |
Output is correct |
| 4 |
Correct |
12 ms |
23760 KB |
Output is correct |
| 5 |
Correct |
11 ms |
23828 KB |
Output is correct |
| 6 |
Correct |
12 ms |
23760 KB |
Output is correct |
| 7 |
Correct |
14 ms |
23744 KB |
Output is correct |
| 8 |
Correct |
12 ms |
23760 KB |
Output is correct |
| 9 |
Correct |
12 ms |
23760 KB |
Output is correct |
| 10 |
Correct |
11 ms |
23792 KB |
Output is correct |
| 11 |
Correct |
11 ms |
23760 KB |
Output is correct |
| 12 |
Correct |
11 ms |
23760 KB |
Output is correct |
| 13 |
Incorrect |
12 ms |
23812 KB |
Wrong Answer[1] |
| 14 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
12 ms |
23844 KB |
Output is correct |
| 2 |
Correct |
15 ms |
23764 KB |
Output is correct |
| 3 |
Correct |
14 ms |
23760 KB |
Output is correct |
| 4 |
Correct |
12 ms |
23760 KB |
Output is correct |
| 5 |
Correct |
11 ms |
23828 KB |
Output is correct |
| 6 |
Correct |
12 ms |
23760 KB |
Output is correct |
| 7 |
Correct |
14 ms |
23744 KB |
Output is correct |
| 8 |
Correct |
12 ms |
23760 KB |
Output is correct |
| 9 |
Correct |
12 ms |
23760 KB |
Output is correct |
| 10 |
Correct |
11 ms |
23792 KB |
Output is correct |
| 11 |
Correct |
11 ms |
23760 KB |
Output is correct |
| 12 |
Correct |
11 ms |
23760 KB |
Output is correct |
| 13 |
Incorrect |
12 ms |
23812 KB |
Wrong Answer[1] |
| 14 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
12 ms |
23844 KB |
Output is correct |
| 2 |
Correct |
15 ms |
23764 KB |
Output is correct |
| 3 |
Correct |
14 ms |
23760 KB |
Output is correct |
| 4 |
Correct |
12 ms |
23760 KB |
Output is correct |
| 5 |
Correct |
11 ms |
23828 KB |
Output is correct |
| 6 |
Correct |
12 ms |
23760 KB |
Output is correct |
| 7 |
Correct |
14 ms |
23744 KB |
Output is correct |
| 8 |
Correct |
12 ms |
23760 KB |
Output is correct |
| 9 |
Correct |
12 ms |
23760 KB |
Output is correct |
| 10 |
Correct |
11 ms |
23792 KB |
Output is correct |
| 11 |
Correct |
11 ms |
23760 KB |
Output is correct |
| 12 |
Correct |
11 ms |
23760 KB |
Output is correct |
| 13 |
Incorrect |
12 ms |
23812 KB |
Wrong Answer[1] |
| 14 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
12 ms |
23844 KB |
Output is correct |
| 2 |
Correct |
15 ms |
23764 KB |
Output is correct |
| 3 |
Correct |
14 ms |
23760 KB |
Output is correct |
| 4 |
Correct |
12 ms |
23760 KB |
Output is correct |
| 5 |
Correct |
11 ms |
23828 KB |
Output is correct |
| 6 |
Correct |
12 ms |
23760 KB |
Output is correct |
| 7 |
Correct |
14 ms |
23744 KB |
Output is correct |
| 8 |
Correct |
12 ms |
23760 KB |
Output is correct |
| 9 |
Correct |
12 ms |
23760 KB |
Output is correct |
| 10 |
Correct |
11 ms |
23792 KB |
Output is correct |
| 11 |
Correct |
11 ms |
23760 KB |
Output is correct |
| 12 |
Correct |
11 ms |
23760 KB |
Output is correct |
| 13 |
Incorrect |
12 ms |
23812 KB |
Wrong Answer[1] |
| 14 |
Halted |
0 ms |
0 KB |
- |
