# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
1020680 | overwatch9 | Art Collections (BOI22_art) | C++17 | 0 ms | 344 KiB |
이 제출은 이전 버전의 oj.uz에서 채점하였습니다. 현재는 제출 당시와는 다른 서버에서 채점을 하기 때문에, 다시 제출하면 결과가 달라질 수도 있습니다.
#include "art.h"
//
// --- Sample implementation for the task art ---
//
// To compile this program with the sample grader, place:
// art.h art_sample.cpp sample_grader.cpp
// in a single folder, then open the terminal in this directory (right-click onto an empty spot in the directory,
// left click on "Open in terminal") and enter e.g.:
// g++ -std=c++17 art_sample.cpp sample_grader.cpp
// in this folder. This will create a file a.out in the current directory which you can execute from the terminal
// as ./a.out
// See task statement or sample_grader.cpp for the input specification
//
#include <bits/stdc++.h>
using namespace std;
int n;
void solve(int N) {
n = N;
vector <int> order(n);
vector <int> res(n);
for (int i = 0; i < n; i++)
order[i] = i+1;
for (int i = 0; i < n; i++) {
res[i] = publish(order);
int lst = order[n-1];
for (int j = n-1; j > 0; j--)
order[j] = order[(j-1) % n];
order[0] = lst;
}
vector <int> ans(n);
set <int> left;
for (int i = 1; i <= n; i++)
left.insert(i);
for (int i = 1; i < n; i++) {
int diff = res[i] - res[i-1];
int x = (n-1-diff) / 2;
ans[x] = n - (i - 1);
left.erase(x);
}
ans[*left.begin()] = 1;
reverse(ans.begin(), ans.end());
answer(ans);
}
컴파일 시 표준 에러 (stderr) 메시지
# | 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... |