# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
595388 | Deepesson | Art Collections (BOI22_art) | C++17 | 782 ms | 544 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>
/**
* 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);
int padrao=0;
int _N;
bool compara(int a,int b){
std::vector<int> order;
for(int i=0;i!=_N;++i)order.push_back(i+1);
bool kek=false,trava=false;
for(auto&x:order){
if(a==x){
x=b;
}else if(x==b){
x=a;
}
}
int x = publish(order);
if(a>b){
return x<padrao;
}else return x>padrao;
}
void solve(int N) {
_N=N;
std::vector<int> order;
for(int i=0;i!=N;++i)order.push_back(i+1);
padrao=publish(order);
std::stable_sort(order.begin(),order.end(),compara);
answer(order);
}
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... |