Submission #1321267

#TimeUsernameProblemLanguageResultExecution timeMemory
1321267f112Prisoner Challenge (IOI22_prison)C++20
5 / 100
13 ms19232 KiB
#include "prison.h"

#include <bits/stdc++.h>

using namespace std;

vector< vector < int > > devise_strategy(int N) {
	vector < vector < int > > x(N + 1, vector < int > (N + 1));
	for (int i = 0; i <= N; ++i){
		if (i == 1) x[0][i] = -1;
		else if (i == N) x[0][i] = -2;
		else x[0][i] = i;
	}
	for (int i = 1; i <= N; ++i){
		for (int j = 1; j <= N; ++j){
			x[i][0] = 1;
			if (j < i) x[i][j] = -2;
			else if (j > i) x[i][j] = -1;	
			else x[i][j] = 0;
		}
	}
	return x;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...