# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
892543 | vjudge1 | Super Dango Maker (JOI22_dango3) | C++17 | 0 ms | 0 KiB |
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 "dango3.h"
#include <bits/stdc++.h>
using namespace std;
int Query(vector <int> x){
for(auto i : x)cout<<i<<" ";
int res;cin>>res;
return res;
}
void Answer(vector <int> x){
for(auto i : x)cout<<i<<" ";
cout<<"\n";
}
void Solve(int n,int m){
queue < pair < vector <int> ,int > > q;
vector <int> in;
vector <vector <int> > ans;
for(int i=1;i<=n*m;i++){
in.push_back(i);
}
q.push({in,m});
while(!q.empty()){
vector <int> v=q.front().first;
int k=q.front().second;
q.pop();
if(k<=1){
ans.push_back(v);
}
else{
vector <int> used(v.size());
for(int i=0;i<v.size();i++){
used[i]=1;
vector <int> x;
for(int j=0;j<v.size();j++){
if(used[j]==0)x.push_back(v[j]);
}
if(Query(x)<k/2)used[i]=0;
}
vector <int> g1,g2;
for(int i=0;i<v.size();i++){
if(used[i]==0)g1.push_back(v[i]);
else g2.push_back(v[i]);
}
q.push({g1,k/2});
if(k%2==1)q.push({g2,k/2+1});
else q.push({g2,k/2});
}
}
for(auto x : ans){
Answer(x);
}
return;
}
int main(){
int n,m;
cin>>n>>m;
Solve(n,m);
}