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 ll = long long;
void dfs(int n, const vector<int> &a, const vector<int> &b) {
if (n == 1) {
Answer(a.front(), b.front());
return;
}
int m = (n + 1) >> 1;
vector<int> al, ar, bl, br;
for (int i = 0; i < m; ++i) {
al.emplace_back(a[i]);
Query(a[i]);
}
for (int i = m; i < n; ++i) {
ar.emplace_back(a[i]);
}
for (int i = 0; i < n; ++i) {
if (Query(b[i]) == m) {
bl.emplace_back(b[i]);
} else {
br.emplace_back(b[i]);
}
Query(b[i]);
}
for (int i = 0; i < m; ++i) {
Query(a[i]);
}
dfs(m, al, bl);
dfs(n - m, ar, br);
}
void Solve(int N) {
vector<int> a(N), b(N);
iota(a.begin(), a.end(), 1);
iota(b.begin(), b.end(), N + 1);
dfs(N, a, b);
}
# | 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... |