Submission #762127

#	Time	Username	Problem	Language	Result	Execution time	Memory
762127		raysh07	Prisoner Challenge (IOI22_prison)	C++17	38 / 100	18 ms	1580 KiB

prison

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

vector<vector<int>> devise_strategy(int n) {
    vector<vector<int>> ans(39, vector<int>(n + 1));
    for (int i = 0; i <= 38; i++){
        if (i % 3 == 0) ans[i][0] = 0;
        else ans[i][0] = 1;
        
        for (int j = 1; j <= n; j++){
            int bit = 12 - (i/3);
            if (i % 3 == 0){
                ans[i][j] = i + 1 + (j >> bit & 1);
            } else {
                int ba = (i % 3) - 1;
                int bb = (j >> bit & 1);
                if (ba < bb) ans[i][j] = -1;
                else if (ba > bb) ans[i][j] = -2;
                else {
                    ans[i][j] = ((i/3) + 1) * 3;
                    if (ans[i][j] > 38) ans[i][j] = 0;
                }
            }
        }
    }
    return ans;
}

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