This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#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";
}
}
// 1 2 1 3 2
if(sz(sett)==n)break;
}
cout<<"0 ";
for(ll i = 1; i <= n; i++)cout<<ans[i]<<" ";
cout<<endl;
return 0;
// 1 3 1
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |