# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1002018 | Andrey | Art Collections (BOI22_art) | C++17 | 878 ms | 2072 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;
void solve(int n) {
vector<int> haha(n);
for(int i = 1; i <= n; i++) {
haha[i-1] = i;
}
int br = publish(haha);
for(int i = 1; i < n; i++) {
vector<int> bruh(n);
for(int j = 0; j < n; j++) {
bruh[j] = haha[j];
}
for(int j = i; j > 0; j--) {
swap(bruh[j],bruh[j-1]);
}
int x = publish(bruh);
int p = (i+x-br)/2;
for(int j = i; j > p; j--) {
swap(haha[j],haha[j-1]);
}
br = x-p;
}
answer(haha);
}
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... |