Submission #130737

#TimeUsernameProblemLanguageResultExecution timeMemory
130737semiautoICC (CEOI16_icc)C++14
0 / 100
4 ms504 KiB
#include <bits/stdc++.h> #include "icc.h" using namespace std; int i,j,k,sa,sb,l,r,m,x; int parent[101],mas[101],a[101],b[101]; bool fix[101]; void run(int n) { for (i=1;i<=n;i++) parent[i]=i; for (j=1;j<n;j++) { for (i=1;i<=n;i++) fix[i]=0; for (i=1;i<=n;i++) fix[parent[i]]=1; k=0; for (i=1;i<=n;i++) if (fix[i]) mas[++k]=i; while (true) { for (i=1;i<=n;i++) fix[i]=0; for (i=1;i<=(k/2);) if (!fix[mas[(rand()%k)+1]]) { fix[mas[(rand()%k)+1]]=1; i++; } sa=sb=0; for (i=1;i<=n;i++) a[i]=b[i]=0; for (i=1;i<=n;i++) { if (fix[parent[i]]) a[sa++]=i; else b[sb++]=i; } if (query(sa,sb,a,b)) break; } return; l=1;r=sa; while (l!=r) { m=(l+r)/2; for (i=1;i<=n;i++) mas[i]=0; for (i=l;i<=m;i++) mas[i-l+1]=a[i]; if (query(m-l+1,sb,mas,b)) r=m; else l=m+1; } x=l; l=1;r=sb; while (l!=r) { m=(l+r)/2; for (i=1;i<=n;i++) mas[i]=0; for (i=l;i<=m;i++) mas[i-l+1]=b[i]; if (query(sa,m-l+1,a,mas)) r=m; else l=m+1; } for (i=1;i<=n;i++) if (parent[i]==parent[a[x]]) parent[i]=parent[b[l]]; setRoad(a[x],b[l]); } return; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...