# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
731765 | bane | Art Collections (BOI22_art) | C++17 | 1637 ms | 732 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>
using namespace std;
/**
* returns how many complaints you will receive for this ordering of the art collections
*/
int publish(std::vector<int>);
/**
* use this function when you have found the correct order of the art collections
* You must call answer exactly once; your program will be automatically
* terminated afterwards.
*/
void answer(std::vector<int>);
/**
* implement this function
*/
void solve(int n){
vector<int>ask(n);
iota(ask.begin(), ask.end(), 1);
vector<int>odg;
odg.push_back(publish(ask));
for (int _ = 1 ; _ < n; _++){
for (int j = 1 ; j < n; j++)swap(ask[j], ask[j - 1]);
odg.push_back(publish(ask));
}
vector<int>ans(n);
for (int i = 0 ; i < n; i++){
ans[(odg[i] - odg[(i + 1)%n] + n - 1) / 2] = i + 1;
}
// reverse(ans.begin(), ans.end());
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... |