이 제출은 이전 버전의 oj.uz에서 채점하였습니다. 현재는 제출 당시와는 다른 서버에서 채점을 하기 때문에, 다시 제출하면 결과가 달라질 수도 있습니다.
#include <bits/stdc++.h>
#include "minerals.h"
//~ #include "grader.cpp"
using namespace std;
int curl, curr;
void solve(int l, int r, vector <int> &cur){
if(r < l) return;
if(l == r){
assert(cur.size() == 1);
Answer(l, cur[0]);
return;
}
int mid = (l + r) / 2;
while(curl > l){
l--;
Query(curl);
}
while(curr < r){
curr++;
Query(curr);
}
while(curl < l){
Query(curl);
curl++;
}
while(curr > mid){
Query(curr);
curr--;
}
vector <int> left, right;
for(auto &i : cur){
int x = Query(i);
if(x == mid - l + 1) left.push_back(i);
else right.push_back(i);
Query(i);
}
solve(l, mid, left);
solve(mid + 1, r, right);
}
void Solve(int N){
curl = N + 1;
curr = 2 * N;
vector <int> all;
for(int i = 1 ; i <= 2 * N ; i++){
if(i <= N) all.push_back(i);
else Query(i);
}
solve(N + 1, 2 * N, all);
}
# | 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... |