Submission #1232074

#	Time	Username	Problem	Language	Result	Execution time	Memory
1232074		ssafarov	Prisoner Challenge (IOI22_prison)	C++20	0 / 100	1 ms	580 KiB

prison

#include "prison.h"
#include <bits/stdc++.h>
#define ll long long
#define pb push_back
#define en '\n'
#define all(a) a.begin() , a.end()
#define fi first
#define se second

using namespace std;

vector<vector<int>> devise_strategy(int N) {
	vector<vector<int>> v(40, vector<int> (N + 1));
	for(ll i = 0; i <= 39; ++i){
		if(i < 10){
			v[i][0] = 0;
		}else v[i][0] = 1;
	}
	for(ll i = 0; i <= 39; ++i){
		for(ll j = 1; j <= N; ++j){
			int x = j;
			int ind = i % 10;
			int nd;
			if(ind == 0){
				nd = 0;
				while(x){
					nd++;
					x /= 3;
				}
			}else{
				while(ind){
					nd = x % 3;
					x /= 3;
					ind--;
				}
			}
			ind = i % 10;
			nd++;
			if(i >= 10){
				int pind = i / 10;
				if(nd > pind) v[i][j] = -1;
				else if(nd < pind) v[i][j] = -2;
				else{
					v[i][j] = ind + 1;
				}
			}else{
				v[i][j] = nd * 10 + ind;
			}
		}
	}
	return v;
}


// int main(){
	// int n; cin >> n;
	// int a, b; cin >> a >> b;
	// vector<vector<int>> v = devise_strategy(n);
// }

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