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 <vector>
#include "messy.h"
using namespace std;
inline bool checkbit(int i, int j)
{
    return i>>j&1;
}
inline string tostring(int x, int n)
{
    string s="";
    for (int i=0; i<n; i++)
    {
        if (x%2==0) s+='0';
        else s+='1';
        x/=2;
    }
    return s;
}
vector<int> restore_permutation(int n, int w, int r) {
    string s="";
    for (int i=0; i<n; i++) s+='0';
    for (int i=n-1; i>=1; i--)
    {
        s[i] = '1';
        add_element(s);
    }
    compile_set();
    vector <int> res(n);
    int mask = 0;
    for (int it=0; it<n; it++)
    {
        for (int j=0; j<n; j++)
        {
            if (checkbit(mask,j)) continue;
            mask^=(1<<j);
            bool check = check_element(tostring(mask,n));
            if (!check)
            {
                mask^=(1<<j);
                continue;
            }
            for (int j=0; j<n; j++)
                if (checkbit(mask,j)) res[j]++;
            break;
        }
    }
    return res;
}
| # | 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... |