Submission #1188947

#TimeUsernameProblemLanguageResultExecution timeMemory
1188947lizaArt Collections (BOI22_art)C++20
100 / 100
817 ms540 KiB
#include "art.h"
#include <bits/stdc++.h>

using namespace std;




void solve(int N) {
    vector<int> r;
    for(int i = 1; i <= N; i++)
    {
        r.push_back(i);
    }
    int inv1 = publish(r);
    deque<int> rez;
    rez.push_back(1);
    int inv2, a=0, b=0;
    for(int i = 2; i <= N; i++)
    {
        deque<int> ve = rez;
        ve.push_front(i);
        for(int j = i+1; j <= N; j++)
        {
            ve.push_back(j);
        }
        inv1 = inv1-a;
        vector<int> x;
        for(auto j: ve) x.push_back(j);
        inv2 = publish(x);
        b = (inv2-inv1+i-1)/2;
        a = i-1-b;
        rez.insert(rez.begin()+b, i);
     //      for(auto j: rez) cout << j << " ";
     //      cout << "\n";

    }
    vector<int> x;
    for(auto j: rez) x.push_back(j);
    answer(x);


}


//publish
//answer
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...