Submission #1210778

#	Time	Username	Problem	Language	Result	Execution time	Memory
1210778		Nicolaikrob	Prisoner Challenge (IOI22_prison)	C++20	0 / 100	5 ms	9796 KiB

prison

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

vector<vector<int>> devise_strategy(int n) {
	int x = (n+1)/2;
	vector<vector<int>> S(x+1, vector<int> (n+1, 0));
	for(int i = 0; i <= x; i++)
		for(int j = 0; j <= n; j++)
			S[i][j] = i+1;
	
	S[0][0] = 0, S[0][1] = -1, S[0][n] = -2;
	for(int i = 1; i <= x; i++) {
		S[i][0] = i&1 ? 1 : 0;
		S[i][i] = S[i][i+1] = i&1 ? -2 : -1;
		S[i][n-i+1] = S[i][n-i] = i&1 ? -1 : -2;
	}
	// for(int i = 0; i <= x; i++) {
	// 	for(int j = 0; j <= n; j++) {
	// 		cout << S[i][j] << ' ';
	// 	}
	// 	cout << endl;
	// }
	return S;
}

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