# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
288226 | Alexa2001 | Dangerous Skating (JOI16_skating) | C++17 | 332 ms | 110200 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;
const int Nmax = 1005, Nodes = 3 * Nmax * Nmax, inf = 1e9;
int dx[] = {0, 0, +1, -1};
int dy[] = {-1, +1, 0, 0};
int n, m, nr;
char A[Nmax][Nmax];
int startX, startY, finishX, finishY;
int dist[Nodes];
bool used[Nodes];
int hor[Nmax][Nmax], ver[Nmax][Nmax];
queue<int> q[3];
vector<int> to[Nodes];
int code(int x, int y)
{
return (x-1) * m + y;
}
void prepare()
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |