Submission #852658

#	Time	Username	Problem	Language	Result	Execution time	Memory
852658		weajink	죄수들의 도전 (IOI22_prison)	C++17	0 / 100	1 ms	348 KiB

prison

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;

vector<vector<int> > devise_strategy(int N){
    int x = 12;
    vector<vector<int> > tab(2*x+1);
    tab[0][0] = 0;
    for (int j = 1; j <= N; j++){
        if (j&(1<<x)) tab[0][j] = 13;
        tab[0][j] = 1;
    } 
    for (int i = 1; i <= 2*x; i++){
        tab[i].resize(N+1);
        int ktorybit = (i-1)%x;
        int kolorbitu = (i-1)/x;
        if (!(ktorybit%2)) tab[i][0] = 1;
        else tab[i][0] = 0;
        for (int j = 1; j <= N; j++){
            if (kolorbitu != bool(j&(1<<ktorybit))){
                if (kolorbitu){
                    if (tab[i][0] == 0) tab[i][j] = -2;
                    else tab[i][j] = -1;
                }else{
                    if (tab[i][0] == 0) tab[i][j] = -1;
                    else tab[i][j] = -2;
                }
            }else{
                tab[i][j] = 1+ktorybit-1+12*bool(j&(1<<ktorybit));
            }
        }
    }
    return tab;
}

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