# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
167316 | maruii | Minerals (JOI19_minerals) | C++14 | 47 ms | 2424 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;
int A[43005], S[43005];
void Solve(int N) {
vector<int> X, Y;
for (int i = 1, v = 0; i <= 2 * N; ++i) {
int t = Query(i);
if (t > v) X.push_back(i);
else Y.push_back(i);
v = t;
}
for (int i = 0; i < N; ++i) S[i] = 1;
for (int i = 0; i < 16; ++i) {
int v = 0, t = 0, cnt = 0;
for (int j = 0; j < N; ++j) if (S[j] ^ (j >> i) & 1) cnt++;
if (cnt < N - cnt) t = 1;
for (int j = 0; j < N; ++j) if (t ^ S[j] ^ (j >> i) & 1) {
v = Query(X[j]);
S[j] ^= 1;
}
for (int j = 0; j < N; ++j) {
int a = Query(Y[j]);
if ((v == a) ^ t) A[j] |= 1 << i;
v = a;
}
}
for (int i = 0; i < N; ++i) Answer(Y[i], X[A[i]]);
}
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... |