oj.uz

Submission #976869

# Submission time Handle Problem Language Result Execution time Memory
976869 2024-05-07T08:15:16 Z vjudge1 Awesome Arrowland Adventure (eJOI19_adventure) C++17
100 / 100
 112 ms 15036 KB 
#include<bits/stdc++.h>
using namespace std;
#define debug cout << "here\n";
#define koor pair<int, pair<int, int>>
#define fi first
#define se second
int n,m;

bool ketemu;
char taman[503][503];
bool explored[503][503];
int dx[8] = {-1,0,1,0,-1,0,1,0},
    dy[8] = {0,1,0,-1,0,1,0,-1};

void djikstra(){
    priority_queue<koor, vector<koor>, greater<>> pq;
    pq.push({0,{1,1}});

    while(!pq.empty()){
        int putar = pq.top().fi,
            x     = pq.top().se.fi,
            y     = pq.top().se.se;
        pq.pop();

        //cout << x << ", " << y << "  ->" << putar << '\n';


        if(x==n && y==m){
            cout << putar;
            ketemu = true;
            break;
        }

        if(explored[x][y] || taman[x][y] == 'X') continue;
        else explored[x][y] = true;
        
        char arah = taman[x][y];
        if(arah == 'N'){
            for(int i = 0; i < 4; i++){
                if(x+dx[i] <= n && y+dy[i] <= m && x+dx[i] >= 1 && y+dy[i] >= 1)
                    pq.push({putar+i,  { x+dx[i], y+dy[i] } }  );
            }
        }else if(arah == 'E'){
            for(int i = 1; i < 5; i++){
                if(x+dx[i] <= n && y+dy[i] <= m && x+dx[i] >= 1 && y+dy[i] >= 1)
                    pq.push({putar+i-1,  { x+dx[i], y+dy[i] } }  );
            }
        }else if(arah == 'S'){
            for(int i = 2; i < 6; i++){
                if(x+dx[i] <= n && y+dy[i] <= m && x+dx[i] >= 1 && y+dy[i] >= 1)
                    pq.push({putar+i-2,  { x+dx[i], y+dy[i] } }  );
            }
        }else {
            for(int i = 3; i < 7; i++){
                if(x+dx[i] <= n && y+dy[i] <= m && x+dx[i] >= 1 && y+dy[i] >= 1)
                    pq.push({putar+i-3,  { x+dx[i], y+dy[i] } }  );
            }
        }
    }
}

int main (){
    cin >> n >> m;


    for(int i = 1; i <= n; i++){
        for(int j = 1; j <= m; j++){
            cin >> taman[i][j];
        }
    }

    djikstra();
    if(!ketemu) cout << -1;
    return 0;
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 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 0 ms 348 KB Output is correct
7 Correct 0 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 1 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 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 0 ms 348 KB Output is correct
7 Correct 0 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 0 ms 348 KB Output is correct
13 Correct 1 ms 348 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 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 0 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 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct

Subtask #4
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 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 1 ms 348 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 1 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 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 0 ms 348 KB Output is correct
7 Correct 0 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 0 ms 348 KB Output is correct
13 Correct 1 ms 348 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 348 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 0 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 0 ms 348 KB Output is correct
24 Correct 0 ms 348 KB Output is correct
25 Correct 0 ms 344 KB Output is correct
26 Correct 0 ms 348 KB Output is correct
27 Correct 0 ms 348 KB Output is correct
28 Correct 0 ms 348 KB Output is correct
29 Correct 0 ms 348 KB Output is correct
30 Correct 1 ms 348 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 348 KB Output is correct
34 Correct 0 ms 348 KB Output is correct
35 Correct 9 ms 348 KB Output is correct
36 Correct 0 ms 348 KB Output is correct
37 Correct 11 ms 348 KB Output is correct
38 Correct 2 ms 348 KB Output is correct
39 Correct 112 ms 880 KB Output is correct
40 Correct 111 ms 860 KB Output is correct
41 Correct 9 ms 1116 KB Output is correct
42 Correct 110 ms 860 KB Output is correct
43 Correct 62 ms 15036 KB Output is correct
44 Correct 9 ms 604 KB Output is correct