Submission #1236467

#	Time	Username	Problem	Language	Result	Execution time	Memory
1236467		CyberCow	죄수들의 도전 (IOI22_prison)	C++20	0 / 100	0 ms	324 KiB

prison

#include "prison.h"
using namespace std;

vector<vector<int>> devise_strategy(int N)
{
	vector<vector<int>> ans(N + 1, vector<int> (N + 1, 0));
	ans[0][0] = 0;
	for (int i = 1; i <= N; i++)
	{
		ans[0][i] = i / 16 + 1;
	}
	for (int i = 1; i <= N; i++)
	{
		if (i <= 32)
		{
			int ademimas = i - 1;
			ans[i][0] = 1;
			for (int j = 1; j <= N; j++)
			{
				int bdemimas = j / 16;
				if (ademimas < bdemimas)
				{
					ans[i][j] = -1;
				}
				else if (ademimas > bdemimas)
				{
					ans[i][j] = -2;
				}
				else
				{
					ans[i][j] = j % 16 + 33;
				}
			}
		}
		else
		{
			int bverj = i - 33;
			for (int j = 1; j <= N; j++)
			{
				if ((j % 16) < bverj)
				{
					ans[i][j] = -1;
				}
				else
				{
					ans[i][j] = -2;
				}
			}
		}
	}
	return ans;
}

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