Submission #660764

#	Time	Username	Problem	Language	Result	Execution time	Memory
660764		mychecksedad	Prisoner Challenge (IOI22_prison)	C++17	0 / 100	0 ms	212 KiB

prison

#include <bits/stdc++.h>
using namespace std;
int k = 3, p[9];
std::vector<std::vector<int>> devise_strategy(int n){
	p[0] = 1;
	for(int i = 1; i <= 8; ++i) p[i] = p[i - 1] * 3;
	vector<vector<int>> v(25);
	for(int i = 0; i <= 24; ++i) v[i].resize(n+1);
	v[0][0] = 0;
	for(int i = 1; i <= 24; ++i) v[i][0] = (((i-1)/3)%2 ? 0 : 1);
	for(int i = 1; i <= n; ++i){
		v[0][i] = (i / p[8]);
	}
	for(int i = 1; i <= 24; ++i){
		for(int j = 1; j <= n; ++j){
			int x = (i - 1) / 3;
			int val = (i - 1) % 3;
			int d = j;
			for(int l = 0; l < x; ++l) d /= 3;
			int divisor = p[8 - x];
			if(x % 3){
				if(d / divisor != val){
					v[i][j] = (d / divisor < val ? -2 : -1);
				}else{
					v[i][j] = d / divisor + (x * 3 + 1);
				}
			}else{
				if(d / divisor != val){
					v[i][j] = (d / divisor < val ? -1 : -2);
				}else{
					v[i][j] = d / divisor + (x * 3 + 1);
				}
			}
		}
	}

	return v;
}

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