제출 #1081064

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1081064		Hectorungo_18	죄수들의 도전 (IOI22_prison)	C++17	0 / 100	4 ms	748 KiB

prison

#include <bits/stdc++.h>

// #include "messy.h"
using namespace std;

mt19937 gnd(time(nullptr));
// #define f first
// #define s second
// #define int long long


vector<vector<int>> devise_strategy(int n){

    int mx = log2(n);
    // mx-=1;
    vector<vector<int>> v(2*mx+1, vector<int> (n+1));
    int la = 2*mx;
    int cnt = 4;
    for(int i = la; i >= 0; i--){
        if(cnt > 2){
            v[i][0]=1;
        }
        else{
            v[i][0]=0;
        }
        cnt--;
        if(cnt == 0) cnt=4;
    }
    v[0][0]=0;

    for(int i = 1; i <= n; i++){
        if(i&(1<<mx)) v[0][i]=2*mx;
        else v[0][i]=2*mx-1;
    }
     cnt = 4;
    for(int i = 2*mx-2; i >= -1; i--){
        i+=2;
        
        if(cnt == 4){
            int cur = (i-1)/2+1;
            for(int j = 1; j <= n; j++){
                if(j&(1<<cur)){
                    if(j&(1<<(cur-1))){
                        if(i >= 3){
                            v[i][j]=i-2;
                        }
                        else{
                            v[i][j]=-1;
                        }
                    }
                    else{
                        if(i >= 3){
                            v[i][j]=i-3;
                        }
                        else{
                            v[i][j]=-2;
                        }
                    }
                }
                else v[i][j]=-2;
            }
        }
        else if(cnt == 3){
            int cur = (i-1)/2+1;
            for(int j = 1; j <= n; j++){
                if((j&(1<<cur)) == 0){
                    if(j&(1<<(cur-1))){
                        if(i >= 3){
                            v[i][j]=i-1;
                        }
                        else{
                            v[i][j]=-1;
                        }
                    }
                    else{
                        if(i >= 3){
                            v[i][j]=i-2;
                        }
                        else{
                            v[i][j]=-2;
                        }
                    }
                }
                else v[i][j]=-1;
            }
        }
        else if(cnt == 2){
            int cur = (i-1)/2+1;
            for(int j = 1; j <= n; j++){
                if(j&(1<<cur)){
                    if(j&(1<<(cur-1))){
                        if(i >= 3){
                            v[i][j]=i-2;
                        }
                        else{
                            v[i][j]=-1;
                        }
                    }
                    else{
                        if(i >= 3){
                            v[i][j]=i-3;
                        }
                        else{
                            v[i][j]=-2;
                        }
                    }
                }
                else v[i][j]=-2;
            }
        }
        else{
            int cur = (i-1)/2+1;
            for(int j = 1; j <= n; j++){
                if((j&(1<<cur)) == 0){
                    if(j&(1<<(cur-1))){
                        if(i >= 3){
                            v[i][j]=i-1;
                        }
                        else{
                            v[i][j]=-1;
                        }
                    }
                    else{
                        if(i >= 3){
                            v[i][j]=i-2;
                        }
                        else{
                            v[i][j]=-2;
                        }
                    }
                }
                else v[i][j]=-1;
            }
        }
        cnt--;
        if(cnt == 0) cnt = 4;
        i-=2;
    }
    return v;
}

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