Submission #413448

#TimeUsernameProblemLanguageResultExecution timeMemory
413448jjjUnscrambling a Messy Bug (IOI16_messy)C++14
20 / 100
6 ms296 KiB
#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';
            }
        }
    }

    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);
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...