| # |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
| 56304 |
2018-07-11T03:24:33 Z |
Yehezkiel |
ICC (CEOI16_icc) |
C++11 |
|
262 ms |
876 KB |
#include "icc.h"
#include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define mp make_pair
#define pb push_back
#define eb emplace_back
#define all(x) (x).begin(),(x).end()
typedef pair<int,int> pii;
const int MAXN=100;
int par[MAXN+5],n;
int finds(int x){
if(par[x]!=x)
par[x]=finds(par[x]);
return par[x];
}
bool connected(int u,int v){
return (finds(u)==finds(v));
}
void gabung(int u,int v){
u=finds(u),v=finds(v);
if(u==v)
return;
par[v]=u;
}
int tanya(vector <int> a,vector <int> b){ //O(N)
int arr1[105];int arr2[105];
for(int i=0;i<(int) a.size();i++)
arr1[i]=a[i];
for(int i=0;i<(int) b.size();i++)
arr2[i]=b[i];
return query(a.size(),b.size(),arr1,arr2);
}
void print(vector <int> arr){
cout<<"printing arr"<<endl;
for(int i=0;i<(int) arr.size();i++)
cout<<arr[i]<<" ";
cout<<endl;
}
void expand(vector <int> &vec){ //isinya cuman kepala suku O(N)
bool root[MAXN+5];
for(int i=1;i<=n;i++)
root[i]=false;
for(auto isi:vec)
root[isi]=true;
vec.clear();
for(int i=1;i<=n;i++)
if(root[finds(i)])
vec.pb(i);
}
void shrink(vector <int> &vec){
int n=0;
for(int i=0;i<(int) vec.size();i++)
{
if(par[vec[i]]==vec[i])
vec[n++]=vec[i];
}
vec.resize(n);
}
void masukkan(vector <int> &tampung,const vector <int> tambahan){
for(int isi:tambahan)
tampung.pb(isi);
}
int perkecil(vector <int> now,const vector <int> other){ //O(NlogN)
int nomor[MAXN+5],n=0;
for(int i=0;i<(int) now.size();i++)
{
if(now[i]==par[now[i]])
nomor[now[i]]=n++;
}
vector <vector <int> > temp1,temp2;
temp1.resize(n),temp2.resize(n);
for(int i=0;i<(int) now.size();i++)
temp1[nomor[finds(now[i])]].pb(now[i]);
while(true) //O(logN)
{
int total=0,lebih=0;
for(int i=0;i<n;i++)
{
total+=temp1[i].size();
lebih+=temp1[i].size()%2;
}
if(total==1)
break;
lebih/=2;
//cout<<totalnya "<<total<<endl;
now.clear();
for(int i=0;i<n;i++)
{
random_shuffle(all(temp1[i]));
int ambil=temp1[i].size()/2;
if(temp1[i].size()&1&&lebih)
ambil++,lebih--;
temp2[i].clear();
for(int j=ambil;j<(int) temp1[i].size();j++)
temp2[i].pb(temp1[i][j]);
temp1[i].resize(ambil);
masukkan(now,temp1[i]);
}
assert(lebih==0);
assert(abs( (int)now.size() - ( total - (int)now.size() ) )<=1);
if(tanya(now,other)==0) //O(N)
{
for(int i=0;i<n;i++)
temp1[i]=temp2[i];
}
}
for(int i=0;i<n;i++)
{
if(temp1[i].size()==1)
return temp1[i][0];
}
assert(false);
return 0;
}
void bagiDua(vector <int> &vec,int &lebih,vector<vector<int> > &tampung){
random_shuffle(all(vec));
int ambil=vec.size()/2;
if(lebih&&(vec.size()&1))
lebih--,ambil++;
vector <int> kiri,kanan;
for(int i=0;i<(int) vec.size();i++)
{
if(i<ambil)
kiri.pb(vec[i]);
else
kanan.pb(vec[i]);
}
tampung.pb(kiri);tampung.pb(kanan);
}
vector <int> kiri,kanan;
void findAnggota(){
vector <vector <int> > anggota,baru;
anggota.resize(1);
for(int i=1;i<=n;i++)
{
if(par[i]==i)
anggota[0].pb(i);
}
//cout<<"MULAI"<<endl;
for(int loop=0;;loop++)
{
baru.clear();
int lebih=0;
for(auto &isi:anggota)
lebih+=isi.size()%2;
lebih/=2;
int terbesar=-1;
for(auto &isi:anggota)
{
terbesar=max(terbesar,(int) isi.size());
bagiDua(isi,lebih,baru);
}
assert(terbesar>1);
kiri.clear();kanan.clear();
for(int i=0;i<(int) baru.size();i++)
{
for(auto isi:baru[i])
{
if(i&1)
kanan.pb(isi);
else
kiri.pb(isi);
}
}
assert(lebih==0);
assert(abs((int) kiri.size() - (int) kanan.size())<=1);
expand(kiri),expand(kanan);
if(tanya(kiri,kanan))
break;
anggota=baru;
}
}
void run(int _n){
srand(2305);
n=_n;
for(int i=1;i<=n;i++)
par[i]=i;
for(int i=0;i<n-1;i++)
{
findAnggota();
//cout<<"found"<<endl;
pii ans;
ans=mp(perkecil(kiri,kanan),perkecil(kanan,kiri));
setRoad(ans.fi,ans.se);
gabung(ans.fi,ans.se);
}
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
10 ms |
504 KB |
Ok! 95 queries used. |
| 2 |
Correct |
9 ms |
612 KB |
Ok! 103 queries used. |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
41 ms |
612 KB |
Ok! 539 queries used. |
| 2 |
Correct |
56 ms |
612 KB |
Ok! 697 queries used. |
| 3 |
Correct |
53 ms |
612 KB |
Ok! 681 queries used. |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
188 ms |
664 KB |
Ok! 1439 queries used. |
| 2 |
Correct |
179 ms |
684 KB |
Ok! 1702 queries used. |
| 3 |
Correct |
155 ms |
684 KB |
Ok! 1485 queries used. |
| 4 |
Correct |
157 ms |
772 KB |
Ok! 1528 queries used. |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
172 ms |
848 KB |
Ok! 1502 queries used. |
| 2 |
Correct |
181 ms |
848 KB |
Ok! 1494 queries used. |
| 3 |
Correct |
172 ms |
848 KB |
Ok! 1616 queries used. |
| 4 |
Correct |
161 ms |
848 KB |
Ok! 1462 queries used. |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
169 ms |
848 KB |
Ok! 1635 queries used. |
| 2 |
Correct |
242 ms |
848 KB |
Ok! 1648 queries used. |
| 3 |
Correct |
262 ms |
848 KB |
Ok! 1673 queries used. |
| 4 |
Correct |
167 ms |
876 KB |
Ok! 1616 queries used. |
| 5 |
Correct |
150 ms |
876 KB |
Ok! 1488 queries used. |
| 6 |
Correct |
231 ms |
876 KB |
Ok! 1578 queries used. |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
167 ms |
876 KB |
Too many queries! 1650 out of 1625 |
| 2 |
Halted |
0 ms |
0 KB |
- |
