# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
730297 | ismayil | Prisoner Challenge (IOI22_prison) | C++17 | 0 ms | 0 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#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;
}
void solve(){
vector<vector<int>> v = devise_strategy(2);
for(auto i : v){
for(auto j : i){
cout << j << " ";
}
cout << endl;
}
}
signed main()
{
ios::sync_with_stdio(0);
cin.tie(0); cout.tie(0);
//freopen("output.txt", "w", stdout);
int t = 1;
//cin >> t;
for(int i = 1; i <= t; i++){
//printf("Case #%d: ", i);
solve();
}
}