Submission #625794

#	Time	Username	Problem	Language	Result	Execution time	Memory
625794		sofapuden	Prisoner Challenge (IOI22_prison)	C++17	0 / 100	0 ms	212 KiB

prison

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

using namespace std;

vector<vector<int>> ans;
int n;

void fin(int p, int c, int l, int r, int pl, int pr, int b){
	for(int i = l; i <= r; ++i)ans[p][i] = 3*c+b;
	for(int i = pl; i<= l; ++i)ans[p][i] = ~ans[p][0];
	for(int i = r; i<= pr; ++i)ans[p][i] = ~(int)(!ans[p][0]);
	l++;
	r--;
	if(l > r)return;
	if(l+2 > r){
		int m = (l+r)>>1;
		fin(c*3+b,c+1,l,m,l-1,r+1,1);
		fin(c*3+b,c+1,m+1,r,l-1,r+1,2);
	}
	int d1 = l+(r-l)/3, d2 = r - (r-l)/3;
	fin(c*3+b,c+1,l,d1,l-1,r+1,1);
	fin(c*3+b,c+1,d1+1,d2,l-1,r+1,2);
	fin(c*3+b,c+1,d2+1,r,l-1,r+1,3);
}

vector<vector<int>> devise_strategy(int N) {
	n = N;
	ans.resize(21,vector<int>(N+1,0));
	for(int i = 0; i < 21; ++i)ans[i][0] = ((i+2)%6 < 3);
	fin(0,-1,1,N,1,N,3);
	return ans;
}

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