# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
276362 | brcode | Unscrambling a Messy Bug (IOI16_messy) | C++14 | 3 ms | 384 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];
int ord[MAXN];
vector<int> v1;
set<string> s1;
/*void add_element(string x){
string s = x;
for(int i=0;i<32;i++){
s[ord[i]] = x[i];
}
s1.insert(s);
}
bool check_element(string s){
if(s1.count(s)!=0){
return true;
}
return false;
}
void compile_set(){
}*/
vector<int> restore_permutation(int bits,int r,int w){
vector<int> p(bits);
string s="";
s+='1';
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... |