Submission #660762

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

prison

#include <bits/stdc++.h>
using namespace std;
int k = 30;
std::vector<std::vector<int>> devise_strategy(int n){
	vector<vector<int>> v(2*k + 1);
	for(int i = 0; i <= 2*k; ++i) v[i].resize(n+1);
	v[0][0] = 0;
	for(int i = 1; i <= 2*k; ++i) v[i][0] = (i <= k ? 1 : 0);
	for(int i = 1; i <= n; ++i){
		v[0][i] = (i / k) + 1;
	}
	for(int i = 1; i <= k; ++i){
		for(int j = 1; j <= n; ++j){
			if(j / k != i){
				v[i][j] = (j / k > i ? -1 : -2);
			}else{
				v[i][j] = (j % k) + 31;
			}
		}
	}
	for(int i = k+1; i <= k*2; ++i){
		for(int j = 1; j <= n; ++j){
			v[i][j] = (j % k > i - 31 ? -2 : -1);
		}
	}

	return v;
}

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