oj.uz

답안 #1029928

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1029928 2024-07-21T14:01:40 Z mychecksedad Awesome Arrowland Adventure (eJOI19_adventure) C++17
100 / 100
 50 ms 25680 KB 
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
const int N = 510;
#define pii pair<int,int>
#define pb push_back
struct Edge{
    int x, y, w;
};
 
int n, m, dist[N][N];
char c;
vector<Edge> g[N][N];
bool vis[N][N];
 
 
int main(){
    cin.tie(0); ios::sync_with_stdio(0);
    cin >> n >> m;
    int arr[4][2]={{-1, 0}, {0, 1}, {1, 0}, {0, -1}};
    for(int i = 0; i <= n+2; i++) for(int j = 0; j <= m+2; j++) {dist[i][j] = 1e9; vis[i][j] = 0;}
    Edge e;
    for(int i = 1; i <= n; i++){
        for(int j = 1; j <= m; j++){
            cin >> c;
            int co;
            if(c == 'N'){
                co = 0;
                for(int k = 0; k < 4; k++){
                    e.x = i + arr[(k+co)%4][0];
                    e.y = j + arr[(k+co)%4][1];
                    e.w = k;
                    g[i][j].pb(e);
                }
            }else if(c == 'E'){
                co=1;
                for(int k = 0; k < 4; k++){
                    e.x = i + arr[(k+co)%4][0];
                    e.y = j + arr[(k+co)%4][1];
                    e.w = k;
                    g[i][j].pb(e);
                }
            }else if(c == 'S'){
                co=2;
                for(int k = 0; k < 4; k++){
                    e.x = i + arr[(k+co)%4][0];
                    e.y = j + arr[(k+co)%4][1];
                    e.w = k;
                    g[i][j].pb(e);
                }
            }else if(c == 'W'){
                co=3;
                for(int k = 0; k < 4; k++){
                    e.x = i + arr[(k+co)%4][0];
                    e.y = j + arr[(k+co)%4][1];
                    e.w = k;
                    g[i][j].pb(e);
                }
            }
        }   
    }
    dist[1][1] = 0;
    queue<pii> q[4];
    q[0].push({1, 1});
    int cur = 0;
    while(!q[0].empty() || !q[1].empty() || !q[2].empty() || !q[3].empty()){
        if(q[cur].empty()){
          (cur=cur+1)%=4;
          continue;
        }
        int x = q[cur].front().first, y = q[cur].front().second;
        q[cur].pop();
        if(vis[x][y]) continue;
        vis[x][y] = 1;
        for(Edge u: g[x][y]){
            if(dist[x][y] + u.w < dist[u.x][u.y]){
                dist[u.x][u.y] = dist[x][y] + u.w;
                q[(cur + u.w) % 4].push({u.x, u.y});
            }
        }
    }
    cout << (!vis[n][m] ? -1 : dist[n][m]);
    return 0;
}

Subtask #1
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 6492 KB Output is correct
2 Correct 1 ms 6492 KB Output is correct
3 Correct 2 ms 6492 KB Output is correct
4 Correct 2 ms 6488 KB Output is correct
5 Correct 2 ms 6492 KB Output is correct
6 Correct 1 ms 6748 KB Output is correct
7 Correct 1 ms 6492 KB Output is correct
8 Correct 1 ms 6584 KB Output is correct
9 Correct 2 ms 6584 KB Output is correct
10 Correct 1 ms 6492 KB Output is correct

Subtask #2
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 6492 KB Output is correct
2 Correct 1 ms 6492 KB Output is correct
3 Correct 2 ms 6492 KB Output is correct
4 Correct 2 ms 6488 KB Output is correct
5 Correct 2 ms 6492 KB Output is correct
6 Correct 1 ms 6748 KB Output is correct
7 Correct 1 ms 6492 KB Output is correct
8 Correct 1 ms 6584 KB Output is correct
9 Correct 2 ms 6584 KB Output is correct
10 Correct 1 ms 6492 KB Output is correct
11 Correct 1 ms 6492 KB Output is correct
12 Correct 2 ms 6492 KB Output is correct
13 Correct 1 ms 6584 KB Output is correct
14 Correct 2 ms 6492 KB Output is correct
15 Correct 1 ms 6588 KB Output is correct
16 Correct 2 ms 6688 KB Output is correct
17 Correct 1 ms 6492 KB Output is correct
18 Correct 2 ms 6492 KB Output is correct
19 Correct 2 ms 6488 KB Output is correct
20 Correct 3 ms 6492 KB Output is correct

Subtask #3
12.0 / 12.0

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

Subtask #4
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 6492 KB Output is correct
2 Correct 2 ms 6840 KB Output is correct
3 Correct 1 ms 6492 KB Output is correct
4 Correct 1 ms 6492 KB Output is correct
5 Correct 2 ms 6656 KB Output is correct
6 Correct 2 ms 6488 KB Output is correct
7 Correct 2 ms 6492 KB Output is correct
8 Correct 1 ms 6488 KB Output is correct
9 Correct 2 ms 6492 KB Output is correct
10 Correct 2 ms 6492 KB Output is correct

Subtask #5
50.0 / 50.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 6492 KB Output is correct
2 Correct 1 ms 6492 KB Output is correct
3 Correct 2 ms 6492 KB Output is correct
4 Correct 2 ms 6488 KB Output is correct
5 Correct 2 ms 6492 KB Output is correct
6 Correct 1 ms 6748 KB Output is correct
7 Correct 1 ms 6492 KB Output is correct
8 Correct 1 ms 6584 KB Output is correct
9 Correct 2 ms 6584 KB Output is correct
10 Correct 1 ms 6492 KB Output is correct
11 Correct 1 ms 6492 KB Output is correct
12 Correct 2 ms 6492 KB Output is correct
13 Correct 1 ms 6584 KB Output is correct
14 Correct 2 ms 6492 KB Output is correct
15 Correct 1 ms 6588 KB Output is correct
16 Correct 2 ms 6688 KB Output is correct
17 Correct 1 ms 6492 KB Output is correct
18 Correct 2 ms 6492 KB Output is correct
19 Correct 2 ms 6488 KB Output is correct
20 Correct 3 ms 6492 KB Output is correct
21 Correct 2 ms 6488 KB Output is correct
22 Correct 1 ms 6492 KB Output is correct
23 Correct 1 ms 6492 KB Output is correct
24 Correct 1 ms 6492 KB Output is correct
25 Correct 1 ms 6492 KB Output is correct
26 Correct 2 ms 6840 KB Output is correct
27 Correct 1 ms 6492 KB Output is correct
28 Correct 1 ms 6492 KB Output is correct
29 Correct 2 ms 6656 KB Output is correct
30 Correct 2 ms 6488 KB Output is correct
31 Correct 2 ms 6492 KB Output is correct
32 Correct 1 ms 6488 KB Output is correct
33 Correct 2 ms 6492 KB Output is correct
34 Correct 2 ms 6492 KB Output is correct
35 Correct 6 ms 7944 KB Output is correct
36 Correct 2 ms 6748 KB Output is correct
37 Correct 7 ms 8284 KB Output is correct
38 Correct 9 ms 9304 KB Output is correct
39 Correct 41 ms 20636 KB Output is correct
40 Correct 50 ms 20552 KB Output is correct
41 Correct 32 ms 20344 KB Output is correct
42 Correct 46 ms 20568 KB Output is correct
43 Correct 35 ms 25680 KB Output is correct
44 Correct 25 ms 20564 KB Output is correct