| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1192210 | rainmar | Art Collections (BOI22_art) | C++20 | 760 ms | 488 KiB |
#include "art.h"
#include <bits/stdc++.h>
using namespace std;
void solve(int N) {
vector<int> initial;
for(int i = 1; i <= N; i++) {
initial.push_back(i);
}
vector<int> skoor(N);
int init = publish(initial);
for(int i = 0; i < N-1; i++) {
initial.push_back(initial.front());
initial.erase(initial.begin());
int news = publish(initial);
skoor[(news-init+N-1)/2] = i+1;
swap(news,init);
}
for(int i = 0; i < skoor.size(); i++) if(skoor[i] == 0) skoor[i] = N;
reverse(skoor.begin(),skoor.end());
answer(skoor);
}
/*
int main() {
solve(5);
}
*/
// 5 4 3 2 1| # | 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... | ||||
