# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
902568 | 2024-01-10T18:10:33 Z | gogopro | Art Collections (BOI22_art) | C++17 | 21 ms | 352 KB |
#include <algorithm> #include <iostream> #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) { using namespace std; vector<int> order; order.reserve(N); for (int i = 0; i < N; ++i) { order.push_back(i + 1); } int current_idx = 0; int complaints = publish(order); while (complaints != 0) { swap(order[current_idx], order[current_idx + 1]); int new_complaints = publish(order); if (new_complaints > complaints) swap(order[current_idx], order[current_idx + 1]); // return to back ++current_idx; complaints = new_complaints; if (current_idx == order.size() - 1) current_idx = 0; } answer(order); }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 344 KB | Output is correct |
2 | Correct | 1 ms | 352 KB | Output is correct |
3 | Incorrect | 21 ms | 344 KB | Not correct |
4 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 344 KB | Output is correct |
2 | Correct | 1 ms | 352 KB | Output is correct |
3 | Incorrect | 21 ms | 344 KB | Not correct |
4 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 344 KB | Output is correct |
2 | Correct | 1 ms | 352 KB | Output is correct |
3 | Incorrect | 21 ms | 344 KB | Not correct |
4 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 344 KB | Output is correct |
2 | Correct | 1 ms | 352 KB | Output is correct |
3 | Incorrect | 21 ms | 344 KB | Not correct |
4 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 344 KB | Output is correct |
2 | Correct | 1 ms | 352 KB | Output is correct |
3 | Incorrect | 21 ms | 344 KB | Not correct |
4 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 344 KB | Output is correct |
2 | Correct | 1 ms | 352 KB | Output is correct |
3 | Incorrect | 21 ms | 344 KB | Not correct |
4 | Halted | 0 ms | 0 KB | - |