oj.uz

답안 #409732

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
409732 2021-05-21T12:05:04 Z Urvuk3 Awesome Arrowland Adventure (eJOI19_adventure) C++17
100 / 100
 232 ms 27268 KB 
#include <bits/stdc++.h>

using namespace std;

#define ll long long
#define MAXN 505 //PROMENI OVO OBAVEZNO AKO TREBA
#define fi first
#define se second
#define mod 1000000007LL
#define endl "\n"
#define pll pair<long long,long long>
#define PRINT(x) cout<<#x<<"-"<<x<<endl

int dist[MAXN][MAXN];
int arrow[MAXN][MAXN];
int dx[4]={-1,0,1,0},dy[4]={0,1,0,-1},n,m;
int okretanje[4][4]={{0, 1, 2, 3},{3, 0, 1, 2},{2, 3, 0, 1},{1, 2, 3, 0}};

void dijkstra(){
    for(int i=0;i<n;i++)
        for(int j=0;j<m;j++)
            dist[i][j]=-1;
    priority_queue<pair<ll,pll>,vector<pair<ll,pll>>,greater<pair<ll,pll>>> pq;
    pq.push({0,{0,0}});
    while(!pq.empty()){
        int x=pq.top().se.fi, y=pq.top().se.se, d=pq.top().fi;
        pq.pop();
        if(x<0 || x>=n || y<0 || y>=m || dist[x][y]!=-1) continue;
        dist[x][y]=d;
        if(arrow[x][y]==-1) continue;
        for(int i=0;i<4;i++){
            pq.push({d+okretanje[arrow[x][y]][i],{x+dx[i],y+dy[i]}});
        }
    }
}

void solve(){
	cin>>n>>m;
	for(int i=0;i<n;i++){
        for(int j=0;j<m;j++){
            char c; cin>>c;
            if(c=='N') arrow[i][j]=0;
            if(c=='E') arrow[i][j]=1;
            if(c=='S') arrow[i][j]=2;
            if(c=='W') arrow[i][j]=3;
            if(c=='X') arrow[i][j]=-1;
        }
	}
	dijkstra();
	cout<<dist[n-1][m-1];
}

int main()
{
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    //freopen(".in","r",stdin);
    //freopen(".out","w",stdout);
    int t;
    //cin>>t;
    t=1;
    while(t--){
        solve();
    }
    return 0;
}

Subtask #1
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 312 KB Output is correct
2 Correct 1 ms 272 KB Output is correct
3 Correct 1 ms 316 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 1 ms 204 KB Output is correct

Subtask #2
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 312 KB Output is correct
2 Correct 1 ms 272 KB Output is correct
3 Correct 1 ms 316 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 1 ms 332 KB Output is correct
12 Correct 1 ms 204 KB Output is correct
13 Correct 1 ms 332 KB Output is correct
14 Correct 1 ms 204 KB Output is correct
15 Correct 1 ms 320 KB Output is correct
16 Correct 1 ms 332 KB Output is correct
17 Correct 1 ms 332 KB Output is correct
18 Correct 1 ms 328 KB Output is correct
19 Correct 1 ms 204 KB Output is correct
20 Correct 1 ms 204 KB Output is correct

Subtask #3
12.0 / 12.0

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

Subtask #4
16.0 / 16.0

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

Subtask #5
50.0 / 50.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 312 KB Output is correct
2 Correct 1 ms 272 KB Output is correct
3 Correct 1 ms 316 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 1 ms 332 KB Output is correct
7 Correct 1 ms 332 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 1 ms 332 KB Output is correct
12 Correct 1 ms 204 KB Output is correct
13 Correct 1 ms 332 KB Output is correct
14 Correct 1 ms 204 KB Output is correct
15 Correct 1 ms 320 KB Output is correct
16 Correct 1 ms 332 KB Output is correct
17 Correct 1 ms 332 KB Output is correct
18 Correct 1 ms 328 KB Output is correct
19 Correct 1 ms 204 KB Output is correct
20 Correct 1 ms 204 KB Output is correct
21 Correct 1 ms 332 KB Output is correct
22 Correct 1 ms 332 KB Output is correct
23 Correct 1 ms 332 KB Output is correct
24 Correct 1 ms 332 KB Output is correct
25 Correct 1 ms 332 KB Output is correct
26 Correct 1 ms 332 KB Output is correct
27 Correct 1 ms 332 KB Output is correct
28 Correct 1 ms 332 KB Output is correct
29 Correct 1 ms 332 KB Output is correct
30 Correct 1 ms 332 KB Output is correct
31 Correct 1 ms 332 KB Output is correct
32 Correct 1 ms 332 KB Output is correct
33 Correct 1 ms 332 KB Output is correct
34 Correct 1 ms 332 KB Output is correct
35 Correct 13 ms 588 KB Output is correct
36 Correct 1 ms 332 KB Output is correct
37 Correct 16 ms 784 KB Output is correct
38 Correct 2 ms 1356 KB Output is correct
39 Correct 154 ms 2752 KB Output is correct
40 Correct 153 ms 2760 KB Output is correct
41 Correct 9 ms 2544 KB Output is correct
42 Correct 155 ms 2936 KB Output is correct
43 Correct 232 ms 27268 KB Output is correct
44 Correct 9 ms 2548 KB Output is correct