oj.uz

Submission #976666

# Submission time Handle Problem Language Result Execution time Memory
976666 2024-05-07T01:44:53 Z vjudge1 Awesome Arrowland Adventure (eJOI19_adventure) C++17
100 / 100
 62 ms 6420 KB 
#include <bits/stdc++.h>
#define pii pair<int, int>
#define ppii pair<int, pair<int, int>>
#define fr first
#define sc second

using namespace std;

int main() {
    int ax[4] = {-1, 0, 1, 0};
    int ay[4] = {0, 1, 0, -1};
    char cod[4] = {'N', 'E', 'S', 'W'};
    int n, m; cin >> n >> m;
    string s[n];
    for (int i=0;i<n;i++) {
        cin >> s[i];
    }
    int dp[n][m];
    memset(dp, -1, sizeof(dp));
    priority_queue<ppii, vector<ppii>, greater<ppii>>pq;
    pq.push({0, {0, 0}});
    while (!pq.empty()) {
        int nilai = pq.top().fr;
        int x = pq.top().sc.fr;
        int y = pq.top().sc.sc;
        pq.pop();
        if (x==n-1 && y==m-1) {
            cout << nilai << endl;
            return 0;
        }
        if (dp[x][y] == -1) {
            dp[x][y] = nilai;
            if (s[x][y] == 'X') continue;
            for (int i=0;i<4;i++) {
                if (x+ax[i]>=0&&x+ax[i]<n&&y+ay[i]>=0&&y+ay[i]<m && dp[x+ax[i]][y+ay[i]]==-1) {
                    int jarak = 0, j;
                    for (int ii=0;ii<4;ii++) {
                        if (cod[ii]==s[x][y]){
                            j=ii; break;
                        }
                    }
                    while (cod[j]!=cod[i]) {
                        jarak++;
                        j++; j%=4;
                    }
                    pq.push({nilai+jarak, {x+ax[i], y+ay[i]}});
                }
            }
        }
    }
    cout << dp[n-1][m-1] << endl;
    return 0;
}

Compilation message

adventure.cpp: In function 'int main()':
adventure.cpp:44:26: warning: 'j' may be used uninitialized in this function [-Wmaybe-uninitialized]
   44 |                         j++; j%=4;
      |                         ~^~

Subtask #1
10.0 / 10.0

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

Subtask #2
12.0 / 12.0

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

Subtask #3
12.0 / 12.0

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

Subtask #4
16.0 / 16.0

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

Subtask #5
50.0 / 50.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 424 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 344 KB Output is correct
5 Correct 1 ms 600 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 1 ms 344 KB Output is correct
13 Correct 1 ms 344 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 344 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 1 ms 348 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 1 ms 348 KB Output is correct
24 Correct 0 ms 344 KB Output is correct
25 Correct 0 ms 348 KB Output is correct
26 Correct 1 ms 348 KB Output is correct
27 Correct 0 ms 348 KB Output is correct
28 Correct 1 ms 348 KB Output is correct
29 Correct 0 ms 348 KB Output is correct
30 Correct 1 ms 344 KB Output is correct
31 Correct 1 ms 348 KB Output is correct
32 Correct 0 ms 348 KB Output is correct
33 Correct 1 ms 604 KB Output is correct
34 Correct 0 ms 348 KB Output is correct
35 Correct 6 ms 348 KB Output is correct
36 Correct 0 ms 348 KB Output is correct
37 Correct 7 ms 600 KB Output is correct
38 Correct 1 ms 600 KB Output is correct
39 Correct 61 ms 2140 KB Output is correct
40 Correct 60 ms 2336 KB Output is correct
41 Correct 5 ms 2136 KB Output is correct
42 Correct 62 ms 2200 KB Output is correct
43 Correct 47 ms 6420 KB Output is correct
44 Correct 4 ms 2140 KB Output is correct