Submission #308954

#TimeUsernameProblemLanguageResultExecution timeMemory
308954amunduzbaevUnscrambling a Messy Bug (IOI16_messy)C++14
38 / 100
1 ms384 KiB
#include <bits/stdc++.h>
using namespace std;

#include "messy.h"
//#include "grader.cpp"

vector<string>v;
int n1;

void add(){
    string s(n1,'0');
    s[0]='0';
    for(int i=1;i<n1;i++) s[i]='1';
    int last=1;
    for(int i=0;i<n1-1;i++){
        add_element(s);
        s[last]='0';
        last++;
    }
    //cout<<"worked\n";
}
void check(){
    string s(n1,'0');
    for(int i=0;i<n1-1;i++){
        for(int j=0;j<n1;j++){
            if(s[j]=='0'){
                s[j]='1';
                if(check_element(s)) {
                    v.push_back(s);
                    break;
                }
                else s[j]='0';
            }
        }
    }
}
vector<int> restore_permutation(int N, int w, int r) {
    n1=N;
    add();
    compile_set();
    check();
    int vs=v.size();
    vector<int>ans(n1,0),a(n1,0);
    for(int i=0;i<vs;i++){
        for(int j=0;j<n1;j++){
            a[j]+=(v[i][j]-'0');
        }
    }
    //for(int i=0;i<n1;i++){
    //    ans[a[i]]=i;
    //}
    //for(int i=0;i<n1;i++)
    //    cout<<a[i]<<" ";
    return a;
}
/*

4
16 16
1 3 2 0

*/
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...