# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
888142 | abcvuitunggio | Prisoner Challenge (IOI22_prison) | C++17 | 10 ms | 1116 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 "prison.h"
#include <vector>
using namespace std;
int pw[10];
vector <vector <int>> devise_strategy(int n){
pw[0]=1;
for (int i=1;i<10;i++)
pw[i]=pw[i-1]*3;
vector <vector <int>> res(25,vector <int> (n+1,0));
for (int i=1;i<=n;i++)
res[0][i]=(i/pw[7]%3)*8+1;
for (int i=1;i<25;i++){
int b=(i-1)%8;
res[i][0]=b&1^1;
for (int j=1;j<=n;j++)
if (j/pw[7-b]%3!=(i-1)/8)
res[i][j]=(j/pw[7-b]%3<(i-1)/8?-1-res[i][0]:res[i][0]-2);
else if (b<7)
res[i][j]=(j/pw[6-b]%3)*8+b+2;
}
return res;
}
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... |