제출 #1272313

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1272313		hubertm	죄수들의 도전 (IOI22_prison)	C++20	65 / 100	8 ms	7512 KiB

prison

#include "prison.h"

#include <bits/stdc++.h>

using namespace std;

constexpr int base = 3;
constexpr int maxBit = 7;
constexpr int x = (maxBit + 1) * base;

int getStep(int n)
{
    return (n + base - 1) / base;
}

int getBit(int n, int b)
{
    for (int i = 0; i < b; ++i) n /= base;

    return n % base;
}

vector<vector<int>> devise_strategy(int N)
{
    vector<vector<int>> strategy;
    for (int n = 0; n <= x; ++n)
    {
        vector<int> current(N + 1);
        int step = getStep(n);

        current[0] = (step & 1);

        for (int j = 1; j <= N; ++j)
        {
            int v = getBit(j, maxBit - step + 1);

            int written = (n - 1) % base;

            if (step != 0 && v > written)
            {
                if (step & 1)
                    current[j] = -1;
                else
                    current[j] = -2;
                continue;
            }
            else if (step != 0 && written > v)
            {
                if (step & 1)
                    current[j] = -2;
                else
                    current[j] = -1;
                continue;
            }

            if (step == maxBit + 1) continue;

            v = getBit(j, maxBit - step);

            current[j] = step * base + v + 1;
        }

        strategy.push_back(current);
    }

    // for (int i = 0; i <= x; ++i)
    // {
    //     for (int v : strategy[i]) cout << v << ' ';
    //     cout << '\n';
    // }

    return strategy;
}

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