# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
413463 | jjj | Unscrambling a Messy Bug (IOI16_messy) | C++14 | 1 ms | 296 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"
#define MAXN 140
int p[MAXN];
bool b[MAXN];
std::vector<int> v;
std::vector<int> restore_permutation(int n, int w, int r)
{
if(n == 8)
{
add_element("10000000");
add_element("11000000");
add_element("11100000");
add_element("11110000");
add_element("11111000");
add_element("11111100");
add_element("11111110");
add_element("11111111");
compile_set();
std::string x = "00000000";
for(int i = 0; i < n; i++)
{
for(int j = 0; j < n; j++)
{
if(x[j] == '1') continue;
x[j] = '1';
if(check_element(x))
{
p[i] = j;
break;
}
x[j] = '0';
}
}
}
if(n == 32)
{
add_element("10000000000000000000000000000000");
add_element("11000000000000000000000000000000");
add_element("11100000000000000000000000000000");
add_element("11110000000000000000000000000000");
add_element("11111000000000000000000000000000");
add_element("11111100000000000000000000000000");
add_element("11111110000000000000000000000000");
add_element("11111111000000000000000000000000");
add_element("11111111100000000000000000000000");
add_element("11111111110000000000000000000000");
add_element("11111111111000000000000000000000");
add_element("11111111111100000000000000000000");
add_element("11111111111110000000000000000000");
add_element("11111111111111000000000000000000");
add_element("11111111111111100000000000000000");
add_element("11111111111111110000000000000000");
add_element("11111111111111111000000000000000");
add_element("11111111111111111100000000000000");
add_element("11111111111111111110000000000000");
add_element("11111111111111111111000000000000");
add_element("11111111111111111111100000000000");
add_element("11111111111111111111110000000000");
add_element("11111111111111111111111000000000");
add_element("11111111111111111111111100000000");
add_element("11111111111111111111111110000000");
add_element("11111111111111111111111111000000");
add_element("11111111111111111111111111100000");
add_element("11111111111111111111111111110000");
add_element("11111111111111111111111111111000");
add_element("11111111111111111111111111111100");
add_element("11111111111111111111111111111110");
add_element("11111111111111111111111111111111");
std::string x = "00000000000000000000000000000000";
/* for(int i = 0; i < n; i++)
{
x[i] = '1';
add_element(x);
}
for(int i = 0; i < n; i++) x[i] = '0';
*/
for(int i = 0; i < n; i++)
{
for(int j = 0; j < n; j++)
{
if(x[j] == '1') continue;
x[j] == '1';
if(check_element(x))
{
p[i] = j;
break;
}
x[j] = '0';
}
}
}
for(int i = 0; i < n; i++) v.push_back(p[i]);
// add_element("0");
// compile_set();
// check_element("0");
return std::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... |