# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
922041 | SUNWOOOOOOOO | Maze (JOI23_ho_t3) | C++17 | 2029 ms | 172452 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;
using pint = array <int, 2>;
const int INF = 1e9;
vector <vector <int>> ans, G;
vector <vector <pint>> Gelm;
int r, c, n, gno = 0, dx[4] = {0, 0, 1, -1}, dy[4] = {1, -1, 0, 0};
vector <int> Gvst;
vector <string> A;
deque <pint> dq;
pint s, g;
struct segtree { // +1
int mxX = 1, mxY = 1;
vector <vector <pint>> node;
void init(){
mxX = r;
mxY = c;
node.resize(2 * mxX + 1, vector <pint> (2 * mxY + 1, (pint) {INF, INF}));
for (int i = 0; i < r; i++){
for (int j = 0; j < c; j++){
if (A[i][j] != '#') continue;
node[i + mxX][j + mxY] = {i, j};
}
}
for (int i = mxX; i < 2 * mxX; i++){
for (int j = mxY - 1; j > 0; j--){
node[i][j] = min(node[i][2 * j], node[i][2 * j + 1]);
}
}
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... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |