| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1350324 | yc11 | Art Collections (BOI22_art) | C++20 | 481 ms | 500 KiB |
#include "art.h"
#include<bits/stdc++.h>
using namespace std;
void solve(int N) {
vector<int> n1;
for (int i = 0;i<N;i++) n1.push_back(i+1);
vector<int> yay;
yay.resize(N);
for (int i = 0 ;i<N;i++){
vector<int> n2= n1;
n2.erase(n2.begin()+i);
n2.insert(n2.begin(),i+1);
int x1 = publish(n2);
n2.erase(n2.begin());
n2.push_back(i+1);
int x2 = publish(n2);
int y = x1-x2;
yay[i] = (N-1+y) /2;
}
vector<int> ans;
ans.resize(N);
for (int i = 0;i<N;i++){
ans[yay[i]] = i+1;
}
answer(ans);
}| # | 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... | ||||
