제출 #1355488

#제출 시각아이디문제언어결과실행 시간메모리
1355488toast12Machine (IOI24_machine)C++20
100 / 100
38 ms444 KiB
#include "machine.h"
#include <bits/stdc++.h>
using namespace std;

vector<int> find_permutation(int N) {
    vector<int> a(N);
    for (int i = 0; i < N; i++) a[i] = i+1;
    a[N-1] = N+2;
    vector<int> B = use_machine(a);
    vector<int> ans(N);
    int x = 0;
    for (; x <= 255; x++) {
        vector<int> v;
        for (int i = 0; i < N; i++) {
            int temp = x^B[i];
            v.push_back(temp);
        }
        sort(v.begin(), v.end());
        if (v == a) break;
    }
    for (int i = 0; i < N; i++) {
        ans[i] = (x^B[i])-1;
        if (ans[i] == N+1) ans[i] = N-1;
    }
    return 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...
#Verdict Execution timeMemoryGrader output
Fetching results...