oj.uz

Submission #834641

# Submission time Handle Problem Language Result Execution time Memory
834641 2023-08-22T16:23:38 Z VMaksimoski008 Awesome Arrowland Adventure (eJOI19_adventure) C++14
100 / 100
 76 ms 5968 KB 
#include <bits/stdc++.h>

#define pb push_back
#define eb emplace_back
#define sz(x) (int)x.size()
#define all(x) x.begin(), x.end()
#define uniq(x) x.erase(unique(all(x)), x.end())
#define rall(x) x.rbegin(), x.rend()
//#define int long long

using namespace std;

using ll = long long;
using ull = unsigned long long;
using ld = long double;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using Node = array<int, 3>;

const int mod = 1e9 + 7;
const int LOG = 20;
const int maxn = 1e5 + 5;
const double eps = 1e-9;

void setIO() {
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
}

int dr[4] = {0, -1, 0, 1};
int dc[4] = {-1, 0, 1, 0};

int getCost(int curr, int target) {
    int arr[4] = {1, 2, 3, 0};
    int ans = 0;

    int currPos = -1;
    for(int i=0; i<4; i++) {
        if(arr[i] == curr) {
            currPos = i;
            break;
        }
    }

    while(arr[(currPos + ans) % 4] != target) ans++;

    return ans;
}

int32_t main() {
    setIO();

    int n, m;
    cin >> n >> m;

    int mat[n][m];
    for(int i=0; i<n; i++) {
        for(int j=0; j<m; j++) {
            char ch;
            cin >> ch;
            if(ch == 'X') mat[i][j] = -1;
            if(ch == 'E') mat[i][j] = 2;
            if(ch == 'W') mat[i][j] = 0;
            if(ch == 'N') mat[i][j] = 1;
            if(ch == 'S') mat[i][j] = 3;
        }
    }

    bool vis[n][m];
    vector<vector<int> > dist(n, vector<int>(m, 1e9));
    memset(vis, 0, sizeof(vis));

    dist[0][0] = 0;
    priority_queue<Node, vector<Node>, greater<Node> > pq;
    pq.push({ 0, 0, 0 });

    while(!pq.empty()) {
        int r = pq.top().at(1);
        int c = pq.top().at(2);
        int d = pq.top().at(0);
        pq.pop();

        if(vis[r][c]) continue;
        vis[r][c] = true;
        if(mat[r][c] == -1) continue;

        for(int i=0; i<4; i++) {
            int newR = r + dr[i];
            int newC = c + dc[i];
            if(newR < 0 || newR >= n) continue;
            if(newC < 0 || newC >= m) continue;
            
            int newDist = d + getCost(mat[r][c], i);

            if(dist[newR][newC] > newDist) {
                dist[newR][newC] = newDist;
                pq.push({ dist[newR][newC], newR, newC });
            }
        }
    }

    if(!vis[n-1][m-1]) cout << -1 << '\n';
    else cout << dist[n-1][m-1] << '\n';
    return 0;
}

Subtask #1
10.0 / 10.0

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

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 0 ms 212 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 320 KB Output is correct
16 Correct 0 ms 212 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 1 ms 320 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 1 ms 320 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 212 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct

Subtask #4
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 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 324 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 0 ms 212 KB Output is correct

Subtask #5
50.0 / 50.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 0 ms 212 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 320 KB Output is correct
16 Correct 0 ms 212 KB Output is correct
17 Correct 1 ms 212 KB Output is correct
18 Correct 1 ms 320 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 1 ms 320 KB Output is correct
21 Correct 1 ms 212 KB Output is correct
22 Correct 1 ms 212 KB Output is correct
23 Correct 1 ms 212 KB Output is correct
24 Correct 1 ms 212 KB Output is correct
25 Correct 1 ms 212 KB Output is correct
26 Correct 0 ms 212 KB Output is correct
27 Correct 1 ms 212 KB Output is correct
28 Correct 1 ms 324 KB Output is correct
29 Correct 1 ms 212 KB Output is correct
30 Correct 1 ms 212 KB Output is correct
31 Correct 1 ms 212 KB Output is correct
32 Correct 1 ms 212 KB Output is correct
33 Correct 0 ms 212 KB Output is correct
34 Correct 0 ms 212 KB Output is correct
35 Correct 5 ms 448 KB Output is correct
36 Correct 1 ms 340 KB Output is correct
37 Correct 6 ms 596 KB Output is correct
38 Correct 1 ms 724 KB Output is correct
39 Correct 51 ms 2796 KB Output is correct
40 Correct 58 ms 2788 KB Output is correct
41 Correct 7 ms 2688 KB Output is correct
42 Correct 52 ms 2816 KB Output is correct
43 Correct 76 ms 5968 KB Output is correct
44 Correct 7 ms 2696 KB Output is correct