Submission #1105064

#	Time	Username	Problem	Language	Result	Execution time	Memory
1105064		fve5	Prisoner Challenge (IOI22_prison)	C++17	0 / 100	1153 ms	1115644 KiB

prison

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

vector<vector<int>> devise_strategy(int N) {
    vector<vector<int>> ans;

    auto rec = [&](auto &&rec, int l, int r, bool fst) -> int {
        int sz = ans.size();
        ans.emplace_back(N + 1);
        ans[sz][0] = fst;

        int m = (l + r) / 2;

        for (int i = 1; i <= N; i++) {
            if (i <= l)
                ans[sz][i] = fst ? -2 : -1;
            else if (i >= r - 1)
                ans[sz][i] = fst ? -1 : -2;
            else if (i < m)
                ans[sz][i] = rec(rec, l, m, !fst);
            else
                ans[sz][i] = rec(rec, m, r, !fst);
        }

        return sz;
    };

    rec(rec, 1, N + 1, true);
    return ans;
}

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