# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
993604 | MarwenElarbi | Art Collections (BOI22_art) | C++17 | 1200 ms | 1856 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;
#define fi first
#define se second
#define ll long long
#define pb push_back
const int nax=3e5+5;
void solve(int N){
int n=N;
vector<int> tab(n,-1);
int x=-1;
deque<int> dq;
for (int i = 0; i < n; ++i)
{
dq.push_back(i+1);
}
int ans=-1;
for (int i = 0; i < N; ++i)
{
vector<int> cur;
for (int j = 0; j < N; ++j)
{
cur.pb(dq[j]);
}
int x=dq.back();
dq.pop_back();
dq.push_front(x);
int a=publish(cur);
if(ans==-1){
ans=a;
continue;
}
tab[(n-1+a-ans)/2]=n-i+1;
ans=a;
}
for (int i = 0; i < n; ++i)
{
if(tab[i]==-1) tab[i]=1;
}
answer(tab);
}
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... |