# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
61959 | khsoo01 | popa (BOI18_popa) | C++11 | 141 ms | 704 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 *Left, int *Right) {
for(int i=0;i<N;i++) {
Left[i] = Right[i] = -1;
}
vector<int> S;
S.push_back(0);
for(int i=1;i<N;i++) {
int T;
while(!S.empty()) {
T = S.back();
if(query(T, T, T, i)) {
Left[i] = Right[T];
Right[T] = i;
break;
}
else S.pop_back();
}
if(S.empty()) {
Left[i] = T;
}
S.push_back(i);
}
return S[0];
}
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... |