Submission #1140358

#	Time	Username	Problem	Language	Result	Execution time	Memory
1140358		hyl_kibou	Prisoner Challenge (IOI22_prison)	C++17	5 / 100	7 ms	9796 KiB

prison

#include "prison.h"

#include <vector>

std::vector<std::vector<int>> devise_strategy(int N) {
    std::vector<std::vector<int>> arr ((N+1)/2, std::vector<int> (N+1));
    int n = (N+1)/2;
    for(int i = 0; i<n; ++i){
        //[i][j]
        //i = number read wb
        //i0 = bag checked 0A, 1B
        //j = number of coins seen
        //ij = -1A, -2B, vWriteWb
        arr[i][0] = i%2;
        for(int j = 1; j<=N; ++j){
            //std::cout << "cat\n";
            if(j>=N-i){
                arr[i][j] = -1-((i+1)%2);
            }
            else if(j<=i+1){
                arr[i][j] = -1-(i%2);
            }
            else{
                arr[i][j] = i+1;
            }
        }
    }

    return arr;
    //return {std::vector<int>(N + 1, 0)};
}

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