| # |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
| 152009 |
2019-09-05T21:03:00 Z |
MvC |
ICC (CEOI16_icc) |
C++11 |
|
164 ms |
760 KB |
#pragma GCC target("avx2")
#pragma GCC optimization("O3")
#pragma GCC optimization("unroll-loops")
#include<bits/stdc++.h>
#include "icc.h"
#define rc(x) return cout<<x<<endl,0
#define pb push_back
#define mkp make_pair
#define in insert
#define er erase
#define fd find
#define fr first
#define sc second
typedef long long ll;
typedef long double ld;
const ll INF=0x3f3f3f3f3f3f3f3f;
const ll llinf=(1LL<<61);
const int inf=(1<<30);
const int nmax=1e2+50;
const int mod=1e9+7;
using namespace std;
int n,i,sa,sb,aa[nmax],ab[nmax],j,edd,va[nmax],m,b;
vector<int>a[nmax],vc,rad;
vector<vector<int> >cc;
bitset<nmax>viz;
int qry(int sa,int sb,int aa[],int ab[])
{
return query(sa,sb,aa,ab);
cout<<"?"<<endl;
for(int i=0;i<sa;i++)cout<<aa[i]<<" ";
cout<<endl;
for(int i=0;i<sb;i++)cout<<ab[i]<<" ";
cout<<endl;
int x;
cin>>x;
return x;
}
/*void setRoad(int x,int y)
{
cout<<"! "<<x<<" "<<y<<endl;
}*/
void dfs(int x)
{
viz[x]=1;
vc.pb(x);
for(int i=0;i<a[x].size();i++)
{
int y=a[x][i];
if(viz[y])continue;
dfs(y);
}
}
void dc(int l,int r,int ar[],int lb,int st[])
{
if(l==r)
{
vc.pb(ar[l]);
return;
}
int mid=(l+r)/2;
int xa=0;
for(int i=l;i<=mid;i++)va[xa++]=ar[i];
if(qry(xa,lb,va,st))dc(l,mid,ar,lb,st);
else dc(mid+1,r,ar,lb,st);
}
void run(int N)
{
srand(time(0));
n=N;
for(edd=1;edd<n;edd++)
{
viz.reset();
cc.clear();
for(i=1;i<=n;i++)
{
if(viz[i])continue;
vc.clear();
dfs(i);
cc.pb(vc);
}
rad.clear();
for(i=0;;i++)
{
if((1<<i)>=cc.size())break;
rad.pb(i);
}
//random_shuffle(rad.begin(),rad.end());
for(b=0;b<rad.size();b++)
{
sa=sb=0;
for(i=0;i<cc.size();i++)
{
if(i&(1<<rad[b]))
{
for(j=0;j<cc[i].size();j++)aa[sa++]=cc[i][j];
}
else
{
for(j=0;j<cc[i].size();j++)ab[sb++]=cc[i][j];
}
}
if(qry(sa,sb,aa,ab))break;
}
vc.clear();
dc(0,sa-1,aa,sb,ab);
dc(0,sb-1,ab,sa,aa);
setRoad(vc[0],vc[1]);
a[vc[0]].pb(vc[1]);
a[vc[1]].pb(vc[0]);
}
}
/*int main()
{
//freopen("sol.in","r",stdin);
//freopen("sol.out","w",stdout);
//mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
ios_base::sync_with_stdio(false);cin.tie(0);cerr.tie(0);cout.tie(0);
int z;
cin>>z;
run(z);
return 0;
}*/
Compilation message
icc.cpp:2:0: warning: ignoring #pragma GCC optimization [-Wunknown-pragmas]
#pragma GCC optimization("O3")
icc.cpp:3:0: warning: ignoring #pragma GCC optimization [-Wunknown-pragmas]
#pragma GCC optimization("unroll-loops")
icc.cpp: In function 'void dfs(int)':
icc.cpp:46:15: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
for(int i=0;i<a[x].size();i++)
~^~~~~~~~~~~~
icc.cpp: In function 'void run(int)':
icc.cpp:84:13: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
if((1<<i)>=cc.size())break;
~~~~~~^~~~~~~~~~~
icc.cpp:88:12: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
for(b=0;b<rad.size();b++)
~^~~~~~~~~~~
icc.cpp:91:13: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
for(i=0;i<cc.size();i++)
~^~~~~~~~~~
icc.cpp:95:15: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
for(j=0;j<cc[i].size();j++)aa[sa++]=cc[i][j];
~^~~~~~~~~~~~~
icc.cpp:99:15: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
for(j=0;j<cc[i].size();j++)ab[sb++]=cc[i][j];
~^~~~~~~~~~~~~
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
8 ms |
504 KB |
Ok! 95 queries used. |
| 2 |
Correct |
8 ms |
504 KB |
Ok! 95 queries used. |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
41 ms |
504 KB |
Ok! 532 queries used. |
| 2 |
Correct |
51 ms |
760 KB |
Ok! 646 queries used. |
| 3 |
Correct |
48 ms |
596 KB |
Ok! 623 queries used. |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
139 ms |
564 KB |
Ok! 1426 queries used. |
| 2 |
Correct |
164 ms |
632 KB |
Ok! 1593 queries used. |
| 3 |
Correct |
158 ms |
600 KB |
Ok! 1593 queries used. |
| 4 |
Correct |
149 ms |
600 KB |
Ok! 1457 queries used. |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
139 ms |
564 KB |
Ok! 1407 queries used. |
| 2 |
Correct |
146 ms |
552 KB |
Ok! 1494 queries used. |
| 3 |
Correct |
160 ms |
504 KB |
Ok! 1575 queries used. |
| 4 |
Correct |
148 ms |
632 KB |
Ok! 1507 queries used. |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
163 ms |
564 KB |
Ok! 1566 queries used. |
| 2 |
Correct |
154 ms |
504 KB |
Ok! 1515 queries used. |
| 3 |
Correct |
161 ms |
504 KB |
Ok! 1573 queries used. |
| 4 |
Correct |
156 ms |
560 KB |
Ok! 1525 queries used. |
| 5 |
Correct |
141 ms |
504 KB |
Ok! 1431 queries used. |
| 6 |
Correct |
147 ms |
504 KB |
Ok! 1478 queries used. |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
155 ms |
564 KB |
Ok! 1538 queries used. |
| 2 |
Correct |
162 ms |
636 KB |
Ok! 1588 queries used. |
