# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1273759 | Petrix | Unscrambling a Messy Bug (IOI16_messy) | C++20 | 2 ms | 584 KiB |
#include <iostream>
#include "messy.h"
#include <vector>
using namespace std;
vector<int> rasp,s1;
vector<int> restore_permutation(int n,int w,int r){
int cnt=0,i,j,k;string s;rasp.resize(n);s1.resize(n);
for(i=1;(1<<i)<=n;i++){
for(j=0;j<n;j+=(1<<i)){
s.clear();
for(k=0;k<n;k++){
if(j<=k && j+(1<<i)>k) s+='0';
else s+='1';
}
for(k=j+(1<<(i-1));k<j+(1<<i);k++){
s[k]='1';
add_element(s);
s[k]='0';
}
}
cnt=i;
}
compile_set();
for(i=cnt-1;i>=0;i--){
s1=rasp;s.clear();
for(j=0;j<n;j++){
for(k=0;k<n;k++){
if(s1[j]!=s1[k]) s+='1';
else s+='0';
}
s[j]='1';
rasp[j]+=((check_element(s))<<i);
s.clear();
}
}
return rasp;
}
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... |