# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
655766 | borisAngelov | Awesome Arrowland Adventure (eJOI19_adventure) | C++17 | 29 ms | 25444 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 <iostream>
#include <utility>
#include <vector>
#include <tuple>
#include <queue>
using namespace std;
const int maxn = 505;
const int inf = 1000000007;
int n, m;
int table[maxn][maxn];
pair<int, int> dirs[4] = {{0, -1}, {-1, 0}, {0, 1}, {1, 0}};
int timeForChange[4][4];
void MakeChangeTime() {
//W -> 0, N - 1, E - 2, S - 3
timeForChange[0][0] = 0;
timeForChange[0][1] = 1;
timeForChange[0][2] = 2;
timeForChange[0][3] = 3;
timeForChange[1][0] = 3;
timeForChange[1][1] = 0;
timeForChange[1][2] = 1;
timeForChange[1][3] = 2;
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... |