oj.uz

답안 #1060219

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1060219 2024-08-15T11:39:50 Z ThommyDB Awesome Arrowland Adventure (eJOI19_adventure) C++17
100 / 100
 150 ms 14528 KB 
#include<bits/stdc++.h>

using namespace std;

int m, n;
vector<vector<char>> grid;

signed main(){
    cin >> m >> n;
    grid.resize(m, vector<char>(n));
    for(int i = 0; i < m; i++){
        for(int j = 0; j < n; j++){
            cin >> grid[i][j];
        }
    }
    priority_queue<pair<int, pair<int, int>>> pq;
    pq.push({0, {0, 0}});
    vector<vector<int>> visited(m, vector<int>(n, -1));
    while(!pq.empty()){
        int a = -pq.top().first;
        int x = pq.top().second.first;
        int y = pq.top().second.second;
        pq.pop();
        if(x>n-1 || x<0 || y>m-1 || y<0)continue;
        if(visited[y][x]!=-1) continue;
        visited[y][x]=a;
        if(grid[y][x]=='X')continue;
        if(grid[y][x]=='E'){
            pq.push({-a, {x+1, y}});
            pq.push({-a-1, {x, y+1}});
            pq.push({-a-2, {x-1, y}});
            pq.push({-a-3, {x, y-1}});
        }
        else if(grid[y][x]=='S'){
            pq.push({-a-3, {x+1, y}});
            pq.push({-a, {x, y+1}});
            pq.push({-a-1, {x-1, y}});
            pq.push({-a-2, {x, y-1}});
        }
        else if(grid[y][x]=='W'){
            pq.push({-a-2, {x+1, y}});
            pq.push({-a-3, {x, y+1}});
            pq.push({-a, {x-1, y}});
            pq.push({-a-1, {x, y-1}});
        }
        else if(grid[y][x]=='N'){
            pq.push({-a-1, {x+1, y}});
            pq.push({-a-2, {x, y+1}});
            pq.push({-a-3, {x-1, y}});
            pq.push({-a, {x, y-1}});
        }
    }

    cout << visited[m-1][n-1] << "\n";

    /*for(int i = 0; i < m; i++){
        for(int j = 0; j < n; j++){
            cout << grid[i][j] << " ";
        }
        cout << "\n";
    }
    cout << "\n";
    for(int i = 0; i < m; i++){
        for(int j = 0; j < n; j++){
            cout << visited[i][j] << " ";
        }
        cout << "\n";
    }*/
}

Subtask #1
10.0 / 10.0

# 결과 실행 시간 메모리 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
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 1 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 #2
12.0 / 12.0

# 결과 실행 시간 메모리 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
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 1 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 1 ms 344 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 436 KB Output is correct

Subtask #3
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 436 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct

Subtask #4
16.0 / 16.0

# 결과 실행 시간 메모리 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
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 1 ms 344 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 #5
50.0 / 50.0

# 결과 실행 시간 메모리 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
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 1 ms 348 KB Output is correct
9 Correct 1 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 1 ms 344 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 436 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 0 ms 436 KB Output is correct
23 Correct 1 ms 348 KB Output is correct
24 Correct 0 ms 348 KB Output is correct
25 Correct 0 ms 348 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 0 ms 348 KB Output is correct
31 Correct 1 ms 344 KB Output is correct
32 Correct 0 ms 348 KB Output is correct
33 Correct 0 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 10 ms 488 KB Output is correct
38 Correct 2 ms 604 KB Output is correct
39 Correct 97 ms 1980 KB Output is correct
40 Correct 96 ms 1880 KB Output is correct
41 Correct 8 ms 1884 KB Output is correct
42 Correct 97 ms 1884 KB Output is correct
43 Correct 150 ms 14528 KB Output is correct
44 Correct 8 ms 1880 KB Output is correct