이 제출은 이전 버전의 oj.uz에서 채점하였습니다. 현재는 제출 당시와는 다른 서버에서 채점을 하기 때문에, 다시 제출하면 결과가 달라질 수도 있습니다.
#include <iostream>
#include <vector>
#include "minerals.h"
using namespace std;
void solve(vector<int> a, vector<int> b) {
if (a.size() == 1) {
Answer(a[0], b[0]);
return;
}
int n = a.size() / 2, m = a.size() - n;
vector<int> a1(n), a2(m);
vector<int> b1, b2;
for (int i = 0; i < n; ++i) a1[i] = a[i], Query(a[i]);
for (int i = 0; i < m; ++i) a2[i] = a[i + n];
for (int i = 0; i < n + m; ++i) {
int now = Query(b[i]);
if (now == n) b1.push_back(b[i]);
else b2.push_back(b[i]);
Query(b[i]);
}
for (int i = 0; i < n; ++i) Query(a[i]);
solve(a1, b1), solve(a2, b2);
}
void Solve(int n) {
vector<int> a, b;
int last = 0;
for (int i = 1; i <= 2 * n; ++i) {
int now = Query(i);
if (now > last) a.push_back(i);
else b.push_back(i);
last = now;
}
for (int i = 1; i <= 2 * n; ++i) Query(i);
solve(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... |