| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1172258 | sasde | Art Collections (BOI22_art) | C++20 | 771 ms | 516 KiB |
#include<bits/stdc++.h>
#include "art.h"
#define emb emplace_back
using namespace std;
void solve(int N){
int n=N;
vector<int>ans(n),ans1;
for(int i=0;i<n;++i){
vector<int>l;
for(int j=0;j<n;++j){
l.emb((j+i)%n+1);
}
ans1.emb(publish(l));
}
for(int i=0;i<n;++i){
int res=(ans1[i]-ans1[(i+1)%n]+n-1)/2+1;
ans[res-1]=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... | ||||
