| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1368086 | takoshanava | Art Collections (BOI22_art) | C++20 | 0 ms | 412 KiB |
#include "art.h"
#include <bits/stdc++.h>
#define pb push_back
#define fs first
#define sc second
using namespace std;
void solve(int n){
vector<int> vec;
for(int i = 1; i <= n; i++) vec.pb(i);
vector<int> c(n);
for(int i = 0; i <= n; i++){
c[i] = publish(vec);
vec.pb(vec[0]);
vec.erase(vec.begin());
}
c.pb(c[0]);
vector<int> ans(n);
for(int i = 0; i < n; i++){
int a = c[i], b = c[i + 1];
int y = (a + b - n + 1) / 2;
int x = a - y;
ans[x] = i + 1;
}
answer(ans);
}| # | Result | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Result | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Result | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Result | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Result | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Result | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
