# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
979757 | sleepntsheep | Prisoner Challenge (IOI22_prison) | C++17 | 0 ms | 348 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<cstdio>
#include <vector>
std::vector<std::vector<int>> devise_strategy(int N) {
/*
* compare digits-by-digits
*
* On base B, this happens ln(N)/ln(B) iterations
* each iterations need B place to store the result,
* and another to denotes that one need to check the next bits
* f(B) = (B + 1) * ln(N) / ln (B)
*/
constexpr int B = 4, X = 29;
std::vector<std::vector<int> > s(X+1, std::vector<int>(N+1));
auto get = [&](int x, int i)
{
while(i--) x/=B;
return x%B;
};
for(int read=0;read<=X;++read)
{
auto write = [&](int j,int x) { s[read][j] = x; };
int at=(read)/(B+1);
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |