# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
127594 |
2019-07-09T15:57:25 Z |
TadijaSebez |
ICC (CEOI16_icc) |
C++11 |
|
223 ms |
688 KB |
#include "icc.h"
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
const int N=105;
int A[N],B[N];
int Ask(vector<int> a, vector<int> b)
{
for(int i=0;i<a.size();i++) A[i]=a[i];
for(int i=0;i<b.size();i++) B[i]=b[i];
return query(a.size(),b.size(),A,B);
}
int p[N];
int Find(int x){ return p[x]==x?x:p[x]=Find(p[x]);}
void Union(int x, int y){ p[Find(x)]=Find(y);}
void init(){ for(int i=0;i<N;i++) p[i]=i;}
bool use[N];
vector<int> Reduce(vector<int> x, vector<int> y)
{
while(x.size()>1)
{
vector<int> v[2];
for(int i=0;i<x.size();i++) v[i&1].pb(x[i]);
if(Ask(v[0],y)) x=v[0];
else x=v[1];
}
return x;
}
void run(int n)
{
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
init();
for(int t=1;t<n;t++)
{
vector<int> root,v[2];
for(int i=1;i<=n;i++) if(Find(i)==i) root.pb(i);
while(1)
{
shuffle(root.begin(),root.end(),rng);
for(int i=0;i<root.size();i++) use[root[i]]=i&1;
v[0].clear();
v[1].clear();
for(int i=1;i<=n;i++) v[use[Find(i)]].pb(i);
if(Ask(v[0],v[1])) break;
}
v[0]=Reduce(v[0],v[1]);
v[1]=Reduce(v[1],v[0]);
setRoad(v[0][0],v[1][0]);
Union(v[0][0],v[1][0]);
}
}
Compilation message
icc.cpp: In function 'int Ask(std::vector<int>, std::vector<int>)':
icc.cpp:9:15: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
for(int i=0;i<a.size();i++) A[i]=a[i];
~^~~~~~~~~
icc.cpp:10:15: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
for(int i=0;i<b.size();i++) B[i]=b[i];
~^~~~~~~~~
icc.cpp: In function 'std::vector<int> Reduce(std::vector<int>, std::vector<int>)':
icc.cpp:23:16: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
for(int i=0;i<x.size();i++) v[i&1].pb(x[i]);
~^~~~~~~~~
icc.cpp: In function 'void run(int)':
icc.cpp:40:17: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
for(int i=0;i<root.size();i++) use[root[i]]=i&1;
~^~~~~~~~~~~~
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
8 ms |
504 KB |
Ok! 97 queries used. |
2 |
Correct |
8 ms |
504 KB |
Ok! 96 queries used. |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
40 ms |
632 KB |
Ok! 526 queries used. |
2 |
Correct |
62 ms |
560 KB |
Ok! 809 queries used. |
3 |
Correct |
61 ms |
504 KB |
Ok! 766 queries used. |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
151 ms |
504 KB |
Ok! 1475 queries used. |
2 |
Correct |
223 ms |
688 KB |
Ok! 2113 queries used. |
3 |
Correct |
159 ms |
568 KB |
Ok! 1617 queries used. |
4 |
Correct |
168 ms |
604 KB |
Ok! 1660 queries used. |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
167 ms |
632 KB |
Ok! 1626 queries used. |
2 |
Correct |
167 ms |
596 KB |
Ok! 1664 queries used. |
3 |
Correct |
192 ms |
560 KB |
Ok! 1880 queries used. |
4 |
Correct |
158 ms |
572 KB |
Ok! 1557 queries used. |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
193 ms |
504 KB |
Too many queries! 1868 out of 1775 |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
187 ms |
636 KB |
Too many queries! 1828 out of 1625 |
2 |
Halted |
0 ms |
0 KB |
- |