# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1044441 | Zicrus | Unscrambling a Messy Bug (IOI16_messy) | C++17 | 1 ms | 604 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;
typedef long long ll;
vector<int> restore_permutation(int n, int w, int r) {
string s = "";
for (int i = 0; i < n; i++) s += '0';
for (int i = 0; i < n-1; i++) {
s[i] = '1';
add_element(s);
}
compile_set();
vector<int> G(n);
for (int i = 0; i < n; i++) G[i] = i;
mt19937 mt(time(0));
shuffle(G.begin(), G.end(), mt);
vector<bool> vst(n);
vector<int> res(n);
for (int i = 0; i < n; i++) s[i] = '0';
for (int i = 0; i < n; i++) {
bool found = false;
ll skipped = -1;
for (int p1 = 0; p1 < n && !found; p1++) {
int p = G[p1];
if (vst[p]) continue;
if (skipped == -1) {
# | 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... |