Submission #1321313

#	Time	Username	Problem	Language	Result	Execution time	Memory
1321313		wonderfull	Prisoner Challenge (IOI22_prison)	C++20	0 / 100	1 ms	332 KiB

prison

#include "prison.h"
#include <bits/stdc++.h>
#include <vector>

using namespace std;

std::vector<std::vector<int>> devise_strategy(int N) {
	vector<vector<int>> a(N + 1, vector<int>(N + 1, 0));
	for(int i = 0; i <= N; i++) a[0][i] = i;
	for(int i = 1; i < N; i++) a[i][0] = 1;
	int cnt = 1;
 	for(int i = 1; i < N; i++) {
		for(int j = 1; j <= N; j++) {
			if(j <= cnt) a[i][j] == -1;
			else a[i][j] = -2;
		}
		cnt++;
	}
	return a;
}

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