# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
858649 | 2023-10-09T04:00:50 Z | Naxocist | Prisoner Challenge (IOI22_prison) | C++17 | 1 ms | 1624 KB |
#include "prison.h" #include <bits/stdc++.h>; using namespace std; vector<vector<int>> devise_strategy(int N) { int x = 500; vector<vector<int>> res(x+1, vector<int>(x+1, 0)); for(int j=1; j<=x; ++j) res[0][j] = j; for(int i=1; i<=x; ++i) { for(int j=1; j<=x; ++j) { res[i][j] = (i > j ? -1 : -2); } } return res; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 1 ms | 1624 KB | Wrong answer detected in grader |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 1 ms | 1368 KB | Wrong answer detected in grader |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 1 ms | 1204 KB | Wrong answer detected in grader |
2 | Halted | 0 ms | 0 KB | - |