| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1094657 | ohad | 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.
#include "art.h"
#include <vector>
#include <iostream>
//
// --- 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) {
vector<int> order;
for (int i = 0; i < n; i++)
{
order.push_back(i + 1);
}
int medium = publish(order);
vector<int> solution(n, 0);
for (int i = n; i >= 2; i--)
{
order[0] = i;
for (int j = 1; j < i; j++)
{
order[j] = j;
}
for (int k = i; k < n; k++)
{
order[k] = k + 1;
}
int newans = publish(order);
int place = (-newans + medium + n - 1) / 2;
medium -= place;
solution[place] = i;
}
for (int i = 0; i < n; i++)
{
if (solution[i] == 0)
solution[i] = 1;
}
answer(solution);
}