# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1171584 | AlgorithmWarrior | Art Collections (BOI22_art) | C++20 | 785 ms | 524 KiB |
#include <bits/stdc++.h>
#include "art.h"
using namespace std;
vector<int>get_ord(queue<int>q){
vector<int>ans;
while(!q.empty()){
ans.push_back(q.front());
q.pop();
}
return ans;
}
void solve(int N){
queue<int>q;
int i;
for(i=1;i<=N;++i)
q.push(i);
int last=0;
vector<int>ans(N,0);
for(i=0;i<N;++i){
vector<int>order=get_ord(q);
int rez=publish(order);
if(i){
int delta=rez-last;
int pos=(N-1-delta)/2;
ans[pos]=i;
}
last=rez;
# | 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... |