# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
459304 | lukadupli | Awesome Arrowland Adventure (eJOI19_adventure) | C++14 | 277 ms | 18244 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>
#define f first
#define s second
using namespace std;
const int MAX = 505, INF = 2e9;
typedef pair <int, int> pii;
int n, m, mat[MAX][MAX], sol[MAX][MAX];
set <pair <int, pii>> dijk;
int dx[] = {-1, 0, 1, 0};
int dy[] = {0, 1, 0, -1};
int main()
{
cin >> n >> m;
for(int i = 0; i < n; i++){
string row;
cin >> row;
for(int j = 0; j < m; j++){
if(row[j] == 'N') mat[i][j] = 0;
else if(row[j] == 'E') mat[i][j] = 1;
else if(row[j] == 'S') mat[i][j] = 2;
else if(row[j] == 'W') mat[i][j] = 3;
# | 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... |