Submission #1216029

#	Time	Username	Problem	Language	Result	Execution time	Memory
1216029		bangan	Prisoner Challenge (IOI22_prison)	C++20	80 / 100	7 ms	1096 KiB

prison

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

const int X = 22;

void debug(vector<vector<int>> s) {
	int N = s[0].size() - 1;
	cout << "\t";
	for (int i=0; i<=N; i++) cout << i << "\t";
	cout << "\n";
	for (int i=0; i<=X; i++) {
		cout << i << "\t";
		for (int j=0; j<=N; j++) cout << s[i][j] << "\t";
		cout << "\n";
	}
}

int kth(int x, int k) {
	k = 7-k;
	while (k--) x/=3;
	return x%3;
}

std::vector<std::vector<int>> devise_strategy(int N) {
	// cout << big(5000) << endl;
	vector s(X+1, vector<int>(N+1));
	s[0][0] = 0;
	for (int i=1; i<=22; i++) {
		int b = i-1;
		b = (b - b%3) / 3;
		s[i][0] = 1 - b%2;
	}
	for (int i=1; i<=N; i++) s[0][i] = kth(i, 0) + 1;
	for (int i=1; i<=21; i++) for (int j=1; j<=N; j++) {
		int b = i-1;
		int r = b%3;
		b = (b - b%3) / 3;
		if (r < kth(j, b)) s[i][j] = -(1-s[i][0]+1);
		else if (r == kth(j, b)) s[i][j] = 3 * (b+1) + kth(j, b+1) + 1;
		else if (r > kth(j, b)) s[i][j] = -(s[i][0]+1);
		if (b==6 && r == kth(j, b)) {
			if (kth(j, b+1)==0) s[i][j] = -(s[i][0]+1);
			else if (kth(j, b+1)==1) s[i][j] = 22;
			else if (kth(j, b+1)==2) s[i][j] = -(1-s[i][0]+1);
		}
	}
	for (int i=1; i<=N; i++) {
		if (kth(i, 7) == 0) s[22][i] = -(s[22][0]+1);
		else s[22][i] = -(1-s[22][0]+1);
	}
	// debug(s);
	return s;
}

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