| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1316956 | spetr | Machine (IOI24_machine) | C++20 | 0 ms | 0 KiB |
#include <bits/stdc++.h>
#include "machine.h"
using namespace std;
#define ll long long
const ll mmod = 998244353;
#define vl vector<long long>
#define vll vector<vector<long long>>
#define pl pair<long long, long long>
#define vb vector<bool>
std::vector<int> find_permutation(int N){
if (N % 2 == 1){
vector<int> cisla;
x = 0;
for (ll i = 0; i < N; i++){
cisla.push_back(i);
x ^= i;
}
vector<int> permutace = use_machine(cisla);
for (ll i = 0; i < N; i++){
x ^= permutace[i];
}
for (ll i=0; i < N; i++){
permutace[i] ^= x;
}
return permutace;
}
else{
vector<int> cisla;
for (ll i = 0; i < N; i++){
int x = i << 8;
cisla.push_back(x);
}
vector<int> permutace = use_machine(cisla);
for (ll i = 0; i < N; i++){
permutace[i] = (permutace[i] >> 8);
}
return permutace;
}
}
