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"
using namespace std;
int attach(int root, int ver, int *left, int *right)
{
if (root == -1)
return ver;
if (query(root, ver, ver, ver))
{
left[ver] = root;
return ver;
}
right[root] = attach(right[root], ver, left, right);
return root;
}
int solve(int n, int *left, int *right)
{
left[0] = right[0] = -1;
int root = 0;
for (int i = 1; i < n; i++)
root = attach(root, i, left, right);
return root;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |