# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1101652 | mariaclara | Art Collections (BOI22_art) | C++17 | 1121 ms | 1760 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"
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
#define all(x) x.begin(), x.end()
#define sz(x) (int)x.size()
#define mk make_pair
#define pb push_back
#define fr first
#define sc second
void solve(int N) {
vector<int> order;
vector<int> ans(N);
for(int i = 1; i <= N; i++) order.pb(i);
int now, last;
last = publish(order);
for(int i = 1; i < N; i++) {
order.erase(order.begin());
order.pb(i);
now = publish(order);
ans[(last-now+N-1)/2] = i;
last = now;
}
for(int i = 0; i < N; i++) if(ans[i] == 0) ans[i] = N;
answer(ans);
}
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... |