Submission #740559

#	Time	Username	Problem	Language	Result	Execution time	Memory
740559		ALVIN	Prisoner Challenge (IOI22_prison)	C++17	0 / 100	1 ms	212 KiB

prison

#include <vector>

std::vector<std::vector<int>> devise_strategy(int N) {
    std::vector<std::vector<int>> strategy(N, std::vector<int>(N + 1, -1));
    
    strategy[0][0] = 0;
    for (int i = 1; i < N; ++i) {
        strategy[i][0] = 1;
    }

    for (int i = 0; i < N; ++i) {
        for (int j = 1; j <= N; ++j) {
            if (j == i + 1) {
                strategy[i][j] = i;
            } else if (j < i + 1) {
                strategy[i][j] = -2;
            } else {
                strategy[i][j] = -1;
            }
        }
    }

    return strategy;
}

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