# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1078590 | ArthuroWich | Prisoner Challenge (IOI22_prison) | C++17 | 1 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<bits/stdc++.h>
using namespace std;
vector<vector<int>> devise_strategy(int n) {
vector<vector<int>> s(sqrt(n)+1, vector<int>(n+1, 0));
s[0][0] = 0;
for (int i = 0; i <= n; i++) {
s[0][i] = i;
}
for (int i = 1; i <= n; i++) {
s[i][0] = 1;
}
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= sqrt(n); j++) {
if (i*i <= j) {
s[i][j] = -1;
} else {
s[i][j] = -2;
}
}
}
return s;
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |