Submission #1220200

#TimeUsernameProblemLanguageResultExecution timeMemory
1220200lizi14Carnival (CEOI14_carnival)C++20
84 / 100
9 ms424 KiB
#include <bits/stdc++.h> using namespace std; int main(){ int n; cin>>n; int a[n+1]; cout<<n<<" "; for(int i=1; i<=n; i++){ a[i]=i; cout<<i<<" "; } cout<<endl; int yayay; cin>>yayay; vector<int>v[yayay+3]; int m=1,h=1,g=1; v[1].push_back(1); map<int,int>mp; mp[1]=1; while(m<n){ m++; cout<<m<<" "; for(int i=1; i<=m; i++){ cout<<i<<" "; } cout<<endl; int k; cin>>k; if(k==h+1){ h++; g++; mp[m]=g; v[g].push_back(m); } else{ for(int i=1; i<m; i++){ cout<<2<<" "; cout<<i<<" "<<m<<endl; int y; cin>>y; if(y==1){ mp[m]=mp[i]; v[mp[m]].push_back(m); break; } } } } cout<<0<<" "; for(int i=1; i<=m; i++){ int ha=0; for(int j=1; j<=yayay+1; j++){ auto it=find(v[j].begin(),v[j].end(),i); if(it!=v[j].end()){ cout<<j<<" "; break; } } } cout<<endl; }
#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...