Submission #640764

#	Time	Username	Problem	Language	Result	Execution time	Memory
640764		1zaid1	Prisoner Challenge (IOI22_prison)	C++17	56 / 100	17 ms	1212 KiB

prison

#include "prison.h"

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

vector<vector<int>> devise_strategy(int n) {
    vector<int> p; for (int i = 0; i < 15; i++) p.push_back(1<<i);
    vector<vector<int>> v(27, vector<int>(n+1, 0));
    for (int i = 0; i < 27; i++) {
        if (i) v[i][0] = ((i+1)/2)%2;
        for (int j = 1; j <= n; j++) {
            if (i) {
                int d = (j>>((i+1)/2-1))%2;
                if (d > i%2) v[i][j] = -1-!v[i][0];
                else if (d < i%2) v[i][j] = -1-(v[i][0]);
                else v[i][j] = ((i+1)/2-1)*2 - (j>>((i+1)/2-2))%2;
            } else {
                v[i][j] = 13*2-(j>>12)%2;
            }
        }
    } return v;
}

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