제출 #730747

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
730747		Nelt	죄수들의 도전 (IOI22_prison)	C++17	80 / 100	69 ms	1024 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());
ll b = 3, lg = 7;
ll code[25];
ll getbit(ll x, ll bit)
{
    return x / (ll)powl(b, bit) % b;
}
ll encode(ll bit, ll x)
{
    return code[x * (lg + 1) + bit + 1];
}
ll decodebit(ll x)
{
    return (x - 1) % (lg + 1);
}
ll decodedigit(ll x)
{
    return (x - 1) / (lg + 1);
}
void init()
{
    for (ll i = 2; i <= 24; i++)
        code[i] = code[i - 1] + !!((i - 1) & 7);
    code[9] = 22;
}
vv(vv(int)) devise_strategy(int n)
{
    init();
    vv(vv(int)) ans(23, vv(int)(n + 1));
    ans[0][0] = 0;
    for (ll i = 1; i <= n; i++)
        ans[0][i] = encode(lg, getbit(i, lg));
    ll x, dig;
    for (ll bit = 1; bit <= 24; bit++)
    {
        if (!((bit - 1) & 7) and bit != 9)
            continue;
        x = decodebit(bit);
        dig = decodedigit(bit);
        ans[code[bit]][0] = x & 1;
        if (x & 1)
        {
            for (ll i = 1; i <= n; i++)
                if (getbit(i, x) < dig)
                    ans[code[bit]][i] = -2;
                elif (getbit(i, x) > dig)
                    ans[code[bit]][i] = -1;
                elif (x == 1)
                {
                    if (getbit(i, 0) == 0)
                        ans[code[bit]][i] = -2;
                    elif (getbit(i, 0) == 2)
                        ans[code[bit]][i] = -1;
                    else
                        ans[code[bit]][i] = encode(0, 1);
                }
                else
                    ans[code[bit]][i] = encode(x - 1, getbit(i, x - 1));
        }
        else
        {
            for (ll i = 1; i <= n; i++)
                if (getbit(i, x) < dig)
                    ans[code[bit]][i] = -1;
                elif (getbit(i, x) > dig or !x)
                    ans[code[bit]][i] = -2;
                else
                    ans[code[bit]][i] = encode(x - 1, getbit(i, x - 1));
        }
    }
    return ans;
}

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