Submission #1212438

#	Time	Username	Problem	Language	Result	Execution time	Memory
1212438		omsincoconut	Prisoner Challenge (IOI22_prison)	C++17	5 / 100	14 ms	19016 KiB

prison

#include <bits/stdc++.h>

using namespace std;

vector<vector<int>> devise_strategy(int N) {
    int x = N;
    
    vector<vector<int>> ret(x+1, vector<int>(N+1));

    // First person
    ret[0][0] = 0;
    for (int i = 1; i <= N; i++) ret[0][i] = i;

    // Second person
    for (int i = 1; i <= x; i++) {
        ret[i][0] = 1;
        for (int j = 1; j <= N; j++) {
            if (i < j) ret[i][j] = -1;
            else ret[i][j] = -2;
        }
    }

    return ret;
}

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