제출 #308946

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
308946		amunduzbaev	Unscrambling a Messy Bug (IOI16_messy)	C++14	20 / 100	4 ms	384 KiB

messy

#include <bits/stdc++.h>
using namespace std;

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

vector<string>v;
int n1;

string bin(int a){
    string s;
    while(a){
        int d=a%2;
        s.push_back(d+'0');
        a/=2;
    }
    int ss=s.size();
    while(ss < n1){
        s.push_back('0');
        ss=s.size();
    }

    reverse(s.begin(),s.end());
    return s;
}

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";
}
int fun(int b){
    int a=1;
    while(b--) a*=2;
    return a;
}
void check(){
    int num=0;
    string s;
    int n2=fun(n1);
    for(int i=1;i<n2;i++){
        num++;
        s=(bin(num));
        if(check_element(s)) v.push_back(s);
    }
}
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

*/

• Subtask 1: 20 / 20
• Subtask 2: 0 / 18
• Subtask 3: 0 / 11
• Subtask 4: 0 / 21
• Subtask 5: 0 / 30