Submission #628690

#	Time	Username	Problem	Language	Result	Execution time	Memory
628690		abdzag	Prisoner Challenge (IOI22_prison)	C++17	0 / 100	1 ms	468 KiB

prison

#include<bits/stdc++.h>
#include "prison.h"

using namespace std;


std::vector<std::vector<int>> devise_strategy(int N) {
    int n=N;
    vector<vector<int>> ans(5001,vector<int>(N+1));
    ans[0][0]=1;
    for(int i=1;i<=n;i++){
        int next_index=12;
        ans[0][i]=next_index*2+(((1<<next_index)&i)?2:1);
    }   
    for(int i=1;i<=30;i++){
        int current_index=(i-1)/2;
        int current_value=(i-1)%2;
        ans[i][0]=current_index%2;
        // if(i==3)cout<<current_index<<" "<<current_value<<endl;
        for(int j=1;j<=n;j++){
            if(((j&(1<<current_index))!=0)<current_value){
                if(ans[i][0])ans[i][j]=-1;
                else ans[i][j]=-2;
            }
            else if(((j&(1<<current_index))!=0)>current_value){
                if(ans[i][0])ans[i][j]=-2;
                else ans[i][j]=-1;
            }
            else {
                int next_index=current_index-1;
                if(next_index>=0) ans[i][j]=next_index*2+(((1<<next_index)&j)?2:1);
            }
        }
    }
    // cout<<ans[3][2]<<endl;
    return ans;
}

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