Submission #1213796

#	Time	Username	Problem	Language	Result	Execution time	Memory
1213796		toast12	Art Collections (BOI22_art)	C++20	0 / 100	0 ms	408 KiB

art

#include "art.h"
#include <bits/stdc++.h>
using namespace std;
//
// --- Sample implementation for the task art ---
//
// To compile this program with the sample grader, place:
//     art.h art_sample.cpp sample_grader.cpp
// in a single folder, then open the terminal in this directory (right-click onto an empty spot in the directory,
// left click on "Open in terminal") and enter e.g.:
//     g++ -std=c++17 art_sample.cpp sample_grader.cpp
// in this folder. This will create a file a.out in the current directory which you can execute from the terminal
// as ./a.out
// See task statement or sample_grader.cpp for the input specification
//
void solve(int N) {
    vector<int> ord(N), pos(N+1);
    iota(ord.begin(), ord.end(), 1);
    iota(pos.begin()+1, pos.end(), 0);
    vector<int> ans(N);
    for (int i = 1; i <= N; i++) {
        int mn = INT_MAX, idx = pos[i];
        for (int j = 0; j < N; j++) {
            int x = ord[j];
            swap(ord[j], ord[pos[i]]);
            swap(pos[x], pos[i]);
            int inv = publish(ord);
            if (inv < mn) {
                mn = inv;
                idx = j;
            }
            x = ord[j];
            swap(ord[j], ord[pos[i]]);
            swap(pos[x], pos[i]);
        }
        ans[idx] = i;
        fill(ord.begin(), ord.end(), 0);
        for (int j = 0; j < N; j++) {
            if (ans[j]) ord[j] = ans[j];
        }
        int cur = i+1;
        for (int j = 0; j < N; j++) {
            if (!ord[j]) ord[j] = cur++;
            pos[ord[j]] = j;
        }
    }
    answer(ans);
}

• Subtask 1: 0 / 5
• Subtask 2: 0 / 15
• Subtask 3: 0 / 15
• Subtask 4: 0 / 15
• Subtask 5: 0 / 20
• Subtask 6: 0 / 30