Submission #1216700

#TimeUsernameProblemLanguageResultExecution timeMemory
1216700Ghulam_JunaidArt Collections (BOI22_art)C++20
100 / 100
775 ms500 KiB
#include <bits/stdc++.h>
#include "art.h"
using namespace std;

void solve(int n) {
    int a[n + 1][2];
    vector<int> order;
    for (int i = 1; i <= n; i ++){
        order.clear();
        for (int j = i; j < i + n; j ++){
            int val = j % n;
            if (val == 0)
                val = n;
            order.push_back(val);
        }
        a[order[0]][0] =  a[order.back()][1] = publish(order);
    }
    order.resize(n);

    for (int i = 1; i <= n; i ++){
        int d = -a[i][0] + a[i][1];
        d += n;
        d /= 2;

        int pos = n - d - 1;
        order[pos] = i;
    }
    answer(order);
}
#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...