| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1335260 | nguyenkhangninh99 | Art Collections (BOI22_art) | C++20 | 676 ms | 484 KiB |
#include <bits/stdc++.h>
#include "art.h"
using namespace std;
void solve(int n){
vector<int> order;
for(int i = 1; i <= n; i++) order.push_back(i);
vector<int> val(n);
for(int i = 0; i < n; i++){
val[i] = publish(order);
reverse(order.begin() + 1, order.end());
reverse(order.begin(), order.end());
}
vector<int> ans(n);
for(int i = 0; i < n; i++) ans[(n - 1 + (val[i] - val[(i + 1) % n])) / 2] = 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... | ||||
