Submission #1125256

#	Time	Username	Problem	Language	Result	Execution time	Memory
1125256		biank	Machine (IOI24_machine)	C++20	100 / 100	9 ms	452 KiB

machine

#include <bits/stdc++.h>
#include "machine.h"

using namespace std;

vector<int> find_permutation(int N) {
    vector<int> A(N);
    for (int i = 1; i < N; i++) A[i - 1] = i;
    A[N - 1] = N + 2;
    vector<int> B = use_machine(A);
    for (int X = 0; X < 256; X++) {
        vector<int> cnt(N, 0);
        vector<int> P(N, 0);
        bool flag = true;
        for (int i = 0; i < N; i++) {
            int AP = B[i] ^ X;
            if (1 <= AP && AP < N) P[i] = AP - 1;
            else if (AP == N + 2) P[i] = N - 1;
            else flag = false;
            if (++cnt[P[i]] != 1) flag = false;
        }
        if (flag) return P;
    }
    assert(false);
}

• Subtask 0: 0 / 0
• Subtask 1: 7 / 7
• Subtask 2: 12 / 12
• Subtask 3: 19 / 19
• Subtask 4: 21 / 21
• Subtask 5: 10 / 10
• Subtask 6: 31 / 31