# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
584333 | alireza_kaviani | Art Collections (BOI22_art) | C++17 | 1701 ms | 620 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;
#define SZ(x) int((x).size())
const int MAXN = 4010;
int n , tot , inv[MAXN];
int query(int x){
vector<int> vec = {x};
for(int i = 1 ; i <= n ; i++){
if(i != x){
vec.push_back(i);
}
}
return publish(vec);
}
void solve(int N) {
n = N;
tot = query(1);
for(int i = 2 ; i <= n ; i++){
inv[i] = (tot - query(i) + i - 1) / 2;
}
vector<int> res;
for(int i = 1 ; i <= n ; i++){
res.push_back(i);
for(int j = 0 ; j < inv[i] ; j++){
swap(res[SZ(res) - j - 1] , res[SZ(res) - j - 2]);
}
}
answer(res);
}
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... |