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 <cstdio>
#include <string>
#include <set>
#include <cstdlib>
#include <iostream>
#include "messy.h"
using namespace std;
#define all(x) (x).begin(), (x).end()
#define forn(i, n) for (int (i) = 0; (i) < (n); (i)++)
vector<int> restore_permutation(int n, int w, int r)
{
for (int i = 1; i <= n; i++)
{
string s(n, '0');
for (int j = 0; j < i; j++) s[j] = '1';
add_element(s);
}
compile_set();
vector<int> p(n);
for (int i = 0; i < n; i++)
{
string s(n, '0');
for (int j = 0; j < i; j++)
{
s[p[j]] = '1';
}
for (int pos = 0; pos < n; pos++)
{
if (s[pos] == '0')
{
s[pos] = '1';
int x = check_element(s);
if (x)
{
p[i] = pos;
break;
}
s[pos] = '0';
}
}
}
vector<int> q(n);
for (int i = 0; i < n; i++) q[p[i]] = i;
return q;
}
# | 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... |