Submission #740544

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

prison

#include <vector>

std::vector<std::vector<int>> devise_strategy(int N) {
    std::vector<std::vector<int>> s(N + 1, std::vector<int>(N + 1, 0));

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

    return s;
}

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