| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1351916 | khome | Art Collections (BOI22_art) | C++20 | 487 ms | 488 KiB |
#include <bits/stdc++.h>
#include "art.h"
// #define int long long
#define endl '\n'
using namespace std;
void solve(int n){
vector<int> order(n);
vector<int> ans(n);
vector<int> cur(n);
for (int i = 1; i <= n; i ++) order[i-1] = i;
for (int j = 0; j < n; j++){
cur[j] = publish(order);
rotate(order.begin(), order.begin()+1, order.end());
}
for (int i = 0; i < n; i++) {
int xy = cur[(i+1)%n];
int xz = cur[i];
int x = (xy+xz-n+1)/2;
int z = xz-x;
ans[z] = 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... | ||||
