# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
614409 | brucecccccc | Unscrambling a Messy Bug (IOI16_messy) | C++14 | 2 ms | 340 KiB |
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"
using namespace std;
vector<int> restore_permutation(int n, int w, int r) {
srand(102938);
set<int> pos;
for (int i = 0; i < n; i++) pos.insert(i);
set<int> k = pos;
vector<int> val(n);
string x(n, '0');
for (int i = 0; i < n; i++) {
auto g = next(k.begin(), rand() % k.size());
x[*g] = '1';
val[i] = *g;
k.erase(g);
add_element(x);
}
compile_set();
x = string(n, '0');
int count = 0;
vector<int> ans(n);
for (int i = 0; i < n; i++) {
set<int> guess = pos;
while (!guess.empty()) {
auto g = next(guess.begin(), rand() % guess.size());
string t = x;
int ind = *g;
t[ind] = '1';
guess.erase(g);
// cout << t << ' ' << x << endl;
// count++;
if (guess.empty() || check_element(t)) {
ans[ind] = val[i];
x[ind] = '1';
pos.erase(ind);
break;
}
}
}
// cout << count << endl;
return ans;
}
Compilation message (stderr)
# | 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... |