Submission #574785

#TimeUsernameProblemLanguageResultExecution timeMemory
574785MajidCarnival (CEOI14_carnival)C++17
0 / 100
162 ms284 KiB
#include<bits/stdc++.h> using namespace std; using ll = long long; using db = double; #define pb push_back #define sz(vec) ((ll)vec.size()) #define all(vec) vec.begin(), vec.end() #define f first #define s second const int MOD = 1e9 + 7; const ll BIGINF = ((ll)1e18) + 7; #define Speeed ios::sync_with_stdio(0);cin.tie(NULL); cout.tie(NULL); int main(){ ll n, col = 1; cin>>n; vector<ll> ans(n+1); set<ll> sett; for(ll i = (1<<n) - 1; i >= 0; i--){ vector<ll> temp; for(ll j = 0; j < n; j++){ if(i&(1<<j)){ temp.pb(j+1); } } if(sz(temp)){ cout<<sz(temp)<<" "; for(auto x: temp)cout<<x<<" "; cout<<endl; ll x; cin>>x; if(x==1){ bool cont = true; for(auto x: temp){ if(sett.find(x)!=sett.end())cont = false; } if(cont){ // cout<<"NAH\n"; for(auto x: temp){ sett.insert(x); ans[x] = col; } col++; } // cout<<"all same\n"; } } } cout<<"0 "; for(ll i = 1; i <= n; i++)cout<<ans[i]<<" "; cout<<endl; return 0; // 1 3 1 }
#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...