# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
906730 | JellyTheOctopus | Awesome Arrowland Adventure (eJOI19_adventure) | C++17 | 142 ms | 16828 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;
#define fi first
#define se second
const int MOD = 1e9+7;
int M, N;
int arr[501][501];
int addX[4] = {-1, 0, 1, 0};
int addY[4] = {0, 1, 0, -1};
int minDist[501][501];
bool seen[501][501];
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
cin >> M >> N;
for (int i = 1; i <= M; i++) {
string s;
cin >> s;
for (int j = 1; j <= N; j++) {
if (s[j-1] == 'X') arr[i][j] = -1;
if (s[j-1] == 'N') arr[i][j] = 0;
if (s[j-1] == 'E') arr[i][j] = 1;
if (s[j-1] == 'S') arr[i][j] = 2;
if (s[j-1] == 'W') arr[i][j] = 3;
minDist[i][j] = (1<<30);
}
# | 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... |