# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
854775 | Trytytka | Prisoner Challenge (IOI22_prison) | C++17 | 0 ms | 440 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.
#include <bits/stdc++.h>
using namespace std;
vector<vector<int>> devise_strategy(int N){
vector<vector<int>> s(60, vector<int>(N));
s[0][0]=0;
s[1][0]=0;
s[2][0]=0;
for (int i = 3; i < 60; i++){
if(i%3==2) s[i][0]=1;
else s[i][0]=0;
}
for (int j = 1; j < N; j++){
s[0][j]=3+(j&(1<<13)!=0);
}
for (int i = 1; i < 3; i++){
for (int j = 1; j < N; j++){
s[i][j]=0;
}
}
for (int i = 3; i < 60; i+=3){
for (int j = 1; j < N; j++){
if(j&(1<<(13-(i/3-1)))) s[i][j]=-1;
else s[i][j]=i+2;
}
}
for (int i = 4; i < 60; i+=3){
for (int j = 1; j < N; j++){
if((j&(1<<(13-(i/3-1))))==0) s[i][j]=-2;
else s[i][j]=i+1;
}
}
for (int i = 5; i < 60; i+=3){
for (int j = 1; j < N; j++){
s[i][j]=i+1+(j&(1<<(13-(i/3)))!=0);
}
}
return s;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |