oj.uz

Submission #976708

# Submission time Handle Problem Language Result Execution time Memory
976708 2024-05-07T03:38:19 Z vjudge1 Awesome Arrowland Adventure (eJOI19_adventure) C++17
34 / 100
 1 ms 348 KB 
#include <bits/stdc++.h>
using namespace std;

#define ll long long
#define v(a) vector<a>
#define p(a, b) pair<a, b>
#define F first 
#define S second
ll n, m; 
map<p(ll, ll), bool> vis;
map<char, ll> base;
v(v(char)) arr;
bool pos(ll x, ll y){
    if(x < 0 || y < 0 || x >= n || y >= m) return false;
    if(vis[{x, y}]) return false;
    if(arr[x][y] == 'X' && x != n-1 && y != m-1) return false;
    return true;
}

ll cost(ll a, ll b){
    return ((b-a)+4)%4;
}
int main(){
    cin >> n >> m;
    arr.resize(n+5);
    for(int i = 0; i < n; i++)arr[i].resize(m+5);
    for(int i = 0; i < n; i++){
        for(int j = 0; j < m; j++) cin >> arr[i][j];
    }

    bool ok = false;
    queue<p(ll, ll)> temp;
    temp.push({0, 0});
    while(!temp.empty()){
        ll x = temp.front().F, y = temp.front().S;
        temp.pop();
        vis[{x, y}] = true;
        if(x == n-1 && y == m-1){
            ok = true;
            break;
        }    
        if(arr[x][y] == 'X') continue;
        if(pos(x+1, y)) {temp.push({x+1, y}); vis[{x+1, y}] = true;}
        if(pos(x, y+1)) {temp.push({x, y+1}); vis[{x, y+1}] = true;}
        if(pos(x-1, y)) {temp.push({x-1, y}); vis[{x-1, y}] = true;}
        if(pos(x, y-1)) {temp.push({x, y-1}); vis[{x, y-1}] = true;}
    }

    if(!ok) cout << -1;
    else {
        vis.clear();
        priority_queue<p(ll, p(ll, ll)), v(p(ll, p(ll, ll))), greater<p(ll, p(ll, ll))> > pq;
        pq.push({0, {0, 0}});
        base['N'] = 1;
        base['E'] = 2;
        base['S'] = 3;
        base['W'] = 4;

        ll ans = -1;
        while(!pq.empty()){
            ll cur = pq.top().F, x = pq.top().S.F, y = pq.top().S.S;
            // cout << cur << " " << x << " " << y << endl;
            pq.pop();
            // if(vis[{x, y}]) continue;
            // vis[{x, y}] = true;
            if(x == n-1 && y == m-1){
                ans = cur;
                break;
            }

            if(arr[x][y] == 'X') continue;

            if(pos(x+1, y)){pq.push({cur + cost(base[arr[x][y]], 3), {x+1, y}}); vis[{x+1, y}] = true;}
            if(pos(x-1, y)){pq.push({cur + cost(base[arr[x][y]], 1), {x-1, y}}); vis[{x-1, y}] = true;} 
            if(pos(x, y+1)){pq.push({cur + cost(base[arr[x][y]], 2), {x, y+1}}); vis[{x, y+1}] = true;}
            if(pos(x, y-1)){pq.push({cur + cost(base[arr[x][y]], 4), {x, y-1}}); vis[{x, y-1}] = true;}
        }

        cout << ans;
    }
}

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 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 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 1 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 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 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 1 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 1 ms 344 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 1 ms 344 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 1 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct

Subtask #4
0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Incorrect 0 ms 344 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #5
0 / 50.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 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 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 1 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 1 ms 344 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 1 ms 344 KB Output is correct
20 Correct 1 ms 348 KB Output is correct
21 Correct 1 ms 348 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 0 ms 348 KB Output is correct
24 Correct 1 ms 348 KB Output is correct
25 Correct 0 ms 344 KB Output is correct
26 Incorrect 0 ms 344 KB Output isn't correct
27 Halted 0 ms 0 KB -