Submission #809136

#	Time	Username	Problem	Language	Result	Execution time	Memory
809136		Liudas	Prisoner Challenge (IOI22_prison)	C++17	38 / 100	22 ms	1612 KiB

prison

#include "prison.h"

#include <cassert>
#include <cstdio>
#include <bits/stdc++.h>
#include <string>
#include <vector>
using namespace std;
static constexpr int kNumPrisoners = 500;
vector<vector<int>> devise_strategy(int N){
    int x = 38;
    vector<vector<int>> strat(x + 1, vector<int>(N+1));
    for(int i = 0; i <= x; i ++){
        if(i < 13){
            strat[i][0] = 0;
        }
        else{
            strat[i][0] = 1;
        }
        if(i < 13){
            int bit = (i == 0 ? 12 : (i - 1) % 12);
            for(int j = 1; j <= N; j ++){
                if(((1 << bit) & j)){
                    strat[i][j] = 26 + bit;
                }
                else{
                    strat[i][j] = 13 + bit;
                }
            }
        }
        else{
            int sett = i >= 26;
            int bit = i % 13;
            for(int j = 1; j <= N; j ++){
                if(((1 << bit) & j) && sett){
                    strat[i][j] = 1 + bit-1;
                }
                else if (!sett && ((1 << bit) & j)){
                    strat[i][j] = -1;
                }
                else if (sett && !((1 << bit) & j)){
                    strat[i][j] = -2;
                }
                else{
                    strat[i][j] = 1 + bit-1;
                }
            }
        }
    }
    return strat;
}

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