| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1349263 | Newtonabc | Art Collections (BOI22_art) | C++20 | 491 ms | 520 KiB |
#include "art.h"
#include<bits/stdc++.h>
using namespace std;
const int M=4e3+10;
int p[M],ret[M];
void solve(int N) {
vector<int> v;
for(int i=1;i<=N;i++) v.push_back(i);
for(int i=1;i<=N;i++){
p[i]=publish(v);
rotate(v.begin(),v.begin()+1,v.end());
}
for(int i=1;i<=N;i++){
int l=i;
int r=(i+1)%N;
if(r==0) r=N;
int cal=(p[l]-p[r]+N-1)/2;
ret[cal+1]=i;
}
vector<int> r;
for(int i=1;i<=N;i++) r.push_back(ret[i]);
answer(r);
}
| # | 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... | ||||
