# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
487260 | minhcool | Minerals (JOI19_minerals) | C++17 | 0 ms | 0 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;
#define int long long
#define fi first
#define se second
#define pb push_back
typedef pair<int, int> ii;
typedef pair<ii, int> iii;
typedef pair<ii, ii> iiii;
const int N = 1e5 + 5;
const int oo = 1e18 + 7, mod = 1e9 + 7;
int n, a[N];
set<int> slices;
vector<int> le, ri;
vector<ii> answer;
queue<pair<vector<int>, vector<int>>> que;
void solve(int N){
n = N;
le.clear();
ri.clear();
slices.clear();
answer.clear();
int lst = 0;
for(int i = 1; i <= 2 * n; i++){
int temp = Query(i);
slices.insert(i);
if(lst < temp){
le.pb(i);
}
else{
ri.pb(i);
}
lst = temp;
}
for(int i = 1; i <= 2 * n; i++) Query(i);
slices.clear();
//vector<int>
que.push({le, ri});
while(!que.empty()){
vector<int> a = que.front().fi, b = que.front().se;
que.pop();
assert(a.size() == b.size());
if(a.size() == 1){
answer.pb({a[0], b[0]});
continue;
}
int mid = (a.size() - 1) / 2;
vector<int> a1, b1, a2, b2;
for(int i = 0; i < mid; i++){
Query(a[i]);
slices.insert(a[i]);
a1.pb(a[i]);
}
for(int i = mid; i < a.size(); i++) a2.pb(a[i]);
int lst = 0;
for(int i = 0; i < b.size(); i++){
int temp = Query(b[i]);
slices.insert(b[i]);
if(temp != lst){
b1.pb(b[i]);
lst = temp;
}
else b2.pb(b[i]);
}
for(auto it : slices) Query(it);
if(a1.size()) que.push({a1, b1});
if(a2.size()) que.push({a2, b2});
}
for(auto it : answer) Answer(it.fi, it.se);
}