Submission #834048

#	Time	Username	Problem	Language	Result	Execution time	Memory
834048		Trumling	죄수들의 도전 (IOI22_prison)	C++17	56 / 100	14 ms	1108 KiB

prison

#include "prison.h"
#include<bits/stdc++.h>
using namespace std;

#define F first
#define S second
#define all(x) x.begin(),x.end()
typedef long long ll;
#define pb push_back
#define INF 9999999999999999
vector<vector<int>> devise_strategy(int N) {

vector<vector<int>>s(27,vector<int>(N+1,0));
s[0][0]=0;
for(int i=1;i<=N;i++)
s[0][i]=(((1<<12)&i)?1:2);

ll idx=1;
ll now=12;
ll j=1;

while(now>=0)
{
s[j][0]=idx;
s[j+1][0]=idx;
idx=(1-idx);
for(int i=1;i<=N;i++)
{
  if((1<<now)&i)
  {
    s[j+1][i]=((idx)?-2:-1);
    if(now!=0)
    s[j][i]=(((1<<(now-1))&i)?j+2:j+3);
  }
  else 
  {
    s[j][i]=idx-2;
    if(now!=0)
    s[j+1][i]=(((1<<(now-1))&i)?j+2:j+3);
  }
  
}
now--;
j+=2;
}

return s;
}

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