# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
966072 | 2024-04-19T10:53:47 Z | Nahian9696 | Art Collections (BOI22_art) | C++17 | 19 ms | 344 KB |
#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 // void solve(int N) { std::vector<int> order; for(int i = 0; i < N; i++) { order.push_back(i + 1); } int inversion = publish(order); int cur = 1; while(cur < N) { int num = order[cur]; std::vector<int> new_order; new_order.push_back(order[cur]); for(int i = 0; i < cur; i++) { new_order.push_back(order[i]); } for(int i = cur + 1; i < N; i++) { new_order.push_back(order[i]); } int cnt = publish(new_order); int a = (cur + cnt - inversion) / 2; for(int i = cur; i > a; i--) { order[i] = order[i - 1]; } order[a] = num; inversion = cnt - a; } // publish(order); // order = {2, 3, 1}; // publish(order); // order = {1, 3, 2}; answer(order); }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 19 ms | 344 KB | Not correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 19 ms | 344 KB | Not correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 19 ms | 344 KB | Not correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 19 ms | 344 KB | Not correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 19 ms | 344 KB | Not correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 19 ms | 344 KB | Not correct |
2 | Halted | 0 ms | 0 KB | - |