# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
628565 | kingmoshe | Prisoner Challenge (IOI22_prison) | C++17 | 15 ms | 1108 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>
#include <iostream>
int get_bit_value(int num, int bit_id) {
if (bit_id < 0) {
return 0;
}
if (bit_id == 0) {
return num % 2;
}
return get_bit_value(num / 2, bit_id - 1);
}
int get_maximal_bit_id(int num) {
if (num < 2) {
return 0;
}
return 1 + get_maximal_bit_id(num / 2);
}
std::vector<std::vector<int>> devise_strategy3(int N) {
int x = (get_maximal_bit_id(N) + 2) * 3;
x = 38;
std::vector<std::vector<int>> s(x + 1, std::vector<int>(N + 1));
for (int i = 0; i <= x; i++) {
for (int j = 0; j <= N; j++) {
s[i][j] = 0;
}
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |