Submission #600970

#TimeUsernameProblemLanguageResultExecution timeMemory
600970MohamedFaresNebiliUnscrambling a Messy Bug (IOI16_messy)C++14
38 / 100
1 ms340 KiB
#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++) {
                    for(int i = 0; i < N; i++) {
                        if(S[i] == '1') continue;
                        S[i] = '1';
                        bool K = check_element(S);
                        if(K) {
                            res[i] = l;
                            break;
                        }
                        else S[i] = '0';
                    }
                }
                return res;
            }
#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...