Submission #1164179

#	Time	Username	Problem	Language	Result	Execution time	Memory
1164179		SmuggingSpun	죄수들의 도전 (IOI22_prison)	C++20	39.50 / 100	11 ms	1608 KiB

prison

#include<bits/stdc++.h>
#include "prison.h"
using namespace std;
vector<vector<int>>devise_strategy(int n){
    vector<vector<int>>s(38, vector<int>(n + 1));
    fill(s[s[0][0] = 0].begin() + 1, s[0].end(), 13);
    for(int i = 1; i < 14; i++){
        s[i][0] = 0;
        for(int j = 1; j <= n; j++){
            if(1 << (i - 1) & j){
                s[i][j] = (i == 1 ? -2 : i + 24);
            }
            else{
                s[i][j] = (i == 1 ? -1 : i + 12);
            }
        }
    }
    for(int i = 14; i < 26; i++){
        s[i][0] = 1;
        for(int j = 1; j <= n; j++){
            if(1 << (i - 13) & j){
                s[i][j] = -1;
            }
            else{
                s[i][j] = i - 13;
            }
        }
    }
    for(int i = 26; i < 38; i++){
        s[i][0] = 1;
        for(int j = 1; j <= n; j++){
            if(1 << (i - 25) & j){
                s[i][j] = i - 25;
            }
            else{
                s[i][j] = -2;
            }
        }
    }
    return s;
}   

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