# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
120715 | onjo0127 | Minerals (JOI19_minerals) | C++14 | 45 ms | 2944 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 "minerals.h"
#include <bits/stdc++.h>
using namespace std;
using vi = vector<int>;
bool chk[100009];
int query(int x) {
chk[x] = !chk[x];
//printf("query x: %d\n", x);
return Query(x);
}
void answer(int a, int b) {
//printf("answer: (%d, %d)\n", a, b);
Answer(a, b);
}
pair<vi, vi> split(int N) {
vector<int> A, B;
int pr = 0, i = 0;
for(i=1; i<=2*N; i++) {
int Q = query(i);
if(pr != Q) A.push_back(i);
else B.push_back(i);
pr = Q;
}
return {A, B};
}
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... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |