제출 #650470

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
650470		NaimSS	죄수들의 도전 (IOI22_prison)	C++17	65 / 100	15 ms	1108 KiB

prison

#include "prison.h"

#include <bits/stdc++.h>
#include <vector>
using namespace std;
typedef vector<int> vi;
#define pb push_back

std::vector<std::vector<int>> devise_strategy(int N) {

  vector<vi> s;


  vi cur(N+1);
  cur[0]=0;

  int k = 1,pwr=0;
  while(k*2 <= N)k*=2,pwr++;

  //cout << N<<" "<<k<<" "<<pwr<<endl;

  // row 0:
  for(int i=1;i<=N;i++){
    // A tem i caras:
    if(i>>pwr&1){
      cur[i] = 2;
    }else cur[i]=1;
  }
  s.pb(cur);

  int box = 1;
  int posi=2;
  int mx = (pwr) * 2;
  while(pwr>0){

    for(int it=0;it<2;it++){
      vi cur(N+1);

      cur[0] = box;
      for(int i=1;i<=N;i++){
        int have = i>>pwr&1;

        if(have && !it){
          cur[i] = -1-(box^1);
        }
        else if(!have && it){
          cur[i] = -1-box;
        }
        else{

          if(pwr>1){
            int haveNv = i>>(pwr-1)&1;
            if(haveNv)cur[i] = posi+2;
            else cur[i] = posi+1;
          }else{
            int haveNv = i>>(pwr-1)&1;
            if(haveNv)cur[i] = -1-(box^1);
            else cur[i] = -1-box;
          }

        }



        if(cur[i]>mx)cur[i]=-1;
      }
      s.pb(cur);
    }

    posi+=2;
    box^=1;
    pwr--;  
  }

  return s;
}

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