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 < n - i; ++j)
s += '0';
for (int j = 0; j < i; ++j)
s += '1';
add_element(s);
}
compile_set();
vector<string> v;
for (int x = 0; x < (1 << n); ++x)
{
string s;
for (int i = 0; i < n; ++i)
{
if ((x & (1 << i)))
s += '1';
else
s += '0';
}
if (check_element(s))
v.push_back(s);
}
vector<int> ans;
for (int i = 0; i < n; ++i)
{
int q = 0;
for (int k = 0; k < n; ++k)
{
if (v[k][i] == '1')
++q;
}
ans.push_back(q);
}
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... |