# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
867529 | pizzamoeger | popa (BOI18_popa) | C++14 | 0 ms | 0 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
#include "popa.h"
int solve(int N, int* Left, int* Right) {
vector<int> parent (N, -1);
for (int i = 0; i < N; i++) {
Left[i] = -1;
Right[i] = -1;
}
int rl = 0;
for (int i = 1; i < N; i++) {
int v = rl;
while(parent[v] != -1 && query(i, i, i, v)) {
v = parent[v];
}
if (parent[v] == -1) {
if (query(i, i, i, v)) {
parent[v] = i;
Left[i] = v;
rl = i;
} else {
parent[i] = v;
Left[i] = Right[v];
Right[v] = i;
rl = i;
}
} else {
parent[i] = v;
Left[i] = Right[v];
Right[v] = i;
rl = i;
}
}
int root = rl;
while (parent[root] != -1) root = parent[root];
return root;
}
/*signed main() {
const int N = 6;
int* Left = new int[N];
int* Right = new int[N];
int ret = solve(N, Left, Right);
cerr << ret;
for (int i = 0; i < N; i++) {
cout << Left[i] << " " << Right[i] << "\n";
}
return 0;
}*/