Submission #828140

#	Time	Username	Problem	Language	Result	Execution time	Memory
828140		ttamx	Prisoner Challenge (IOI22_prison)	C++17	41 / 100	18 ms	1492 KiB

prison

#include "prison.h"
#include <bits/stdc++.h>

using namespace std;

const int N=5005;

int n;

vector<vector<int>> devise_strategy(int _n){
	n=_n;
	int x=36;
	vector<vector<int>> s(x+1,vector<int>(n+1));
	int id=0;
	for(int i=12;i>=1;i--){
		s[id][0]=0;
		for(int j=1;j<=n;j++){
			if(j>>i&1){
				s[id][j]=id+1;
			}else{
				s[id][j]=id+2;
			}
		}
		id++;
		s[id][0]=1;
		for(int j=1;j<=n;j++){
			if(j>>i&1){
				s[id][j]=id+2;
			}else{
				s[id][j]=-2;
			}
		}
		id++;
		s[id][0]=1;
		for(int j=1;j<=n;j++){
			if(j>>i&1){
				s[id][j]=-1;
			}else{
				s[id][j]=id+1;
			}
		}
		id++;
	}
	s[id][0]=0;
	for(int j=1;j<=n;j++){
		if(j&1){
			s[id][j]=-2;
		}else{
			s[id][j]=-1;
		}
	}
	return s;
}

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