This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#ifndef LOCAL
#include "popa.h"
#endif // LOCAL
#include <bits/stdc++.h>
using namespace std;
int solve(int N, int *l, int *r){
for(int i = 0 ; i < N ; ++i)l[i] = r[i] = -1;
vector<int> s;
for(int i = 0 ; i < N ; ++i){
int son = -1;
while(s.size() > 0){
int pos = s.back();
while(l[pos] != -1)pos = l[pos];
if(query(pos, i, s.back(), s.back()) == 1){
break;
}else{
son = s.back();
s.pop_back();
}
}
if(s.size())r[s.back()] = i;
l[i] = son;
s.push_back(i);
}
return s[0];
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |