| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 908844 | vjudge1 | Pinball (JOI14_pinball) | C++17 | 1 ms | 344 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<bits/stdc++.h>
#define endl '\n'
#define mp make_pair
#define pb push_back
#define all(x) x.begin(),x.end()
#define f first
#define s second
#define fore(i,l,r) for(int i = l; i < r;i++)
#define fo(i,n) fore(i,0,n)
#define ll long long
#define ii pair<int,int>
using namespace std;
using vi = vector<int>;
vector<int> arr;
map<int,int> idx;
int cnt = 1;
int main() {
int n;
cin >> n;arr.pb(1);idx[1]=1;
fore(i,2 ,n+1){
cout << i << " ";cout.flush();
fo(j,i){
cout << j+1 << " ";cout.flush();
}
// cout << endl; cout.flush();
int a; cin>>a;
if(a == cnt+1){
idx[cnt+1]=i;cnt++;arr.pb(cnt);
}else{
int l = 1, r= cnt;
while(l<=r){
int mid = (l+r)/2;
int posmid = (idx[mid]);
int k = (posmid-idx[l]+1);
cout << k+1 << " ";cout.flush();
set<int> howman;
fo(li,k){
cout << li+idx[l] << " ";cout.flush();
howman.insert(arr[li+idx[l]-1]);
}
cout << i<<" ";cout.flush();
// cout << endl; cout.flush();
int cn;cin >> cn;
if(cn==howman.size())r=mid-1;
else l = mid+1;
}
arr.pb(l);
}
}
cout << 0 << " ";cout.flush();
fo(i,n){
cout << arr[i] << " ";cout.flush();
}
}Compilation message (stderr)
| # | 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... | ||||
