Submission #1122818

#TimeUsernameProblemLanguageResultExecution timeMemory
1122818LaMatematica14Art Collections (BOI22_art)C++20
100 / 100
1048 ms472 KiB
#include "art.h"
#include <bits/stdc++.h>
using namespace std;


void solve(int N) {
    vector<int> q(N);
    for (int i = N-1; i >= 0; i--) {
        vector<int> tr(N);
        for (int j = 1; j <= N; j++) tr[(i+j)%N] = j;
        q[N-i-1] = publish(tr);
    }
    vector<int> ans(N, N);
    for (int i = 0; i < N-1; i++) {
        ans[(q[i]-q[i+1]+N-1)/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...