Submission #1289971

#	Time	Username	Problem	Language	Result	Execution time	Memory
1289971		MMihalev	Prisoner Challenge (IOI22_prison)	C++20	0 / 100	1 ms	340 KiB

prison

#include<iostream>
#include<algorithm>
#include<vector>
#include "prison.h"
using namespace std;

std::vector<std::vector<int>> devise_strategy(int N)
{
    int n=N;
    vector<vector<int>>s;
    s.resize(39);
    for(int i=0;i<=38;i++)s[i].resize(n+1);

    for(int i=0;i<=36;i+=3)
    {
        s[i][0]=0;
        for(int j=1;j<=n;j++)
        {
            s[i][j]=i+1+((1<<(12-(i/3)))&(j)!=0);
        }

        s[i+1][0]=1;
        s[i+2][0]=1;
        for(int j=1;j<=n;j++)
        {
            int bit=((1<<(12-(i/3)))&(j)!=0);
            if(bit==0)
            {
                s[i+2][j]=-2;
                s[i+1][j]=min(38,i+3);
            }
            else {s[i+1][j]=-1;s[i+2][j]=min(38,i+3);}
        }
    }

    return s;
}

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