| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1355488 | toast12 | Machine (IOI24_machine) | C++20 | 38 ms | 444 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 time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
