Submission #1229538

#	Time	Username	Problem	Language	Result	Execution time	Memory
1229538		kaltspielerhy	죄수들의 도전 (IOI22_prison)	C++20	0 / 100	0 ms	324 KiB

prison

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

vector<vector<int>> devise_strategy(int N) {
    vector<vector<int>> s(N+1, vector<int>(N+1));

    s[0][0] = 0;
    for (int A = 1; A <= N; A++) {
        s[0][A] = A;
    }

    for (int A = 1; A <= N; A++) {
        s[A][0] = 1;
        int B = 1;
        while (A > B) {
            s[A][B] = -1;
            B++;
        }
        while (B <= N) {
            s[A][B] = -2;
            B++;
        }
    }

    return s;
}

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