# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
1247612 | julia_08 | Unscrambling a Messy Bug (IOI16_messy) | C++20 | 1 ms | 328 KiB |
#include <bits/stdc++.h>
#include "messy.h"
using namespace std;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
const int MAXN = 128;
int to[MAXN], marc[MAXN];
int n;
string str(int x){
string s;
for(int i=0; i<n; i++){
if(x & (1 << i)){
s.push_back('1');
} else s.push_back('0');
}
reverse(s.begin(), s.end());
return s;
}
vector<int> restore_permutation(int n_, int w, int r){
n = n_;
for(int i=0; i<n; i++) add_element(str((1 << (i + 1)) - 1));
compile_set();
vector<int> ans(n);
int cur = 0;
vector<int> v;
for(int i=0; i<n; i++) v.push_back(i);
for(int i=0; i<n; i++){
shuffle(v.begin(), v.end(), rng);
for(int k=0; k<v.size(); k++){
int j = v[k];
if(check_element(str(cur ^ (1 << j)))){
cur ^= (1 << j);
to[n - 1 - i] = n - 1 - j;
marc[j] = 1;
swap(v[k], v.back());
v.pop_back();
break;
}
}
}
for(int i=0; i<n; i++) ans[to[i]] = i;
return ans;
}
컴파일 시 표준 에러 (stderr) 메시지
# | 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... |