Submission #854848

#	Time	Username	Problem	Language	Result	Execution time	Memory
854848		Trytytka	죄수들의 도전 (IOI22_prison)	C++17	30 / 100	24 ms	2384 KiB

prison

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

vector<vector<int>> devise_strategy(int N){
	vector<vector<int>> s(60, vector<int>(N+1));
	s[0][0]=0;
	s[1][0]=0;
	s[2][0]=0;
	for (int i = 3; i < 60; i++){
		if(i%3==2) s[i][0]=0;
		else s[i][0]=1;
	}
	for (int j = 1; j <= N; j++){
		s[0][j]=3+((j&(1<<13))!=0);
	}
	for (int i = 1; i < 3; i++){
		for (int j = 1; j <= N; j++){
			s[i][j]=0;
		}
	}
	for (int i = 3; i < 60; i+=3){
		for (int j = 1; j <= N; j++){
			if(j&(1<<(13-(i/3-1)))) s[i][j]=-1;
			else s[i][j]=i+2;
		}
	}
	for (int i = 4; i < 60; i+=3){
		for (int j = 1; j <= N; j++){
			if((j&(1<<(13-(i/3-1))))==0) s[i][j]=-2;
			else s[i][j]=i+1;
		}
	}
	for (int i = 5; i < 60; i+=3){
		for (int j = 1; j <= N; j++){
			s[i][j]=min(59, i+1+((j&(1<<(13-(i/3))))!=0));
		}
	}
	return s;
}

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