# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1133271 | qrn | ICC (CEOI16_icc) | C++20 | 0 ms | 0 KiB |
// EDU = ivaniscoding.github.io
// EDU = ivaniscoding.github.io
// EDU = ivaniscoding.github.io
#include "icc.h";
#include <bits/stdc++.h>
using namespace std;
// int query(int a, int b, int a1[], int b1[]);
// void SetRoad(int a, int b);
struct DSU {
vector<vector<int>> component;
vector<int> parent, sze;
DSU(int n) {
for(int i = 1; i <= n; i++) {
sze[i] = 1;
parent[i] = i;
component[i].push_back(i);
}
}
int root(int x) {
if(x == parent[x]) return x;
else return parent[x] = root(parent[x]);
}
void unite(int a, int b) {
a = root(a);
b = root(b);
if(a == b) return;
if(sze[a] < sze[b]) swap(a, b);
sze[a] += sze[b];
parent[b] = a;
for(auto u : component[b]) component[a].push_back(u);
component[b].clear();
}
};
void run(int N) {
srand(time(0));
DSU dsu(N + 1);
for(int turn = 0; turn < N; turn++) {
vector<int> upA, downA, total, UpA;
for(int i = 1; i <= N; i++) {
if(dsu.root(i) == i) {
total.push_back(i);
}
}
random_shuffle(total.begin(), total.end());
while(true) {
for(int i = 0; i < total.size() / 2; i++) {
int head = total[i];
for(int j = 0; j < dsu.component[head].size(); j++) {
upA.push_back(dsu.component[head][j]);
}
}
for(int i = total.size() / 2; i < total.size(); i++) {
int head = total[i];
for(int j = 0; j < dsu.component[head].size(); j++) {
downA.push_back(dsu.component[head][j]);
}
}
if(query((int)upA.size(), (int)downA.size(), upA.data(), downA.data())) {
break;
} else {
upA.clear();
downA.clear();
}
}
UpA = upA;
int l = 0, r = upA.size() - 1;
while(l < r) {
int mid = (l + r) / 2;
vector<int> left, right;
for(int i = 0; i <= mid; i++) left.push_back(upA[i]);
for(int i = mid + 1; i < upA.size(); i++) right.push_back(upA[i]);
if(query((int)left.size(), (int)downA.size(), left.data(), downA.data())) {
upA = left;
r = mid;
} else {
upA = right;
l = mid + 1;
}
}
l = 0, r = downA.size() - 1;
while(l < r) {
int mid = (l + r) / 2;
vector<int> left, right;
for(int i = 0; i <= mid; i++) left.push_back(downA[i]);
for(int i = mid + 1; i < downA.size(); i++) right.push_back(downA[i]);
if(query((int)left.size(), (int)UpA.size(), left.data(), UpA.data())) {
downA = left;
r = mid;
} else {
downA = right;
l = mid + 1;
}
}
int ep1 = upA[0], ep2 = downA[0];
SetRoad(ep1, ep2);
dsu.unite(ep1, ep2);
}
}