# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
714359 | vjudge1 | Art Collections (BOI22_art) | C++17 | 1 ms | 208 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;
void solve(int n){
vector<int>v(n);
for(int i = 0;i < n;++i)v[i] = i + 1;
vector<int>num_of_upper(n + 1), num_of_lower(n + 1);
for(int i = 0;i < n;++i){
int c = publish(v);
swap(v[i], v[0]);
int cprime = publish(v);
num_of_lower[v[i]] = (n + cprime - 2 * c)/ 2;
num_of_upper[v[i]] = num_of_lower[v[i]] - cprime + c;
}
for(int i = 0;i < n;++i){
for(int j = 0;j < n;++j){
if(num_of_upper[j] == i)v[i] = j;
}
}
answer(v);
}
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... |