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* Left, int* Right){
for(int i = 0; i < N; i++){
Left[i] = -1;
Right[i] = -1;
}
int big = 0;
for(int i = 0; i < N - 1; i++){
if(query(i, i + 1, i + 1, i + 1) == 1){
Left[i + 1] = big;
big = i + 1;
}
else{
Right[i] = i + 1;
big = i;
}
}
return big;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |