Submission #785186

#TimeUsernameProblemLanguageResultExecution timeMemory
785186ono_de206Prisoner Challenge (IOI22_prison)C++17
5 / 100
21 ms19128 KiB
#include "prison.h"

#include<bits/stdc++.h>
using namespace std;

#define in insert
#define all(x) x.begin(),x.end()
#define pb push_back
#define eb emplace_back
#define ff first
#define ss second

//#define int long long
 
typedef long long ll;
typedef vector<int> vi;
typedef set<int> si;
typedef multiset<int> msi;
typedef pair<int, int> pii;
typedef vector<pii> vpii;

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