# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1233313 | inesfi | Unscrambling a Messy Bug (IOI16_messy) | C++20 | 0 ms | 328 KiB |
#include "messy.h"
#include <bits/stdc++.h>
using namespace std;
// add_element("0");
// compile_set();
// check_element("0");
vector<int> restore_permutation(int n, int nbajout, int nbquest) {
string quest="";
vector<int> rep={};
vector<int> autresens={};
for (int i=0;i<n;i++){
quest.push_back('0');
rep.push_back(-1);
autresens.push_back(-1);
}
for (int i=0;i<n-1;i++){
quest[i]='1';
//cout<<quest<<endl;
add_element(quest);
}
//return {0};
for (int i=0;i<n;i++){
quest[i]='0';
}
compile_set();
for (int i=0;i<n-1;i++){
bool ok=false;
int indice=0;
while (ok==false){
while (autresens[indice]!=-1){
indice++;
//cout<<42<<" ";
}
quest[indice]='1';
//cout<<quest<<" ";
if (check_element(quest)){
//cout<<indice<<endl;
ok=true;
autresens[indice]=1;
rep[indice]=i;
indice++;
}
else {
quest[indice]='0';
indice++;
}
}
//cout<<" trouve"<<endl;
}
for (int i=0;i<n;i++){
if (rep[i]==-1){
rep[i]=n-1;
}
}
return rep;
}
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... |