| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 795579 | SlavicG | 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 <bits/stdc++.h>
#include "minerals.h"
using namespace std;
#define all(v) v.begin(), v.end()
#define sz(a) (int)a.size()
#define pb push_back
#define rall(v) v.rbegin(),v.rend()
mt19937 rng(69);
void Solve(int n) {
vector<int> p1, p2;
int ans = 0, prevans = -1;
vector<int> bulanea(2 * n);
iota(bulanea.begin(), bulanea.end(), 1);
shuffle(bulanea.begin(), bulanea.end(), rng);
for(int i: bulanea) {
ans = Query(i);
if(ans == prevans) {
p2.pb(i);
} else {
p1.pb(i);
}
prevans = ans;
}
assert(sz(p1) == n && sz(p2) == n);
vector<int> pr(n, 0);
int IN = 1;
/*
vector<bool> bagat(n, 1);
for(int bit = 0; (1 << bit) < n; ++bit) {
for(int i = 0; i < n; ++i) {
if(i >> bit & 1) {
if(!bagat[i]) prevans = Query(p1[i]);
bagat[i] = 1;
} else {
if(bagat[i]) prevans = Query(p1[i]);
bagat[i] = 0;
}
}
for(int i = 0; i < n; ++i) {
int ans = Query(p2[i]);
if(ans == prevans) {
pr[i] += (1 << bit);
}
prevans = ans;
}
IN ^= 1;
}
*/
vector<int> l(n, 0), r(n, n - 1);
int F = 0;
int j = n - 1;
for(int runs = 0; runs < 17; ++runs) {
vector<pair<int, int>> b;
vector<int> ids[n + 1];
for(int i = 0; i < n; ++i) {
if(l[i] <= r[i]) {
int mid = l[i] + r[i] >> 1;
b.push_back({mid, i});
ids[mid].push_back(i);
}
}
if(b.empty()) break;
sort(all(b));
int cost1 = 0, cost2 = 0;
{
map<int, int> vis;
int k = j;
while(k > b[0].first) {
vis[k] = true;
++cost1;
--k;
vis[k] = true;
}
if(!vis[b.back().first]) {
while(k < b.back().first) {
++k;
++cost1;
}
}
}
{
int k = j;
map<int, int> vis;
while(k < b.back().first) {
vis[k] = true;
++cost2;
++k;
vis[k] = true;
}
if(!vis[b[0].first]) {
while(k > b[0].first) {
--k;
++cost2;
}
}
}
if(cost1 <= cost2) {
map<int, int> vis;
while(j > b[0].first) {
if(!vis[j]) {
for(auto x: ids[j]) {
int ans = query(p2[x]);
if(ans == prevans) {
pr[x.second] = mid;
r[x.second] = mid - 1;
} else {
l[x.second] = mid + 1;
}
prevans = ans;
}
vis[j] = true;
}
prevans = Query(p1[j]);
--j;
if(!vis[j]) {
for(auto x: ids[j]) {
int ans = query(p2[x]);
if(ans == prevans) {
pr[x.second] = mid;
r[x.second] = mid - 1;
} else {
l[x.second] = mid + 1;
}
prevans = ans;
}
vis[j] = true;
}
}
if(!vis[b.back().first]) {
while(j < b.back().first) {
if(!vis[j]) {
for(auto x: ids[j]) {
int ans = query(p2[x]);
if(ans == prevans) {
pr[x.second] = mid;
r[x.second] = mid - 1;
} else {
l[x.second] = mid + 1;
}
prevans = ans;
}
vis[j] = true;
}
++j;
prevans = Query(p1[j]);
if(!vis[j]) {
for(auto x: ids[j]) {
int ans = query(p2[x]);
if(ans == prevans) {
pr[x.second] = mid;
r[x.second] = mid - 1;
} else {
l[x.second] = mid + 1;
}
prevans = ans;
}
vis[j] = true;
}
}
}
} else {
map<int, int> vis;
while(j < b.back().first) {
if(!vis[j]) {
for(auto x: ids[j]) {
int ans = query(p2[x]);
if(ans == prevans) {
pr[x] = mid;
r[x] = mid - 1;
} else {
l[x] = mid + 1;
}
prevans = ans;
}
vis[j] = true;
}
++j;
prevans = Query(p1[j]);
if(!vis[j]) {
for(auto x: ids[j]) {
int ans = query(p2[x]);
if(ans == prevans) {
pr[x] = mid;
r[x] = mid - 1;
} else {
l[x] = mid + 1;
}
prevans = ans;
}
vis[j] = true;
}
}
if(!vis[b[0].first]) {
while(j > b[0].first) {
if(!vis[j]) {
for(auto x: ids[j]) {
int ans = query(p2[x]);
if(ans == prevans) {
pr[x] = mid;
r[x] = mid - 1;
} else {
l[x] = mid + 1;
}
prevans = ans;
}
vis[j] = true;
}
prevans = Query(p1[j]);
--j;
if(!vis[j]) {
for(auto x: ids[j]) {
int ans = query(p2[x]);
if(ans == prevans) {
pr[x] = mid;
r[x] = mid - 1;
} else {
l[x] = mid + 1;
}
prevans = ans;
}
vis[j] = true;
}
}
}
}
}
for(int i = 0; i < n; ++i) {
Answer(p2[i], p1[pr[i]]);
}
}
/*
4
1 5
2 6
3 4
7 8
*/