Submission #1021983

#	Time	Username	Problem	Language	Result	Execution time	Memory
1021983		pawned	Prisoner Challenge (IOI22_prison)	C++17	5 / 100	20 ms	19036 KiB

prison

#pragma GCC optimize("O1,O2,O3,Ofast,unroll-loops")

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

#define fi first
#define se second
#define pb push_back
typedef long long ll;
typedef pair<int, int> ii;
typedef vector<int> vi;

#include "prison.h"

vector<vi> devise_strategy(int N) {
	vector<vi> ans(N + 1, vi(N + 1, 0));
	// start is 0
	ans[0][0] = 0;
	for (int i = 0; i <= N; i++) {	// start is 0
		ans[0][i] = i;
	}
	for (int i = 1; i <= N; i++) {	// receive number i
		ans[i][0] = 1;
		for (int j = 1; j <= N; j++) {
			if (j < i)
				ans[i][j] = -2;
			else
				ans[i][j] = -1;
		}
	}
/*	cout<<"ANSWER: "<<endl;
	for (vi v : ans) {
		for (int x : v)
			cout<<x<<" ";
		cout<<endl;
	}*/
	return ans;
}

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