# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
714979 | vjudge1 | Art Collections (BOI22_art) | C++17 | 1622 ms | 704 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<bits/stdc++.h>
using namespace std;
// g++ -std=c++17 art_sample.cpp sample_grader.cpp
int n;
int f_p(int a){
vector<int> order;
for (int i = 1; i <= n; i++)
{
if(i == a) continue;
order.push_back(i);
}
order.push_back(a);
return publish(order);
}
int f_q(int a){
vector<int> order;
order.push_back(a);
for (int i = 1; i <= n; i++)
{
if(i == a) continue;
order.push_back(i);
}
return publish(order);
}
void solve(int N) {
n = N;
vector<int> ans(n, 0);
for (int i = 1; i <= n; i++)
{
int p = f_p(i);
int q = f_q(i);
/*
p = x + n - 1 - pos(i);
q = pos(i) + x;
p - q = n - 1 - 2 * pos(i);
pos(i) = (n - 1 - (p - q)) / 2;
*/
//cout << p << " " << q << endl;
int pos = (n - 1 - (p - q)) / 2;
ans[pos] = 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... |