Submission #761170

#	Time	Username	Problem	Language	Result	Execution time	Memory
761170		GrindMachine	Unscrambling a Messy Bug (IOI16_messy)	C++17	49 / 100	1 ms	340 KiB

messy

// Om Namah Shivaya

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

using namespace std;
using namespace __gnu_pbds;

template<typename T> using Tree = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
typedef long long int ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;

#define fastio ios_base::sync_with_stdio(false); cin.tie(NULL)
#define pb push_back
#define endl '\n'
#define sz(a) a.size()
#define setbits(x) __builtin_popcountll(x)
#define ff first
#define ss second
#define conts continue
#define ceil2(x, y) ((x + y - 1) / (y))
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define yes cout << "Yes" << endl
#define no cout << "No" << endl

#define rep(i, n) for(int i = 0; i < n; ++i)
#define rep1(i, n) for(int i = 1; i <= n; ++i)
#define rev(i, s, e) for(int i = s; i >= e; --i)
#define trav(i, a) for(auto &i : a)

template<typename T>
void amin(T &a, T b) {
    a = min(a, b);
}

template<typename T>
void amax(T &a, T b) {
    a = max(a, b);
}

#ifdef LOCAL
#include "debug.h"
#else
#define debug(x) 42
#endif

/*



*/

const int MOD = 1e9 + 7;
const int N = 1e5 + 5;
const int inf1 = int(1e9) + 5;
const ll inf2 = ll(1e18) + 5;

#include "messy.h"

std::vector<int> restore_permutation(int n, int w, int r) {
    string curr = string(n,'0');

    rev(i,n-1,0){
        curr[i] = '1';
        add_element(curr);
    }

    compile_set();

    vector<int> p(n,-1);

    curr = string(n,'0');
    string have = curr;

    mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

    rev(i,n-1,0){
        curr[i] = '1';
        vector<ll> pos;

        rep(j,n){
            if(have[j] == '1') conts;
            pos.pb(j);
        }

        shuffle(all(pos),rng);

        rep(jj,sz(pos)){
            ll j = pos[jj];
            have[j] = '1';

            if(jj == sz(pos) - 1 or check_element(have)){
                p[j] = i;
                break;
            }

            have[j] = '0';
        }
    }

    return p;
}

Compilation message (stderr)

messy.cpp: In function 'std::vector<int> restore_permutation(int, int, int)':
messy.cpp:30:36: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   30 | #define rep(i, n) for(int i = 0; i < n; ++i)
      |                                    ^
messy.cpp:92:9: note: in expansion of macro 'rep'
   92 |         rep(jj,sz(pos)){
      |         ^~~
messy.cpp:96:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   96 |             if(jj == sz(pos) - 1 or check_element(have)){
      |                ~~~^~~~~~~~~~~~~~

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