oj.uz

답안 #976698

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
976698 2024-05-07T03:16:03 Z vjudge1 Awesome Arrowland Adventure (eJOI19_adventure) C++17
100 / 100
 116 ms 19148 KB 
#include "bits/stdc++.h"
using namespace std;
#define int long long
#define ll long long
#define fi first
#define se second
#define pb push_back
#define pf push_front
#define pob pop_back
#define pof pop_front
#define sz size
#define fr front 
#define bc backn
#define pii pair<int,int>
#define all(x) x.begin() , x.end()
#define cmin(a, b) a = min(a , b)
#define cmax(a, b) a = max(a, b)
#define mems(arr , a) memset(arr , a , sizeof arr)
#define each(i , arr) for(auto &i : arr)
const int MOD = 1e9 + 7;
const int INF = 1e18;
#define state tuple<int,int,int,int>

int n , m;
int dx[4] = {-1 , 0 , 1 , 0};
int dy[4] = {0 , 1 , 0 , -1};

int getdir(char c){
    if(c == 'N') return 0;
    if(c == 'E') return 1;
    if(c == 'S') return 2;
    if(c == 'W') return 3;
    return 4;
}

bool valid(int x , int y){
    if(x >= 1 && x <= n && y >= 1 && y <= m) return 1;
    return 0;
}

signed main(){

    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);

    int t;  
    t = 1;
    // cin >> t;
    while(t--){
       
       cin >> n >> m;
       int dist[n+1][m+1][5];
       char grid[n+1][m+1];
       for(int i = 1; i <= n; i++){
           for(int j = 1; j <= m; j++){
               cin >> grid[i][j];
               for(int k = 0; k < 5; k++){
                   dist[i][j][k] = INF;
               }
           }
       }
        priority_queue<state , vector<state> , greater<state>> pq;
        dist[1][1][getdir(grid[1][1])] = 0;
        pq.push({0 , 1 , 1 , getdir(grid[1][1])});
        while(!pq.empty()){
            auto [cost , r , c , dir] = pq.top();
            pq.pop();
            if(dir == 4) continue;
            int nR = r + dx[dir] , nC = c + dy[dir];
            if(valid(nR , nC)){
                int nD = getdir(grid[nR][nC]);
                if(cost < dist[nR][nC][nD]){
                    dist[nR][nC][nD] = cost;
                    pq.push({cost , nR , nC , nD});
                }
            }

            dir = (dir+1) % 4;
            if(cost+1 < dist[r][c][dir]){
                dist[r][c][dir] = cost+1;
                pq.push({cost+1 , r , c , dir});
            }
            
        }
        // cout << dist[n][m] << ' ';
        if(dist[n][m][4] == INF) dist[n][m][4] = -1;
        cout << dist[n][m][4];
    }

}

Subtask #1
10.0 / 10.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 1 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 344 KB Output is correct
8 Correct 1 ms 344 KB Output is correct
9 Correct 1 ms 344 KB Output is correct
10 Correct 0 ms 348 KB Output is correct

Subtask #2
12.0 / 12.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 1 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 344 KB Output is correct
8 Correct 1 ms 344 KB Output is correct
9 Correct 1 ms 344 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 348 KB Output is correct
13 Correct 1 ms 344 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 344 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 0 ms 456 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 1 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct

Subtask #3
12.0 / 12.0

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

Subtask #4
16.0 / 16.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 0 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 1 ms 344 KB Output is correct
8 Correct 1 ms 348 KB Output is correct
9 Correct 1 ms 544 KB Output is correct
10 Correct 1 ms 452 KB Output is correct

Subtask #5
50.0 / 50.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 1 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 344 KB Output is correct
8 Correct 1 ms 344 KB Output is correct
9 Correct 1 ms 344 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 348 KB Output is correct
13 Correct 1 ms 344 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 344 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 0 ms 456 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 1 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 1 ms 344 KB Output is correct
22 Correct 0 ms 600 KB Output is correct
23 Correct 0 ms 344 KB Output is correct
24 Correct 1 ms 344 KB Output is correct
25 Correct 1 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 1 ms 348 KB Output is correct
30 Correct 1 ms 348 KB Output is correct
31 Correct 1 ms 344 KB Output is correct
32 Correct 1 ms 348 KB Output is correct
33 Correct 1 ms 544 KB Output is correct
34 Correct 1 ms 452 KB Output is correct
35 Correct 9 ms 1368 KB Output is correct
36 Correct 0 ms 348 KB Output is correct
37 Correct 11 ms 1604 KB Output is correct
38 Correct 2 ms 2136 KB Output is correct
39 Correct 114 ms 10936 KB Output is correct
40 Correct 114 ms 10832 KB Output is correct
41 Correct 8 ms 10764 KB Output is correct
42 Correct 110 ms 10852 KB Output is correct
43 Correct 116 ms 19148 KB Output is correct
44 Correct 10 ms 10588 KB Output is correct