| # |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
| 56274 |
2018-07-11T01:33:37 Z |
Yehezkiel |
ICC (CEOI16_icc) |
C++11 |
|
195 ms |
916 KB |
#include "icc.h"
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define eb emplace_back
#define all(x) (x).begin(),(x).end()
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<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);
}
void print(vector <int> arr){
cout<<"printing arr"<<endl;
for(int i=0;i<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 perkecil(vector <int> &now,const vector <int> &other){ //O(NlogN)
vector <int> temp;
while(now.size()>1) //O(logN)
{
temp.clear();
for(int i=now.size()/2;i<now.size();i++)
temp.pb(now[i]);
now.resize(now.size()/2);
if(tanya(now,other)==0) //O(N)
now=temp;
}
}
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<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);
}
int target=anggota[0].size();
int ukuran=anggota[0].size();
while(true)
{
ukuran/=2;
baru.clear();
int lebih=target-ukuran;
for(auto &isi:anggota)
bagiDua(isi,lebih,baru);
kiri.clear();kanan.clear();
for(int i=0;i<baru.size();i++)
{
for(auto isi:baru[i])
{
if(i&1)
kanan.pb(isi);
else
kiri.pb(isi);
}
}
expand(kiri),expand(kanan);
if(tanya(kiri,kanan))
break;
anggota=baru;
}
}
void run(int _n){
srand(2911);
n=_n;
for(int i=1;i<=n;i++)
par[i]=i;
for(int i=0;i<n-1;i++)
{
findAnggota();
perkecil(kiri,kanan);
perkecil(kanan,kiri);
setRoad(kiri[0],kanan[0]);
gabung(kiri[0],kanan[0]);
}
}
Compilation message
icc.cpp: In function 'int tanya(std::vector<int>, std::vector<int>)':
icc.cpp:25:15: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
for(int i=0;i<a.size();i++)
~^~~~~~~~~
icc.cpp:27:15: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
for(int i=0;i<b.size();i++)
~^~~~~~~~~
icc.cpp: In function 'void print(std::vector<int>)':
icc.cpp:34:15: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
for(int i=0;i<arr.size();i++)
~^~~~~~~~~~~
icc.cpp: In function 'void perkecil(std::vector<int>&, const std::vector<int>&)':
icc.cpp:54:27: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
for(int i=now.size()/2;i<now.size();i++)
~^~~~~~~~~~~
icc.cpp: In function 'void bagiDua(std::vector<int>&, int&, std::vector<std::vector<int> >&)':
icc.cpp:70:15: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
for(int i=0;i<vec.size();i++)
~^~~~~~~~~~~
icc.cpp: In function 'void findAnggota()':
icc.cpp:100:16: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
for(int i=0;i<baru.size();i++)
~^~~~~~~~~~~~
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
13 ms |
632 KB |
Ok! 99 queries used. |
| 2 |
Correct |
14 ms |
632 KB |
Ok! 102 queries used. |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
42 ms |
632 KB |
Ok! 537 queries used. |
| 2 |
Correct |
62 ms |
632 KB |
Ok! 672 queries used. |
| 3 |
Correct |
61 ms |
852 KB |
Ok! 666 queries used. |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
142 ms |
852 KB |
Ok! 1459 queries used. |
| 2 |
Correct |
159 ms |
852 KB |
Ok! 1637 queries used. |
| 3 |
Correct |
181 ms |
852 KB |
Ok! 1610 queries used. |
| 4 |
Correct |
195 ms |
852 KB |
Ok! 1530 queries used. |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
169 ms |
852 KB |
Ok! 1602 queries used. |
| 2 |
Correct |
150 ms |
852 KB |
Ok! 1585 queries used. |
| 3 |
Correct |
153 ms |
852 KB |
Ok! 1625 queries used. |
| 4 |
Correct |
146 ms |
852 KB |
Ok! 1496 queries used. |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
162 ms |
864 KB |
Ok! 1638 queries used. |
| 2 |
Correct |
162 ms |
864 KB |
Ok! 1627 queries used. |
| 3 |
Correct |
171 ms |
864 KB |
Ok! 1642 queries used. |
| 4 |
Correct |
179 ms |
864 KB |
Ok! 1622 queries used. |
| 5 |
Correct |
177 ms |
864 KB |
Ok! 1519 queries used. |
| 6 |
Correct |
164 ms |
864 KB |
Ok! 1558 queries used. |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
173 ms |
916 KB |
Too many queries! 1635 out of 1625 |
| 2 |
Halted |
0 ms |
0 KB |
- |
