Submission #1335260

#TimeUsernameProblemLanguageResultExecution timeMemory
1335260nguyenkhangninh99Art Collections (BOI22_art)C++20
100 / 100
676 ms484 KiB
#include <bits/stdc++.h>
#include "art.h"

using namespace std;
void solve(int n){
    vector<int> order;
    for(int i = 1; i <= n; i++) order.push_back(i);

    vector<int> val(n);
    for(int i = 0; i < n; i++){
        val[i] = publish(order);
        reverse(order.begin() + 1, order.end()); 
        reverse(order.begin(), order.end());
    }

    vector<int> ans(n);
    for(int i = 0; i < n; i++) ans[(n - 1 + (val[i] - val[(i + 1) % n])) / 2] = i + 1;
    answer(ans);
}
#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...