Submission #1246537

#TimeUsernameProblemLanguageResultExecution timeMemory
1246537adam17Art Collections (BOI22_art)C++20
100 / 100
771 ms456 KiB
// Po precteni reseni
#include "art.h"
// #include <iostream>
using namespace std;

void solve(int N) {
    vector<int> V(N);
    vector<int> W(N);
    for (int i = 0; i < N; i++) {
        for (int j = 0; j < N; j++) {
            V[j] = (j + i) % N + 1;
        }
        W[i] = publish(V);
    }
    for (int i = 0; i < N; i++) {
        V[i] = (W[i] - W[(i+1)%N] + N - 1) / 2;
        // cout << "poloha " << i << " je " << V[i] << endl;
    }
    for (int i = 0; i < N; i++) {
        W[V[i]] = i + 1;
    }
    answer(W);
}
#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...