| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1222511 | boclobanchat | Art Collections (BOI22_art) | C++20 | 0 ms | 408 KiB |
#include"art.h"
#include<bits/stdc++.h>
using namespace std;
void solve(int N)
{
vector<int> vi(N),ans(N);
for(int i=1;i<=N;i++) vi[i-1]=i;
int inv=publish(vi);
ans[0]=1;
for(int i=2;i<=N;i++)
{
vector<int> vj;
vj.push_back(i);
for(int j=1;j<=N;j++) if(j!=i) vj.push_back(j);
int inw=publish(vj),k=(inw-inv+i-1)/2+1;
ans[i-1]=k;
for(int j=0;j<i-1;j++) if(ans[j]>=k) ans[j]++;
}
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... | ||||
