Submission #908197

#TimeUsernameProblemLanguageResultExecution timeMemory
90819712345678Carnival (CEOI14_carnival)C++17
20 / 100
52 ms1548 KiB
#include <bits/stdc++.h> using namespace std; const int nx=155; int n, res, cnt, vs[nx], ans[nx]; vector<int> d[nx]; int query(vector<int> v) { cout<<v.size()<<' '; for (auto x:v) cout<<x<<' '; cout<<endl; cin>>res; return res; } void dfs(int u, int p) { vs[u]=1; ans[u]=cnt; for (auto v:d[u]) if (v!=p&&!vs[v]) dfs(v, u); } int main() { cin.tie(NULL)->sync_with_stdio(false); cin>>n; for (int i=1; i<=n; i++) for (int j=i+1; j<=n; j++) if (query(vector<int> {i, j})==1) d[i].push_back(j), d[j].push_back(i); for (int i=1; i<=n; i++) if (!vs[i]) cnt++, dfs(i, i); cout<<0<<' '; for (int i=1; i<=n; i++) cout<<ans[i]<<' '; cout<<endl; 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...