| # | Time | Username | Problem | Language | Result | Execution time | Memory | 
|---|---|---|---|---|---|---|---|
| 1049099 | sofijavelkovska | Art Collections (BOI22_art) | C++17 | 710 ms | 1984 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 "sample_grader.cpp"
#include <bits/stdc++.h>
using namespace std;
void solve(int n)
{
    vector<int> a;
    pair<int, int> rank[n+1];
    for (int i=1; i<=n; i++)
        rank[i].second=i;
    rank[1].first=0;
    for (int i=2; i<=n; i++)
    {
        a.clear();
        a.push_back(1);
        for (int j=2; j<=n; j++)
            if (j!=i)
                a.push_back(j);
        a.push_back(i);
        int inv1=publish(a);
        swap(a[0], a[n-1]);
        int inv2=publish(a);
        if (inv2>inv1)
            rank[i].first=(inv2+1-inv1)/2;
        else
            rank[i].first=-(inv1+1-inv2)/2;
    }
    sort(rank+1, rank+n+1);
    for (int i=1; i<=n; i++)
        a[i-1]=rank[i].second;
    answer(a);
    return;
}
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... | ||||
