Submission #727841

#	Time	Username	Problem	Language	Result	Execution time	Memory
727841		ismayil	Prisoner Challenge (IOI22_prison)	C++17	5 / 100	26 ms	19108 KiB

prison

#pragma GCC optimize("O3")
#include "prison.h"
#include<bits/stdc++.h>
using namespace std;

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

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