# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
276305 | brcode | Unscrambling a Messy Bug (IOI16_messy) | C++14 | 2 ms | 416 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 <iostream>
#include <bits/stdc++.h>
#include "messy.h"
using namespace std;
const int MAXN = 5010;
bool blocked[MAXN];
set<int> s1;
vector<int> v1;
vector<int> restore_permutation(int bits,int r,int w){
vector<int> p(bits);
string s="";
s+='1';
for(int i=2;i<=bits;i++){
s+='0';
}
add_element(s);
for(int i=1;i<bits;i++){
s[i] = '1';
add_element(s);
}
compile_set();
s = "";
for(int i=1;i<=bits;i++){
s+='0';
}
for(int i=0;i<bits;i++){
s1.insert(i);
}
for(int i=0;i<bits;i++){
int currbit = *(s1.begin());
# | 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... |