# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1039157 | MeGustaElArroz23 | popa (BOI18_popa) | C++17 | 1 ms | 440 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) {
int respuesta = query(0,0,0,0);
for (int i = 0; i < N; i++) {
Left[i] = -1;
Right[i] = i+1;
}
Right[N-1] = -1;
return 0;
}
void test(int N) {
int* Left = new int[N];
int* Right = new int[N];
int root = solve(N, Left, Right);
cout << "Root: " << root << endl;
for (int i = 0; i < N; i++) {
cout << Left[i] << " " << Right[i] << endl;
}
}
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... |