Submission #640751

#TimeUsernameProblemLanguageResultExecution timeMemory
6407511zaid1Prisoner Challenge (IOI22_prison)C++17
10 / 100
7 ms724 KiB
#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 == 0) v[i][0] = 0;
        else v[i][0] = (i/2)%2;
        for (int j = 1; j <= n; j++) {
            if (i) {
                int d = (j>>(i/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/2-1)*2 + (j>>(i/2-2))%2;
            } else {
                v[i][j] = 13*2+(j>>12)%2;
            }
        }
    } return v;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...