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) {
  vector<int> stk;
  for (int i = 0; i < N; i++) {
    L[i] = R[i] = -1;
    while (!stk.empty()) {
      if (!query(stk.back(), i, i, i)) {
        break;
      }
      L[i] = stk.back();
      stk.pop_back();
    }
    if (!stk.empty()) {
      R[stk.back()] = i;
    }
    stk.push_back(i);
  }
  return stk[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... |