제출 #1079651

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1079651		ALeonidou	Unscrambling a Messy Bug (IOI16_messy)	C++17	49 / 100	1 ms	440 KiB

messy

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

#define ll int
#define F first
#define S second
#define sz(x) (ll)x.size()
#define pb push_back

typedef vector <ll> vi;
typedef pair <ll,ll> ii;
typedef vector <ii> vii;

#define dbg(x) cout<<#x<<": "<<x<<endl;
#define dbg2(x,y) cout<<#x<<": "<<x<<" "<<#y<<": "<<y<<endl;
#define dbg3(x,y,z) cout<<#x<<": "<<x<<" "<<#y<<": "<<y<<" "<<#z<<": "<<z<<endl;

void printVct(vi &v){
    for (ll i= 0; i<sz(v); i++){
        cout<<v[i]<<" ";
    }
    cout<<endl;
}

mt19937 rng;
void init_rand(){
    rng = mt19937(chrono::steady_clock::now().time_since_epoch().count());
}

vi gen_rand_permutation(ll n){
    vi v;
    for (ll i =0; i<n; i++){
        v.pb(i);
    }
    shuffle(v.begin(), v.end(), rng);
    return v;
}

vi restore_permutation(int n, int w, int r) {
    init_rand();

    string s;
    for (ll i =0; i<n; i++) s.pb('0');
    for (ll i =0; i<n-1; i++){
        s[i] = '1';
        add_element(s);
    }

    compile_set();

    vector <string> vs(n-1);
    string tmp; 
    for (ll i =0; i<n; i++) tmp.pb('0');

    for (ll i = 0; i<n; i++){
        vi p = gen_rand_permutation(n);
        for (ll j =0; j<n; j++){
            ll idx = p[j];
            if (tmp[idx] == '1') continue;
            tmp[idx] = '1';
            bool x = check_element(tmp);
            if (x){
                vs[i] = tmp;
                break;
            }
            else{
                tmp[idx] = '0';
            }
        }
    }

    vi ans(n);
    vi vis(n);
    for (ll i =0; i<n-1; i++){
        string c = vs[i];
        ll init_pos = i, final_pos = -1;
        for (ll j =0; j<n; j++){
            if (c[j] == '1' && !vis[j]){
                final_pos = j;
                break;
            }
        }
        // dbg2(init_pos, final_pos);
        vis[final_pos] = 1;
        ans[final_pos] = init_pos;
    }
    for (ll i=0; i<n; i++){
        if (!vis[i]){
            ans[i] = n-1;
            break;
        }
    }

    return ans;
}

/*
4 16 16
2 1 3 0

8 256 256
2 1 3 4 7 0 6 5

8 256 256
2 1 3 4 7 0 6 5

*/

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