Submission #730622

#	Time	Username	Problem	Language	Result	Execution time	Memory
730622		Nelt	Prisoner Challenge (IOI22_prison)	C++17	56 / 100	14 ms	1236 KiB

prison

#include "prison.h"

#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx,avx2,fma")

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

/* DEFINES */
#define S second
#define F first
#define ll long long
#define ull unsigned long long
#define ld long double
#define npos ULLONG_MAX
#define INF LLONG_MAX
#define vv(a) vector<a>
#define pp(a, b) pair<a, b>
#define pq(a) priority_queue<a>
#define qq(a) queue<a>
#define ss(a) set<a>
#define mm(a, b) map<a, b>
#define ump(a, b) unordered_map<a, b>
#define sync                      \
    ios_base::sync_with_stdio(0); \
    cin.tie(0);                   \
    cout.tie(0);
#define elif else if
#define endl "\n"
#define allc(a) begin(a), end(a)
#define all(a) a, a + sizeof(a) / sizeof(a[0])
#define pb push_back
#define logi(a) __lg(a)
#define sqrt(a) sqrtl(a)
#define mpr make_pair
#define ins insert
using namespace std;
using namespace __gnu_pbds;
using namespace __cxx11;
typedef char chr;
typedef basic_string<chr> str;
template <typename T, typename key = less<T>>
using ordered_set = tree<T, null_type, key, rb_tree_tag, tree_order_statistics_node_update>;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
vv(vv(int)) devise_strategy(int n)
{
    vv(vv(int)) ans(27, vv(int)(n + 1));
    ans[0][0] = 0;
    for (ll j = 1; j <= n; j++)
        ans[0][j] = (j >> 12 & 1 ? 13 : 0) + 13;
    for (ll bit = 1; bit <= 13; bit++)
    {
        if (bit & 1)
        {
            ans[bit][0] = 1;
            for (ll j = 1; j <= n; j++)
                if (j >> (bit - 1) & 1)
                    ans[bit][j] = -1;
                else
                    ans[bit][j] = (bit == 1 ? -2 : (j >> (bit - 2) & 1 ? 13 : 0) + bit - 1);
        }
        else
        {
            ans[bit][0] = 0;
            for (ll j = 1; j <= n; j++)
                if (j >> (bit - 1) & 1)
                    ans[bit][j] = -2;
                else
                    ans[bit][j] = (j >> (bit - 2) & 1 ? 13 : 0) + bit - 1;
        }
    }
    for (ll bit = 14; bit <= 26; bit++)
    {
        if (!(bit & 1))
        {
            ans[bit][0] = 1;
            for (ll j = 1; j <= n; j++)
                if (!(j >> (bit - 1 - 13) & 1))
                    ans[bit][j] = -2;
                else
                    ans[bit][j] = (bit == 14 ? -2 : (j >> (bit - 2 - 13) & 1 ? 0 : -13) + bit - 1);
        }
        else
        {
            ans[bit][0] = 0;
            for (ll j = 1; j <= n; j++)
                if (!(j >> (bit - 1 - 13) & 1))
                    ans[bit][j] = -1;
                else
                    ans[bit][j] = (j >> (bit - 2 - 13) & 1 ? 0 : -13) + bit - 1;
        }
    }
    return ans;
}

• Subtask 1: 5 / 5
• Subtask 2: 5 / 5
• Subtask 3: 46 / 90