| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 713476 | lam | 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 pair<int,int> ii;
#define ff first
#define ss second
const int maxn = 110;
vector<vector<int>> chan[maxn],le[maxn];
vector <int> comp[maxn];
int n,m;
int p[maxn],s[maxn];
//bool query(int x, int y, int a[], int b[])
//{
// cout<<"query"<<endl;
// for (int i=0; i<x; i++) cout<<a[i]<<' '; cout<<endl;
// for (int i=0; i<y; i++) cout<<b[i]<<' '; cout<<endl;
// bool has; cin>>has; return has;
//}
//void setRoad(int u, int v)
//{
// cout<<"SetRoad "<<u<<' '<<v<<endl;
//}
int get(int x)
{
return p[x]=(p[x]==x)?x:get(p[x]);
}
void hop(int x, int y)
{
x=get(x); y=get(y); if (x==y) return;
if (s[x]>s[y]) swap(x,y);
s[y]+=s[x];
p[x]=y;
for (int i:comp[x]) comp[y].push_back(i);
}
bool query2(int sz1, int sz2, vector <int> tmp1, vector <int> tmp2)
{
int a[110], b[110];
int x=0,y=0;
for (int i=0; i<sz1; i++) for (int j:comp[tmp1[i]]) a[x++] = j;
for (int i=0; i<sz2; i++) for (int j:comp[tmp2[i]]) b[y++] = j;
return query(x,y,a,b);
}
bool query3(int sz1, int sz2, vector <int> tmp1, vector <int> tmp2)
{
int a[110], b[110];
int x=0,y=0;
for (int i=0; i<sz1; i++) a[i] = tmp1[i];
for (int i=0; i<sz2; i++) b[i] = tmp2[i];
return query(sz1,sz2,a,b);
}
void dnc(int lx, int rx, vector <int> tmp, int level)
{
if (lx==rx) return;
random_shuffle(tmp.begin(),tmp.end());
int mid=(lx+rx)/2;
vector <int> tmp_chan, tmp_le;
for (int i=lx; i<=rx; i++) if (i<=mid) tmp_le.push_back(tmp[i-lx]);
else tmp_chan.push_back(tmp[i-lx]);
le[level].push_back(tmp_le); chan[level].push_back(tmp_chan);
dnc(lx,mid,tmp_le,level+1);
dnc(mid+1,rx,tmp_chan,level+1);
}
ii trace(vector <int> tmp_le, vector <int> tmp_chan)
{
if (tmp_chan.size() > tmp_le.size()) swap(tmp_le, tmp_chan);
if (tmp_le.size()==tmp_chan.size()&&tmp_le.size()==1)
{
return {tmp_le[0], tmp_chan[0]};
}
int mid = (tmp_le.size() - 1)/2;
random_shuffle(tmp_le.begin(),tmp_le.end());
vector <int> tmp_le1, tmp_le2;
for (int i=0; i<tmp_le.size(); i++) if (i<=mid) tmp_le1.push_back(tmp_le[i]);
else tmp_le2.push_back(tmp_le[i]);
bool has = query2(tmp_le1.size(),tmp_chan.size(),tmp_le1,tmp_chan);
if (has) return trace(tmp_le1,tmp_chan);
else return trace(tmp_le2,tmp_chan);
}
ii trace2(vector <int> tmp_le, vector <int> tmp_chan)
{
if (tmp_chan.size() > tmp_le.size()) swap(tmp_le, tmp_chan);
if (tmp_le.size()==tmp_chan.size()&&tmp_le.size()==1)
{
return {tmp_le[0], tmp_chan[0]};
}
int mid = (tmp_le.size() - 1)/2;
random_shuffle(tmp_le.begin(),tmp_le.end());
vector <int> tmp_le1, tmp_le2;
for (int i=0; i<tmp_le.size(); i++) if (i<=mid) tmp_le1.push_back(tmp_le[i]);
else tmp_le2.push_back(tmp_le[i]);
bool has = query3(tmp_le1.size(),tmp_chan.size(),tmp_le1,tmp_chan);
if (has) return trace2(tmp_le1,tmp_chan);
else return trace2(tmp_le2,tmp_chan);
}
void run(int N)
{
n=N;
for (int i=1; i<=n; i++) p[i]=i, s[i]=1, comp[i].clear(), comp[i].push_back(i);
for (int it=1; it<=n-1; it++)
{
vector <int> tmp;
for (int i=1; i<=n; i++)
{
if (p[i]==i) tmp.push_back(i); chan[i].clear(), le[i].clear();
}
m=tmp.size();
// for (int i=1; i<=n; i++) cerr<<le[i].size()<<','<<chan[i].size()<<' '; cerr<<endl;
dnc(1,m,tmp,1);
int level = 1;
while (true)
{
vector <int> tmp_le, tmp_chan;
for (vector <int> i:le[level]) for (int j:i) tmp_le.push_back(j);
for (vector <int> i:chan[level]) for (int j:i) tmp_chan.push_back(j);
bool has = query2(tmp_le.size(),tmp_chan.size(),tmp_le,tmp_chan);
if (has==1) break;
level++;
}
int l=0; int r=le[level].size()-1;
int ans=-1;
if (l==r) ans = l;
else
while (l<=r)
{
int mid=(l+r)/2;
vector <int> tmp_le, tmp_chan;
for (int i=mid; i<le[level].size(); i++)
for (int j:le[level][i]) tmp_le.push_back(j);
for (int i=mid; i<chan[level].size(); i++)
for (int j:chan[level][i]) tmp_chan.push_back(j);
bool has = query2(tmp_le.size(),tmp_chan.size(),tmp_le,tmp_chan);
if (has)
{
ans = mid;
l=mid+1;
}
else r=mid-1;
}
ii canh = trace(le[level][ans],chan[level][ans]);
canh = trace2(comp[canh.ff],comp[canh.ss]);
setRoad(canh.ff, canh.ss);
hop(canh.ff,canh.ss);
}
return;
}
//signed main()
//{
// int temp; cin>>temp;
// run(temp);
//}