# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
430243 | LouayFarah | Unscrambling a Messy Bug (IOI16_messy) | C++14 | 1 ms | 460 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;
#define pb push_back
void add_element(string x);
void compile_set();
bool check_element(string x);
vector<int> restore_permutation(int n, int w, int r)
{
if(n==8)
{
vector<string> li;
string s = "00000000";
for(int i = 7; i>=0; i--)
{
for(int j = i-1; j>=0; j--)
{
s[j] = '1';
li.pb(s);
s[j] = '0';
}
s[i] = '1';
}
int len = (int)li.size();
for(int i = 0; i<len; i++)
add_element(li[i]);
compile_set();
vector<int> res;
for(int i = 0; i<8; i++)
res.pb(i);
for(int i = 7; i>=0; i--)
{
for(int j = i-1; j>=0; j--)
{
string s1 = "00000000";
string s2 = s1;
s1[j] = '1';
for(int k = i+1; k<8; k++)
s1[k] = '1';
for(int k = i; k<n; k++)
s2[k] = '1';
if(!check_element(s1)&&check_element(s2))
{
swap(res[i], res[j]);
return res;
}
}
}
}
if(n==32&&w==320)
{
}
if(n==32&&r==320)
{
}
}
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... |