# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
951237 | weakweakweak | Art Collections (BOI22_art) | C++17 | 1064 ms | 1680 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include "art.h"
#include <algorithm>
//
// --- 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
//
void solve(int N) {
std::vector<int> v, z, ans(N);
for (int i = 1; i <= N; i++) {
v.clear();
for (int j = i; j <= N; j++) v.push_back(j);
for (int j = 1; j < i; j++) v.push_back(j);
z.push_back(publish(v));
}
for (int i = 1; i <= N; i++) {
//假設i的排名為x,則當i在頭時,後面有(x-1)人生氣,當i在尾時,對n - x個人生氣。差為n-x-(x - 1) = n-2x+1 = dif,x = (n+1-dif)/2
int dif = z[i % N] - z[i - 1];
int rank = (N + 1 - dif) / 2;
ans[rank - 1] = i;
}
answer(ans);
}
Compilation message (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... |