제출 #1355455

#제출 시각아이디문제언어결과실행 시간메모리
1355455toast12Machine (IOI24_machine)C++20
10 / 100
3 ms448 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;
    vector<int> B = use_machine(A);
    vector<int> ans(N);
    int x = 0;
    for (int i = 0; i < N; i++) {
        vector<int> cnt(N);
        for (int j = 0; j < N; j++) {
            int temp = B[j]^B[i];
            if (temp < N) cnt[B[j]^B[i]]++;
        }
        if (*min_element(cnt.begin(), cnt.end()) == 1 && *max_element(cnt.begin(), cnt.end()) == 1) {
            x = B[i];
            break;
        }
    }
    for (int i = 0; i < N; i++) ans[i] = x^B[i];
    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...