Submission #1083828

#	Time	Username	Problem	Language	Result	Execution time	Memory
1083828		SamueleVid	Prisoner Challenge (IOI22_prison)	C++17	5 / 100	24 ms	19044 KiB

prison

#include <bits/stdc++.h>
using namespace std;

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

    for (int i = 1; i <= N; i ++) {
        for (int j = 1; j <= N; j ++) {
            sol[i][j] = (i < j) ? -1 : -2; 
        }
    }
    return sol;
}

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