Submission #1321245

#	Time	Username	Problem	Language	Result	Execution time	Memory
1321245		alinur	Prisoner Challenge (IOI22_prison)	C++20	5 / 100	12 ms	19000 KiB

prison

#include "prison.h"

#include <bits/stdc++.h>

using namespace std;

vector<vector<int>> devise_strategy(int N) {
    vector <vector <int> > ans(N - 1, vector<int>(N + 1));
    ans[0][0] = 0, ans[0][1] = -1, ans[0][N] = -2;
    for (int j = 2; j < N; j++) ans[0][j] = j - 1;
    for (int i = 1; i < N - 1; i++) {
        ans[i][0] = 1;
        for (int j = 1; j <= i; j++) ans[i][j] = -2;
        ans[i][i + 1] = 0;
        for (int j = i + 2; j < N + 1; j++) ans[i][j] = -1;
    }
    return ans;
}

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