# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1154206 | AlgorithmWarrior | Unscrambling a Messy Bug (IOI16_messy) | C++20 | 0 ms | 328 KiB |
#include <vector>
#include <cstdio>
#include <string>
#include <set>
#include <cstdlib>
#include <iostream>
#include "messy.h"
using namespace std;
vector<int> restore_permutation(int n, int w, int r) {
vector<int>answer(n);
string sir;
int i;
for(i=0;i<n;++i){
answer[i]=i;
sir.push_back('0');
}
for(i=0;i<n;++i){
sir[i]='1';
add_element(sir);
}
compile_set();
int prima=-1,ult=-1;
for(i=0;i<n;++i)
sir[i]='0';
for(i=0;i<n;++i){
sir[i]='1';
if(!check_element(sir)){
if(prima==-1)
prima=i;
ult=i;
}
}
if(prima!=-1)
swap(answer[prima],answer[ult+1]);
return answer;
}
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... |