Submission #830324

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

prison

#include "prison.h"
#include <bits/stdc++.h>
using namespace std;
typedef unsigned long long ll;
 
vector<vector<int>> devise_strategy(int n) {
    vector<vector<int>> ans(27,vector<int>(n+1));
    for(int i=1;i<=n;i++){
        int curr=1;
        curr+=(i>>12)&1;
        ans[0][i]=curr;
    }
    int move=12;
    for(int i=1; i <=26;i++){
        int curr=((i+1)/2)*2 + 1;
        int bag=(curr/2)%2;
        ans[i][0]=bag;
        for(int j=1; j <=n;j++){
            curr=((i+1)/2)*2 + 1;
            if(i%2){
                if(((j>>move)&1)){
                    if(bag) ans[i][j]=-1;
                    else ans[i][j]=-2;
                } else{
                    curr+=((j>>(move-1))&1);
                    ans[i][j]=min(curr,26);
                }
            } else{
                if(((j>>move)&1) == 0){
                    if(bag) ans[i][j]=-2;
                    else ans[i][j]=-1;
                } else{
                    curr+=((j>>(move-1))&1);
                    ans[i][j]=min(curr,26);
                }
            }
        }
        if(bag%2==0) move--;
    }
    return ans;
}
 
// void solve(){
//     int n; cin >> n;
//     vector<vector<int>> arr=devise_strategy(n);
//     for(auto c : arr){
//         for(auto i : c) cout << i << ' ';
//         cout << endl;
//     }
// }
 
// int main(){
//     ios::sync_with_stdio(false);cout.tie();cin.tie();
//     int t=1;
//     // cin >> t;
//     while(t--){
//         solve();
//     }
// }

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