| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 721852 | The_Samurai | Art Collections (BOI22_art) | C++17 | 0 ms | 0 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.
/*
SAMPLE GRADER for task ART
USAGE:
place together with your solution and art.h in the same directory, then open the terminal in this directory
(right-click onto an empty spot in the directory, left click on "Open in terminal") and enter:
g++ <flags> sample_grader.cpp <solution_file>
e.g.:
g++ -std=c++17 sample_grader.cpp art.cpp
This will create a file a.out in the current directory which you can execute from the terminal as ./a.out
INPUT/OUTPUT:
The sample grader first expects on standard input two lines. The first line should
contain the integer N. The second line should contain a list of N space-separated
integers, the correct ranking of the collections in the same format as for publish
and answer. Then, the grader calls solve(N) and writes to standard output a protocol
of all grader functions called by your program. Upon termination, it writes your
verdict to standard output.
*/
#include "bits/stdc++.h"
#include "art.h"
using namespace std;
void __attribute__((noreturn)) __attribute__((format(printf, 1, 2))) result(const char *msg, ...) {
va_list args;
va_start(args, msg);
vfprintf(stdout, msg, args);
fprintf(stdout, "\n");
va_end(args);
exit(0);
}
namespace {
int N;
int Q = 0;
const int MAX_Q = 4000;
const int MAX_N = 4000;
vector<int> solution;
} // namespace
int publish(vector<int> R) {
printf("publish({");
for(int i = 0; i < int(R.size()); ++i) {
if(i == 0)
printf("%d", R[i]);
else
printf(", %d", R[i]);
}
printf("})\n");
fflush(stdout);
if (++Q > MAX_Q)
result("Too many published rankings!");
if (int(R.size()) != N)
result("Invalid published ranking!");
set<int> chosen;
for(auto &x : R) {
if(x < 1 || x > N || chosen.count(x))
result("Invalid published ranking!");
chosen.insert(x);
}
vector<int> positions(N+1);
for(int i = 0; i < N; ++i)
positions[R[i]] = i;
int complaints = 0;
for(int i = 0; i < N; ++i) {
for(int j = i+1; j < N; ++j) {
if(positions[solution[i]] > positions[solution[j]])
++complaints;
}
}
return complaints;
}
void __attribute__((noreturn)) answer(vector<int> R) {
printf("answer({");
for(int i = 0; i < int(R.size()); ++i) {
if(i == 0)
printf("%d", R[i]);
else
printf(", %d", R[i]);
}
printf("})\n");
fflush(stdout);
if(R == solution)
result("Correct: %d published ranking(s).", Q);
else
result("Wrong answer!");
}
int main() {
srand(time(0));
if (scanf("%d", &N) != 1 || N < 2 || N > MAX_N)
result("Invalid input!");
solution.resize(N);
// solution = {5, 8, 4, 2, 7, 3, 6, 1};
iota(solution.begin(), solution.end(), 1);
random_shuffle(solution.begin(), solution.end());
for (int &x: solution) cout << x << ' ';
cout << '\n';
solve(N);
result("No answer!");
}