Submission #769425

#	Time	Username	Problem	Language	Result	Execution time	Memory
769425		adrilen	Prisoner Challenge (IOI22_prison)	C++17	0 / 100	1 ms	340 KiB

prison

#include "prison.h"
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
using arr = array<int, 2>;
using arrr = array<int, 3>;



std::vector<std::vector<int>> devise_strategy(int n) {
    int x = 500, s = x + 1;
    vector<vector<int>> output(s, vector<int>(n + 1));

    for (int i = 1; i < s; i++) output[i][0] = 1;

    for (int i = 0; i < n + 1; i++) output[0][i] = i;

    for (int i = 1; i < s; i++)
    {
        for (int y = 1; y < n + 1; y++)
        {
            if (i > y) output[i][y] = -1;
            else output[i][y] = -2;
        }
    }   

    // for (int i = 0; i < s; i++) cout << output[i][0] << "\n";
    
    return output;
}

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