제출 #767544

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
767544		mousebeaver	죄수들의 도전 (IOI22_prison)	C++17	10 / 100	4 ms	596 KiB

prison

#include "prison.h"
#include <bits/stdc++.h>
using namespace std;

const int digits = 8;

string ternary(int a)
{
    string output = "";
    for(int i = 0; i < digits; i++)
    {
        output = (char) ((int) '0' + (a%3)) + output;
        a /= 3;
    }
    return output;
}

std::vector<std::vector<int>> devise_strategy(int N) 
{
    vector<string> t(N);
    for(int i = 1; i <= N; i++)
    {
        t[i-1] = ternary(i);
    }
    int m = 22;

    vector<vector<int>> output(m+1, vector<int> (N+1));
    //First look:
    output[0][0] = 0;
    for(int j = 1; j <= N; j++)
    {
        int pre = (int) t[j-1][0] - (int) '0';
        output[0][j] = 1+pre;
    }

    for(int i = 1; i <= 21; i++)
    {

        //Compare with the previous check
        int bit = (i-1)/3; //Previous bit
        int pre = (i-1)%3;
        output[i][0] = bit%2;

        for(int j = 1; j <= N; j++)
        {
            int post = (int) t[j-1][bit] - (int) '0';
            if(pre < post)
            {
                output[i][j] = (bit%2==0) ? -2 : -1;
            }
            else if(pre == post)
            {
                //Prepare check of next bit
                post = (int) t[j-1][bit+1] - (int) '0';
                if(bit < 6)
                {
                    output[i][j] = 1 + post + (bit+1)*3;
                }
                else
                {
                    if(post == 0)
                    {
                        output[i][j] = -1;
                    }
                    else if(post == 1)
                    {
                        output[i][j] = m;
                    }
                    else
                    {
                        output[i][j] = -2;
                    }
                }
            }
            else
            {
                output[i][j] = (bit%2==0) ? -1 : -2;
            }
        }
    }

    //Last bit!
    output[m][0] = 1;
    for(int i = 1; i <= N; i++)
    {
        if(t[i-1][7] == '0')
        {
            output[m][i] = -2;
        }
        else
        {
            output[m][i] = -1;
        }
    }

    return output;
}

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