# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
706970 | socpite | 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"icc.h"
#include<bits/stdc++.h>
using namespace std;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
#define f first
#define s second
typedef long long ll;
typedef long double ld;
const int maxn = 105;
const int mod = 998244353;
int t, n;
map<int, int> mp;
/*int query(int sza, int szb, int a[], int b[]){
cout << sza << endl;
for(int i = 0; i < sza; i++)cout << a[i] << " ";
cout << endl;
cout << szb << endl;
for(int i = 0; i < szb; i++)cout << b[i] << " ";
cout << endl;
int x;
cin >> x;
return x;
}
void setRoad(int a, int b){
cout << "FOUND " << a << " " << b << endl;
}*/
int up[maxn];
int Find(int x){
if(!up[x])return x;
else return up[x] = Find(up[x]);
}
void Union(int a, int b){
a = Find(a);
b = Find(b);
up[a] = b;
}
int arr1[maxn], arr2[maxn];
int gt(vector<int> a, vector<int> b){
//cout << a.size() << " " << b.size() << "\n";
if(a.empty() || b.empty())return 0;
for(int i = 0; i < a.size(); i++)arr1[i] = a[i];
for(int i = 0; i < b.size(); i++)arr2[i] = b[i];
return query(a.size(), b.size(), arr1, arr2);
}
int bs(vector<int> a, vector<int> b){
int l = 0, r = a.size()-1;
shuffle(a.begin(), a.end());
shuffle(b.begin(), b.end());
while(l < r){
int mid = (l+r+1)>>1;
if(gt(vector<int>(a.begin(), a.begin()+mid), b))r = mid-1;
else l = mid;
}
return a[l];
}
void findedge(vector<int> a, vector<int> b){
assert(!a.empty() && !b.empty());
int h1 = bs(a, b), h2 = bs(b, a);
Union(h1, h2);
setRoad(h1, h2);
}
void run(int N){
n = N;
for(int i = 0; i < n-1; i++){
mp.clear();
int crr = 0;
vector<int> ord;
for(int i = 1; i <= n; i++)ord.push_back(i);
shuffle(ord.begin(), ord.end(), rng);
for(auto i: ord)if(mp.find(Find(i)) == mp.end())mp[Find(i)] = crr++;
ord.clear();
for(int i = 0; i < 10; i++)ord.push_back(i);
shuffle(ord.begin(), ord.end(), rng);
for(auto j: ord){
//cout << i << " " << j << endl;
vector<int> v[2];
for(int k = 1; k <= n; k++)v[(mp[Find(k)]>>j)&1].push_back(k);
//cout << v[0].size() << " " << v[1].size() << endl;
if(gt(v[0], v[1])){
findedge(v[0], v[1]);
break;
}
}
}
}