# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
287716 | luciocf | popa (BOI18_popa) | C++14 | 101 ms | 500 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"
using namespace std;
int solve(int n, int *l, int *r)
{
stack<int> stk;
for (int i = 0; i < n; i++)
{
l[i] = r[i] = -1;
while (stk.size() && query(stk.top(), i, i, i))
{
l[i] = stk.top();
stk.pop();
}
if (stk.size()) r[stk.top()] = i;
stk.push(i);
}
int root;
while (stk.size())
{
root = stk.top();
stk.pop();
}
return root;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |