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"
#define maxN 1005
using namespace std;
int solve(int n, int* l, int* d){
int i,root=0;
for(i=0;i<n;i++){
l[i]=d[i]=-1;
}
for(i=1;i<n;i++){
if(query(i-1,i,i-1,i-1)) d[i-1]=i;
else{
l[i]=root;
root=i;
}
}
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... |