# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1006910 | andecaandeci | Art Collections (BOI22_art) | C++17 | 1197 ms | 1400 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 fir first
# define sec second
# define pb push_back
void solve(int N) {
vector<int> order;
for(int i = 1; i<=N; i++) order.pb(i);
int inv[N+5];
for(int i = 1; i<=N; i++) {
// for(auto v: order) cerr << v << " "; cerr << endl;
inv[i] = publish(order);
order.pb(*order.begin());
order.erase(order.begin());
}
inv[N+1] = inv[1];
inv[0] = inv[N];
pair<int, int> dif[N+5];
for(int i = 1; i<=N; i++) dif[i] = {inv[i+1]-inv[i], i};
sort(dif+1, dif+N+1);
vector<int> ans(N);
for(int i = 1; i<=N; i++) {
ans[N-i] = dif[i].sec;
}
answer(ans);
}
// signed main() {
// solve(5);
// }
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... |