oj.uz

Submission #791637

# Submission time Handle Problem Language Result Execution time Memory
791637 2023-07-24T08:25:01 Z otarius Awesome Arrowland Adventure (eJOI19_adventure) C++17
100 / 100
 62 ms 2136 KB 
#include <iostream>
#include <algorithm>
#include <vector>
#include <set>
#include <cstring>
#include <queue>
#include <map>
#include <cmath>
#include <iomanip>
using namespace std;

#define ff first
#define sc second
#define pb push_back
#define ll long long
#define pll pair<ll, ll>
#define pii pair <int, int>
#define ull unsigned long long

// #define int long long
// #define int unsigned long long

const ll inf = 1e9 + 7;
const ll weirdMod = 998244353;

int dx[] = {-1, 0, 1, 0};
int dy[] = {0, 1, 0, -1};
char dir[] = {'N', 'E', 'S', 'W', 'N', 'E', 'S', 'W'};

char arr[505][505];
int n, m, d[505][505], x, y, a, b;
int get(char v, char u) {
    int pos;
    for (int i = 0; i < 4; i++)
        if (dir[i] == v) pos = i;
    int ans = 0;
    for ( ; pos < 8; pos++) {
        if (dir[pos] == u) break;
        else ans++;
    } return ans;
}
void dijkstra() {
    d[1][1] = 0;
    set<pair<int, pii>> st;
    st.insert({0, {1, 1}});
    pair<int, pii> cur;
    int num = 0;
    while (!st.empty()) {
        cur = *st.begin();
        st.erase(st.begin());
        x = cur.sc.ff; y = cur.sc.sc;
        if (arr[x][y] == 'X') continue;
        for (int i = 0; i < 4; i++) {
            a = x + dx[i];
            b = y + dy[i];
            if (a > 0 && b > 0 && a <= n && b <= m) {
                if (d[a][b] > d[x][y] + get(arr[x][y], dir[i])) {
                    st.erase({d[a][b], {a, b}});
                    d[a][b] = d[x][y] + get(arr[x][y], dir[i]);
                    st.insert({d[a][b], {a, b}});
                }
            }
        }
    } if (d[n][m] == inf)
        cout << -1;
    else cout << d[n][m];
}
void solve() {
    cin >> n >> m;
    for (int i = 1; i <= n; i++) {
        for (int j = 1; j <= m; j++) {
            cin >> arr[i][j]; d[i][j] = inf;
        }
    } if (n == 1 && m == 1) {
        cout << 0; return;
    } if (arr[1][1] == 'X') {
        cout << -1; return;
    } dijkstra();
}
int32_t main() {
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr); cout.tie(nullptr);
    
    int t = 1;
    // cin >> t;
    while (t--) {
        solve();
        cout << '\n';
    } return 0;
}

Compilation message

adventure.cpp: In function 'void dijkstra()':
adventure.cpp:47:9: warning: unused variable 'num' [-Wunused-variable]
   47 |     int num = 0;
      |         ^~~
adventure.cpp: In function 'int get(char, char)':
adventure.cpp:33:9: warning: 'pos' may be used uninitialized in this function [-Wmaybe-uninitialized]
   33 |     int pos;
      |         ^~~
adventure.cpp: In function 'void dijkstra()':
adventure.cpp:33:9: warning: 'pos' may be used uninitialized in this function [-Wmaybe-uninitialized]
adventure.cpp:33:9: warning: 'pos' may be used uninitialized in this function [-Wmaybe-uninitialized]

Subtask #1
10.0 / 10.0

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

Subtask #2
12.0 / 12.0

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

Subtask #3
12.0 / 12.0

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

Subtask #4
16.0 / 16.0

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

Subtask #5
50.0 / 50.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 336 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 0 ms 324 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 212 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 ms 332 KB Output is correct
17 Correct 1 ms 332 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 0 ms 340 KB Output is correct
20 Correct 0 ms 340 KB Output is correct
21 Correct 1 ms 212 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 1 ms 212 KB Output is correct
24 Correct 1 ms 340 KB Output is correct
25 Correct 1 ms 332 KB Output is correct
26 Correct 1 ms 340 KB Output is correct
27 Correct 1 ms 340 KB Output is correct
28 Correct 1 ms 212 KB Output is correct
29 Correct 1 ms 332 KB Output is correct
30 Correct 1 ms 332 KB Output is correct
31 Correct 1 ms 212 KB Output is correct
32 Correct 0 ms 340 KB Output is correct
33 Correct 0 ms 328 KB Output is correct
34 Correct 0 ms 340 KB Output is correct
35 Correct 6 ms 468 KB Output is correct
36 Correct 1 ms 340 KB Output is correct
37 Correct 6 ms 632 KB Output is correct
38 Correct 1 ms 980 KB Output is correct
39 Correct 56 ms 1856 KB Output is correct
40 Correct 62 ms 2136 KB Output is correct
41 Correct 3 ms 1800 KB Output is correct
42 Correct 61 ms 1844 KB Output is correct
43 Correct 57 ms 1748 KB Output is correct
44 Correct 3 ms 1748 KB Output is correct