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 <iostream>
#include <vector>
#include <algorithm>
#include <cassert>
using namespace std;
void Solve(int N) {
vector<int> l, r;
int kek = 0;
for (int i = 1; i <= 2 * N; ++i) {
int cur = Query(i);
if (kek != cur) {
l.push_back(i);
kek = cur;
} else {
Query(i);
r.push_back(i);
}
}
for (int i : l) {
Query(i);
}
vector<int> sum(N);
for (int bit = 0; (1 << bit) < N; ++bit) {
for (int i = 0; i < N; ++i) {
if ((i >> bit) & 1) {
Query(l[i]);
}
}
for (int i = 0; i < N; ++i) {
kek = Query(r[i]);
if (kek == Query(r[i])) {
sum[i] += (1 << bit);
}
}
for (int i = 0; i < N; ++i) {
if ((i >> bit) & 1) {
Query(l[i]);
}
}
}
// for (int i = 0; i < N; ++i) {
// cout << l[sum[i]] << " " << r[i] << endl;
// }
for (int i = 0; i < N; ++i) {
Answer(l[sum[i]], r[i]);
}
}
# | 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... |