oj.uz

Submission #445692

# Submission time Handle Problem Language Result Execution time Memory
445692 2021-07-19T09:37:40 Z aris12345678 Awesome Arrowland Adventure (eJOI19_adventure) C++14
100 / 100
 117 ms 9036 KB 
#include <bits/stdc++.h>
using namespace std;

typedef long long ll;

const int mxN = 505;
char str[mxN][mxN];
ll dist[mxN][mxN];
string pos = "NESW";
int dx[4] = {-1, 0, 1, 0}, dy[4] = {0, 1, 0, -1};

bool check(int i, int j, int n, int m) {
    return i >= 0 && j >= 0 && i < n && j < m;
}

int main() {
    int n, m;
    scanf("%d %d\n", &n, &m);
    for(int i = 0; i < n; i++) {
        for(int j = 0; j < m; j++) {
            cin >> str[i][j];
            dist[i][j] = LLONG_MAX;
        }
    }
    // cout << str[2][2] << "\n";
    dist[0][0] = 0;
    // (distance, i, j)
    priority_queue<tuple<ll, ll, ll>, vector<tuple<ll, ll, ll> >, greater<tuple<ll, ll, ll> > > pq;
    pq.push({0, 0, 0});
    while(!pq.empty()) {
        ll i = get<1>(pq.top()), j = get<2>(pq.top()), w = get<0>(pq.top());
        // cout << i << " " << j << " " << w << "\n"; 
        pq.pop();
        if(dist[i][j] != w) continue;
        if(str[i][j] == 'X') continue;
        ll direction = pos.find(str[i][j]);
        // cout << str[i][j] << " " << direction << "\n"; 
        for(int k = 0; k < 4; k++) {
            int x = i+dx[k], y = j+dy[k];
            // cout << x << " " << y << "\n";
            if(check(x, y, n, m)) {
                ll weight = (k-direction+4)%4;
                // cout << dist[x][y] << " " << dist[i][j] << " " << weight << "\n";
                if(dist[x][y] > dist[i][j]+weight) {
                    dist[x][y] = dist[i][j]+weight;
                    pq.push({dist[x][y], x, y});
                }
            }
        }
    }
    if(dist[n-1][m-1] == LLONG_MAX)
        printf("-1\n");
    else
        printf("%lld\n", dist[n-1][m-1]);
    return 0;
}

Compilation message

adventure.cpp: In function 'int main()':
adventure.cpp:18:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   18 |     scanf("%d %d\n", &n, &m);
      |     ~~~~~^~~~~~~~~~~~~~~~~~~

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 0 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 0 ms 204 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 0 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 0 ms 204 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 0 ms 204 KB Output is correct
13 Correct 1 ms 204 KB Output is correct
14 Correct 0 ms 204 KB Output is correct
15 Correct 1 ms 204 KB Output is correct
16 Correct 0 ms 204 KB Output is correct
17 Correct 0 ms 204 KB Output is correct
18 Correct 0 ms 204 KB Output is correct
19 Correct 0 ms 204 KB Output is correct
20 Correct 0 ms 204 KB Output is correct

Subtask #3
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct

Subtask #4
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 1 ms 204 KB Output is correct

Subtask #5
50.0 / 50.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 0 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 0 ms 204 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 0 ms 204 KB Output is correct
13 Correct 1 ms 204 KB Output is correct
14 Correct 0 ms 204 KB Output is correct
15 Correct 1 ms 204 KB Output is correct
16 Correct 0 ms 204 KB Output is correct
17 Correct 0 ms 204 KB Output is correct
18 Correct 0 ms 204 KB Output is correct
19 Correct 0 ms 204 KB Output is correct
20 Correct 0 ms 204 KB Output is correct
21 Correct 1 ms 204 KB Output is correct
22 Correct 0 ms 204 KB Output is correct
23 Correct 1 ms 204 KB Output is correct
24 Correct 0 ms 204 KB Output is correct
25 Correct 0 ms 204 KB Output is correct
26 Correct 1 ms 204 KB Output is correct
27 Correct 1 ms 204 KB Output is correct
28 Correct 0 ms 204 KB Output is correct
29 Correct 1 ms 204 KB Output is correct
30 Correct 1 ms 204 KB Output is correct
31 Correct 1 ms 204 KB Output is correct
32 Correct 1 ms 204 KB Output is correct
33 Correct 1 ms 204 KB Output is correct
34 Correct 1 ms 204 KB Output is correct
35 Correct 6 ms 588 KB Output is correct
36 Correct 1 ms 332 KB Output is correct
37 Correct 8 ms 716 KB Output is correct
38 Correct 4 ms 1484 KB Output is correct
39 Correct 73 ms 2792 KB Output is correct
40 Correct 73 ms 2840 KB Output is correct
41 Correct 17 ms 2704 KB Output is correct
42 Correct 71 ms 2788 KB Output is correct
43 Correct 117 ms 9036 KB Output is correct
44 Correct 17 ms 2728 KB Output is correct