# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
597440 | 1bin | ICC (CEOI16_icc) | C++14 | 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 <icc.h>
using namespace std;
typedef long long ll;
#define all(v) v.begin(), v.end()
const int NMAX = 105;
int par[NMAX], a[NMAX], b[NMAX], sza, szb;
int find(int x){ return par[x] == -1 ? x : par[x] = find(par[x]);}
vector<int> v[NMAX];
void run(int n){
memset(par, -1, sizeof(par));
for(int i = 1; i <= n; i++) v[i].emplace_back(i);
int sz = n;
for(int i = 0; i < n - 1; i++, sz--){
vector<int> arr;
for(int i = 1; i <= n; i++)
if(par[i] == -1) arr.emplace_back(i);
for(int bit = 0; 1 << bit < sz; bit++){
for(int j = 0; j < sz; j++){
if(j & (1 << bit)) {
for(auto& x : v[j]) a[sza++] = x;
}
else{
for(auto& x : v[j]) b[szb++] = x;
}
}
if(query(sza, szb, a, b)){
int l = 0, r = sza - 1, m, x, y;
while(l < r){
m = (l + r) >> 1;
if(query(m - l + 1, szb, a + l, b)) r = m;
else l = m + 1;
}
x = a[l];
l = 0; r = szb - 1;
while(l < r){
m = (l + r) >> 1;
if(query(sza, m - l + 1, a, b + l)) r = m;
else l = m + 1;
}
y = b[l];
setRoad(x, y);
x = find(x); y = find(y);
if(v[x].size() < v[y].size()) swap(x, y);
for(int & t : y) v[x].emplace_back(t);
par[y] = x;
break;
}
}
}
return;
}