Submission #116664

#TimeUsernameProblemLanguageResultExecution timeMemory
116664ioilolcomCarnival (CEOI14_carnival)C++14
20 / 100
118 ms1096 KiB
#include <bits/stdc++.h> using namespace std; #define endl "\n" typedef long long int ll; const int N=156; set<int> adj[N]; int cnt=1; bool vis[N]; int c[N]; void dfs(int u){ if(vis[u]) return; c[u]=cnt; vis[u]=1; for(int v:adj[u]) { dfs(v); } } int main() { // ios_base:: sync_with_stdio(false); cin.tie(0); int n; cin>>n; for(int i=1; i<=n; i++) { for(int j=i+1; j<=n; j++) { if(adj[i].count(j)) { continue; } cout<<2<<" "; cout<<i<<" "<<j<<endl; fflush(stdout); int t; cin>>t; if(t==1) { adj[i].insert(j); adj[j].insert(i); } } } for(int i=1; i<=n; i++) { if(!vis[i]) { dfs(i); cnt++; } } cout<<"0 "; for(int i=1; i<=n; i++) { cout<<c[i]<<" "; } return 0; }
#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...