Submission #710690

#	Time	Username	Problem	Language	Result	Execution time	Memory
710690		t6twotwo	Prisoner Challenge (IOI22_prison)	C++17	65 / 100	12 ms	1140 KiB

prison

#include "prison.h"
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
vector<vector<int>> devise_strategy(int N) {
    vector ans(25, vector<int>(N + 1));
    for (int i = 0; i < 25; i++) {
        int x = 12 - (i + 1) / 2;
        ans[i][0] = x % 2;
        for (int j = 1; j <= N; j++) {
            if (i && i % 2 != (j >> (x + 1)) % 2) {
                ans[i][j] = -2 + (i ^ x) % 2;
            } else if (i >= 23) {
                ans[i][j] = -1 - j % 2;
            } else {
                ans[i][j] = (i + 3) / 2 * 2 - (j >> x) % 2;
            }
        }
    }
    return ans;
}

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