제출 #601063

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
601063		MohamedFaresNebili	Unscrambling a Messy Bug (IOI16_messy)	C++14	38 / 100	1 ms	340 KiB

messy

#include <bits/stdc++.h>
#include "messy.h"
/// #pragma GCC optimize ("Ofast")
/// #pragma GCC target ("avx2")
/// #pragma GCC optimize("unroll-loops")

            using namespace std;

            using ll = long long;
            using ii = pair<ll, ll>;
            using vi = vector<int>;

            #define ff first
            #define ss second
            #define pb push_back
            #define all(x) (x).begin(), (x).end()
            #define lb lower_bound

            const int oo = 1000 * 1000 * 1000 + 7;

            vector<int> restore_permutation(int N, int W, int R) {
                string S(N, '0');
                for(int l = 0; l < N; l++) {
                    S[l] = '1';
                    add_element(S);
                }
                compile_set(); S = string(N, '0');
                vector<int> res(N, -1);
                for(int l = 0; l < N; l++) {
                    vector<int> P;
                    for(int i = 0; i < N; i++) {
                        if(S[i] == '1') continue;
                        P.push_back(i);
                    }
                    random_shuffle(P.begin(), P.end());
                    for(auto u : P) {
                        S[u] = '1';
                        if(u == P.back() || check_element(S)) {
                            res[u] = l; break;
                        }
                        S[u] = '0';
                    }
                }
                return res;
            }

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