# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1034763 | happy_node | Art Collections (BOI22_art) | C++17 | 1292 ms | 1960 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 "art.h"
//
// --- Sample implementation for the task art ---
//
// To compile this program with the sample grader, place:
// art.h art_sample.cpp sample_grader.cpp
// in a single folder, then open the terminal in this directory (right-click onto an empty spot in the directory,
// left click on "Open in terminal") and enter e.g.:
// g++ -std=c++17 art_sample.cpp sample_grader.cpp
// in this folder. This will create a file a.out in the current directory which you can execute from the terminal
// as ./a.out
// See task statement or sample_grader.cpp for the input specification
//
#include <bits/stdc++.h>
using namespace std;
int ask(deque<int> dq) {
vector<int> v;
for(auto x:dq) v.push_back(x);
return publish(v);
}
void solve(int N) {
vector<int> P(N);
deque<int> dq;
for(int i=1;i<=N;i++) dq.push_back(i);
int x=ask(dq);
while(dq.back()!=1) {
int b=dq.back();
dq.pop_back();
dq.push_front(b);
int y=ask(dq);
int p=y-x;
int q=N-1;
int z=(p+q)/2;
P[z]=b;
x=y;
}
for(int i=0;i<N;i++)
if(!P[i]) P[i]=1;
answer(P);
}
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... |