Submission #1369193

#	Time	Username	Problem	Language	Result	Execution time	Memory
1369193		leolin0214	Prisoner Challenge (IOI22_prison)	C++20	5 / 100	9 ms	2116 KiB

prison

#include "prison.h"

#include <iostream>
#include <vector>
#include <algorithm>
#include <numeric>

using namespace std;

std::vector<std::vector<int>> devise_strategy(int N) {
    int n = N;
    int x = 500;

    vector<vector<int>> s(x+1, vector<int>(n+1));

    iota(s[0].begin(), s[0].end(), 0);
    for (int i=1; i<=x; i++) {
        s[i][0] = 1;
        for (int j=1; j<=n; j++) {
            s[i][j] = i < j ? -1 : -2;
        }
    }

    return s;
}

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