Submission #639819

#	Time	Username	Problem	Language	Result	Execution time	Memory
639819		magmag	Prisoner Challenge (IOI22_prison)	C++17	5 / 100	26 ms	19028 KiB

prison

#include "prison.h"

#include <bits/stdc++.h>
using namespace std;
using vi = vector<int>;

vector<vector<int>> devise_strategy(int n) {
    int x = n;
    vector<vi> ans(x+1, vi(n+1, 1));

    ans[0][0] = 0;
    for (int j = 1; j <= n; ++j)ans[0][j] = j;

    for (int i = 1; i <= x; ++i) {
        for (int j = 1; j <= n; ++j) {
            if (j <= i) {
                ans[i][j] = -2;
            } else ans[i][j] = -1;
        }
    }
    return ans;
}

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