제출 #852661

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
852661		weajink	Prisoner Challenge (IOI22_prison)	C++17	0 / 100	0 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;
    //cout<<"Straszny amongier\n";
    vector<vector<int> > tab(2*x+1);
    tab[0].resize(N+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++){
        cout<<i<<"\n";
        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));
            }
            //cout<<i<<" "<<j<<" "<<tab[i][j]<<"\n";
        }
    }
    return tab;
}

/*int main(){
    vector<vector<int> > strategia = devise_strategy(10);
    for (auto j : strategia){
        for (int i : j){
            cout<<i<<" ";
        }
        cout<<"\n";
    }
}*/

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