Submission #660758

#TimeUsernameProblemLanguageResultExecution timeMemory
660758mychecksedadPrisoner Challenge (IOI22_prison)C++17
5 / 100
23 ms19124 KiB
#include <bits/stdc++.h>
using namespace std;
std::vector<std::vector<int>> devise_strategy(int n){
	vector<vector<int>> v(n + 1);
	for(int i = 0; i <= n; ++i) v[i].resize(n+1);
	v[0][0] = 0;
	for(int i = 1; i <= n; ++i) v[i][0] = 1;
	for(int i = 1; i <= n; ++i){
		v[0][i] = i;
	}
	for(int i = 1; i <= n; ++i){
		for(int j = 1; j <= n; ++j){
			v[i][j] = (i < j ? -1 : -2);
		}
	}

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