# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1023051 | vjudge1 | Prisoner Challenge (IOI22_prison) | C++17 | 4 ms | 780 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;
std::vector<std::vector<int>> devise_strategy(int N){
vector<vector<int>> s(10 * 3, vector<int>(N + 1, 0));
for(int x = 0; x < s.size(); x++){
int k = 9 - x / 3;
if(x % 3 == 0){
s[x][0] = 0;
for(int i = 1; i <= N; i++){
s[x][i] = x + 1;
if(i & (1<<k)) s[x][i]++;
}
} else{
s[x][0] = 1;
for(int i = 1; i <= N; i++){
bool c = 0;
if(i & (1<<k)) c = 1;
if(k){
if(x%3 - 1 > c) s[x][i] = -2;
else if(x % 3 - 1 < c) s[x][i] = -1;
else s[x][i] = (x / 3 + 1) * 3;
} else{
if(x%3 - 1 > c) s[x][i] = -2;
else s[x][i] = -1;
}
}
}
}
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... |