Submission #805992

#	Time	Username	Problem	Language	Result	Execution time	Memory
805992		Liudas	Prisoner Challenge (IOI22_prison)	C++17	0 / 100	0 ms	212 KiB

prison

#include <bits/stdc++.h>
using namespace std;
vector<vector<int>> devise_strategy(int N){
    int x = 29;
    vector<vector<int>> strat(x + 1, vector<int>(N+1));
    for(int i = 0; i <= x; i ++){
        if(i / 10 % 2 == 0){
            strat[i][0] = 0;
        }
        else{
            strat[i][0] = 1;
        }
        if(i / 10 % 2 == 0){
            int bit = i % 10;
            for(int j = 1; j <= N; j ++){
                if(((1 << bit) & j)){
                    strat[i][j] = 30 + bit;
                }
                else{
                    strat[i][j] = 10 + bit;
                }
            }
        }
        else{
            int bit = i % 10;
            int sett = i / 20;
            for(int j = 1; j <= N; j ++){
                if(((1 << bit) & j) && sett){
                    strat[i][j] = 20 + 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] = bit-1;
                }
            }
        }
    }
    return strat;
}

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