# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
976481 | vjudge1 | Awesome Arrowland Adventure (eJOI19_adventure) | C++17 | 0 ms | 348 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>
using namespace std;
int n, m;
string s[500];
bool visited[500][500];
int mvr[4] = {-1, 0, 1, 0};
int mvc[4] = {0, 1, 0, -1};
bool valid(int i, int j) {
return i >= 0 && j >= 0 && i < n && j < n;
}
int bfs(int i, int j, int cnt) {
if (visited[i][j]) return -1;
}
int main() {
cin >> n >> m;
for (int i = 0; i < n; i++) {
cin >> s[i];
}
if (n == 1) {
int ans = 0;
for (int i = 1; i < n - 1; i++) {
switch(s[0][i]) {
case 'E': break;
case 'N': ans++; break;
case 'W': ans+=2; break;
case 'S': ans+=3; break;
case 'X': cout << -1; return 0;
}
}
}
}
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... |