Submission #730298

#	Time	Username	Problem	Language	Result	Execution time	Memory
730298		ismayil	Prisoner Challenge (IOI22_prison)	C++17	0 / 100	1 ms	296 KiB

prison

#pragma GCC target ("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
#define endl '\n'
using namespace std;
vector<vector<int>> devise_strategy(int N) {
	vector<vector<int>> s(27, vector<int>(N + 1, 0));
	for(int i = 0; i <= 26; i++){
		int d = i / 2;
		int bit = i % 2;
		if(d % 2 == 0) s[i][0] = 0;
		else s[i][0] = 1;
		for(int j = 1; j <= N; j++){
			int _bit = (j & (1<<(12 - d)));
			if(bit < _bit){
				if(d % 2 == 0) s[i][j] = -2;
				else s[i][j] = -1;
			}else if(bit > _bit){
				if(d % 2 == 0) s[i][j] = -1;
				else s[i][j] = -2;
			}else if(d == 13){
                s[i][j] = -2;
            }else{
				s[i][j] = (d + 1) * 2 + (j & (1<<(11 - d)));
			}
		}
	}
	return s;
}

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