| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1305788 | neonglitch | Art Collections (BOI22_art) | C++20 | 674 ms | 464 KiB |
#include "art.h"
#include <bits/stdc++.h>
using namespace std;
void solve(int n)
{
vector<int> ans(n);
vector<int> cur(n);
iota(begin(cur),end(cur),1);
int lst,ft,cr;
lst=ft=publish(cur);
for(int i=1;i<=n;i++)
{
for(int j=1;j<n;j++)swap(cur[j-1],cur[j]);
if(cur.back()==n)cr=ft;
else cr=publish(cur);
int pos=(lst-cr+n-1)/2;
ans[pos]=i;
lst=cr;
}
answer(ans);
return;
}| # | 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... | ||||
