# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
241730 | crossing0ver | Unscrambling a Messy Bug (IOI16_messy) | C++17 | 5 ms | 384 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
#include "messy.h"
using namespace std;
int X[500],L[500],R[500],IN[500];
vector<int> restore_permutation(int n, int w, int r) {
int lg = log2(n);
int l = -1;
string s(n,'0');
for (int val = n/2;val;val/=2) {
for (int i = l+1; i < n; i++) {
if ( (i & ( val) ) == 0) {
s[i] = '1';
//add_element(s);
cout << s <<'\n';
s[i] = '0';
}
}
s[++l] = '1';
}
compile_set();
for (int i = 0;i < n; i++) s[i] = '0';
vector<int> st;
vector<int> not1;
for (int i = 0; i < n; i++) not1.push_back(i);
int val = n/2;
int cnt = 0;
for (int i = 0; i < n; i++)
for (int j = 1; j < n; j*=2) X[i]^=j;
while (val) {
vector<int> v;
Compilation message (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... |