Submission #638209

#TimeUsernameProblemLanguageResultExecution timeMemory
638209bluePrisoner Challenge (IOI22_prison)C++17
5 / 100
22 ms19000 KiB
#include "prison.h"
#include <bits/stdc++.h>
using namespace std;

using vi = vector<int>;
using vvi = vector<vi>;
using pii = pair<int, int>;
using vpii = vector<pii>;
using vvpii = vector<vpii>;

vvi devise_strategy(int N)
{
	vvi s(1+N, vi(1+N, -1));

	s[0][0] = 0;
	for(int i = 1; i <= N; i++)
		s[i][0] = 1;

	for(int i = 1; i <= N; i++)
		s[0][i] = i;

	for(int i = 1; i <= N; i++)
	{
		for(int j = 1; j <= N; j++)
		{
			if(i < j)
				s[i][j] = -1;
			else
				s[i][j] = -2;
		}
	}


	return s;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...