Submission #52204

#TimeUsernameProblemLanguageResultExecution timeMemory
52204tmwilliamlin168ICC (CEOI16_icc)C++14
0 / 100
8 ms636 KiB
#include <icc.h> #include <bits/stdc++.h> using namespace std; const int mxN=100; int p[mxN], cci; bool vis[mxN]; vector<int> adj[mxN], ccs[mxN], qa[2]; void dfs(int u) { vis[u]=1; ccs[cci].push_back(u); for(int v : adj[u]) if(!vis[v]) dfs(v); } void run(int n) { for(int i=0; i<n; ++i) p[i]=i; random_shuffle(p, p+n); for(int it=0; it<n-1; ++it) { for(int i=0; i<n; ++i) { if(!vis[p[i]]) { dfs(p[i]); ++cci; } } for(int i=0; ; ++i) { qa[0].clear(); qa[1].clear(); for(int j=0; j<cci; ++j) for(int u : ccs[cci]) qa[j>>i&1].push_back(u+1); int qr=query(qa[0].size(), qa[1].size(), qa[0].data(), qa[1].data()); if(!qr) continue; for(int j=0; j<2; ++j) { while(qa[j].size()>1) { qr=query(qa[j].size()/2, qa[j^1].size(), qa[j].data(), qa[j^1].data()); if(qr) qa[j].erase(qa[j].begin()+qa[j].size()/2, qa[j].end()); else qa[j].erase(qa[j].begin(), qa[j].begin()+qa[j].size()/2); } } int u=qa[0][0], v=qa[0][1]; setRoad(u, v); adj[u-1].push_back(v-1); adj[v-1].push_back(u-1); break; } memset(vis, 0, n); while(cci) ccs[--cci].clear(); } }
#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...