# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1071415 | mc061 | Unscrambling a Messy Bug (IOI16_messy) | C++14 | 1 ms | 440 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.
#pragma once
#include <bits/stdc++.h>
using namespace std;
void add_element(std::string x);
bool check_element(std::string x);
void compile_set();
std::vector<int> restore_permutation(int n, int w, int r) {
string s(n, '0');
for (int i = 0; i < n-1; ++i) {
s[i] = '1';
add_element(s);
}
compile_set();
vector<pair<int, int>> know;
vector<bool> busy(n, false);
for (int bits = 1; bits < n; ++bits) {
string cur(n, '0');
for (auto [was, now] : know) {
cur[now] = '1';
}
vector<string> pot;
for (int i = 0; i < n; ++i) {
if (cur[i] == '1') continue;
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... |