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 <bits/stdc++.h>
#include "messy.h"
/// #pragma GCC optimize ("Ofast")
/// #pragma GCC target ("avx2")
/// #pragma GCC optimize("unroll-loops")
using namespace std;
using ll = long long;
using ii = pair<ll, ll>;
using vi = vector<int>;
#define ff first
#define ss second
#define pb push_back
#define all(x) (x).begin(), (x).end()
#define lb lower_bound
const int oo = 1000 * 1000 * 1000 + 7;
vector<int> restore_permutation(int N, int W, int R) {
string S(N, '0');
for(int l = 0; l < N; l++) {
S[l] = '1';
add_element(S);
}
compile_set(); S = string(N, '0');
vector<int> res(N, -1);
for(int l = 0; l < N; l++) {
vector<int> P;
for(int i = 0; i < N; i++) {
if(res[i] != -1) continue;
P.push_back(i);
}
for(int i = 0; i < N; i++)
random_shuffle(P.begin(), P.end());
for(auto u : P) {
S[u] = '1';
if(u == P.back() || check_element(S) == 1) {
res[u] = l; break;
}
S[u] = '0';
}
}
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... |