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, old = 0;
cin>>n;
vector<ll> ans(n+1);
// map<ll, bool> newcol;
// set<ll> sett;
vector<ll> newcol;
for(ll i = 1; i <= n; i++){
cout<<i<<" ";
for(ll j = 1; j <= i; j++){
cout<<j<<" ";
}
cout<<endl;
ll x;
cin>>x;
if(x!=old){
ans[i] = col;
col++;
newcol.pb(i);
}
old = x;
}
for(ll i = 1; i <= n; i++){
if(ans[i])continue;
for(auto y: newcol){
if(y >= i)break;
cout<<"2 "<<y<<" "<<i<<endl;
ll x;
cin>>x;
if(x==1){
ans[i] = ans[y];
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... |