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"
#include <bits/stdc++.h>
using namespace std;
#define m_p make_pair
#define fi first
#define se second
#define sz(x) ((int)(x).size())
#define all(x) (x).begin(),(x).end()
typedef long long ll;
std::vector<int> restore_permutation(int n, int w, int r)
{
for (int i = 0; i < n; ++i)
{
string s;
for (int j = 0; j <= i; ++j)
s += '1';
for (int j = i + 1; j < n; ++j)
s += '0';
add_element(s);
}
compile_set();
vector<int> ans(n);
string s;
for (int i = 0; i < n; ++i)
s += '0';
for (int i = 0; i < n; ++i)
{
for (int j = 0; j < n; ++j)
{
if (s[j] == '1')
continue;
s[j] = '1';
if (check_element(s))
{
ans[j] = i;
break;
}
s[j] = '0';
}
}
return ans;
}
# | 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... |