#include "prison.h"
#include <bits/stdc++.h>
using namespace std;
std::vector<std::vector<int>> devise_strategy(int N) {
// 0 7 -> trit in A
vector v(26, vector<int>(N+1));
auto get_trit = [&](auto num, auto stelle){
for(int k=0; k<7-stelle; k++){
num /= 3;
}
return num % 3;
};
for(int x=0; x<=24; x++){
int stelle = (x-1)%8;
int o_trit = (x-1)/8;
int is_b = stelle%2;
if(x==0)
v[x][0] = 1;
else
v[x][0] = is_b;
for(int j=0; j<N; j++){
if(x==0){
v[x][j+1] = 1 + 8 * get_trit(j, 0);
}else{
if(get_trit(j, stelle) == o_trit){
int ntrit = get_trit(j, stelle+1);
if(stelle==6 and (ntrit == 0 or ntrit == 2)){
v[x][j+1] = is_b^(ntrit==0) ? -1 : -2;
}else{
v[x][j+1] = 8 * ntrit + stelle + 2;
}
}else{
v[x][j+1] = is_b^(get_trit(j, stelle)<o_trit) ? -1 : -2;
}
}
}
}
// redundant (stelle 7, trit 1)
// redundant (stelle 7, trit 2)
/*
for(int i=0; i<v.size(); i++){
for(int j=0; j<v[i].size(); j++)
cout << v[i][j] << " ";
cout << endl;
}
cout << endl;
*/
return v;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
344 KB |
Output is correct |
2 |
Correct |
1 ms |
344 KB |
Output is correct |
3 |
Correct |
1 ms |
348 KB |
Output is correct |
4 |
Correct |
2 ms |
348 KB |
Output is correct |
5 |
Correct |
2 ms |
348 KB |
Output is correct |
6 |
Correct |
2 ms |
344 KB |
Output is correct |
7 |
Correct |
1 ms |
348 KB |
Output is correct |
8 |
Correct |
2 ms |
348 KB |
Output is correct |
9 |
Correct |
1 ms |
348 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
348 KB |
Output is correct |
2 |
Correct |
1 ms |
500 KB |
Output is correct |
3 |
Correct |
1 ms |
348 KB |
Output is correct |
4 |
Correct |
1 ms |
348 KB |
Output is correct |
5 |
Correct |
1 ms |
348 KB |
Output is correct |
6 |
Correct |
1 ms |
344 KB |
Output is correct |
7 |
Correct |
1 ms |
348 KB |
Output is correct |
8 |
Correct |
1 ms |
348 KB |
Output is correct |
9 |
Correct |
1 ms |
348 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
344 KB |
Output is correct |
2 |
Partially correct |
0 ms |
348 KB |
Output is partially correct |
3 |
Partially correct |
1 ms |
348 KB |
Output is partially correct |
4 |
Partially correct |
5 ms |
604 KB |
Output is partially correct |
5 |
Partially correct |
9 ms |
944 KB |
Output is partially correct |
6 |
Partially correct |
11 ms |
1116 KB |
Output is partially correct |
7 |
Partially correct |
12 ms |
1112 KB |
Output is partially correct |
8 |
Partially correct |
1 ms |
348 KB |
Output is partially correct |
9 |
Partially correct |
1 ms |
348 KB |
Output is partially correct |
10 |
Partially correct |
2 ms |
348 KB |
Output is partially correct |
11 |
Partially correct |
5 ms |
600 KB |
Output is partially correct |
12 |
Partially correct |
9 ms |
1116 KB |
Output is partially correct |