| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1350326 | yc11 | Art Collections (BOI22_art) | C++20 | 483 ms | 516 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);
vector<int> x1;
vector<int> x2;
x1.resize(N);
x2.resize(N);
int x=publish(n1);
x1[0] = x;
x2[N-1] = x;
for (int i = 1 ;i<N;i++){
n1.erase(n1.begin());
n1.push_back(i);
int x = publish(n1);
x1[i] = x;
x2[i-1]=x;
}
for (int i = 0;i<N;i++){
int y = x1[i]-x2[i];
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... | ||||
