# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
590016 | drkarlicio2107 | Art Collections (BOI22_art) | C++17 | 1644 ms | 660 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>
#include "art.h"
using namespace std; vector <int> L; vector <int> ans;
/*int publish ( vector <int> R){
for (int i=0; i<R.size(); i++) cout << R [i] << " ";
cout << endl;
int re; cin >> re;
return re;
}
void answer ( vector <int> R){
for (int i=0; i<R.size(); i++) cout << R [i] << " ";
cout << endl;
return ;
}*/
int pos [5000];
void solve (int N){
int last=-1;
for (int i=N+1; i>1; i--){
L.clear ();
for (int j=i; j<N+1; j++) L.push_back (j);
for (int j=1; j<i; j++) L.push_back (j);
int ans=publish (L);
if (last==-1){
last=ans; continue;
}
pos [(N-1+ans-last)/2]=i; last=ans;
}
for (int i=0; i<N; i++){
if (pos [i]==0) ans.push_back (1);
else ans.push_back (pos [i]);
}
answer (ans);
return ;
}
/*int main (){
int n; cin >> n;
solve (n);
return 0;
}*/
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... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |