oj.uz

Submission #762020

# Submission time Handle Problem Language Result Execution time Memory
762020 2023-06-20T14:46:36 Z DJeniUp Awesome Arrowland Adventure (eJOI19_adventure) C++17
100 / 100
 91 ms 10684 KB 
#include "bits/stdc++.h"
 
using namespace std;
 
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll,ll>pairll;
typedef pair<ll,ull>pairull;
typedef pair<ll,pairll>pair3l;
typedef long double ld;
typedef pair<ld,ll>pairld;
 
#define fr first
#define sc second
#define pb push_back
#define endl '\n'
#define N 100007
#define MOD 1000000007
#define INF 1000000000000000007
#define eps 0.0000000001

ll n,m,d[507][507],res[507][507];

priority_queue<pair3l,vector<pair3l>, greater<pair3l> >q;

int main(){
    cin>>n>>m;
    for(int i=1;i<=n;i++){
        for(int j=1;j<=m;j++){
            char c;
            cin>>c;
            if(c=='N')d[i][j]=3;
            if(c=='E')d[i][j]=0;
            if(c=='S')d[i][j]=1;
            if(c=='W')d[i][j]=2;
            if(c=='X')d[i][j]=4;
            res[i][j]=INF;
            d[0][j]=4;
            d[n+1][j]=4;
        }
        d[i][0]=4;
        d[i][m+1]=4;
    }
    res[1][1]=0;
    q.push({0,{1,1}});
    while(q.size()>0){
        ll m1=q.top().fr;
        ll x=q.top().sc.fr;
        ll y=q.top().sc.sc;
        q.pop();
        if(res[x][y]==m1 && d[x][y]!=4){
            if(res[x+1][y]>(5-d[x][y])%4+m1){
                res[x+1][y]=(5-d[x][y])%4+m1;
                q.push({res[x+1][y],{x+1,y}});
            }
            if(res[x-1][y]>(7-d[x][y])%4+m1){
                res[x-1][y]=(7-d[x][y])%4+m1;
                q.push({res[x-1][y],{x-1,y}});
            }
            if(res[x][y+1]>(4-d[x][y])%4+m1){
                res[x][y+1]=(4-d[x][y])%4+m1;
                q.push({res[x][y+1],{x,y+1}});
            }
            if(res[x][y-1]>(6-d[x][y])%4+m1){
                res[x][y-1]=(6-d[x][y])%4+m1;
                q.push({res[x][y-1],{x,y-1}});
            }
        }
    }
    if(res[n][m]==INF)cout<<-1<<endl;
    else cout<<res[n][m]<<endl;
 
    return 0;
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 304 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 304 KB Output is correct
5 Correct 1 ms 308 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 340 KB Output is correct
9 Correct 1 ms 312 KB Output is correct
10 Correct 1 ms 312 KB Output is correct

Subtask #2
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 304 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 304 KB Output is correct
5 Correct 1 ms 308 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 340 KB Output is correct
9 Correct 1 ms 312 KB Output is correct
10 Correct 1 ms 312 KB Output is correct
11 Correct 1 ms 312 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 1 ms 344 KB Output is correct
18 Correct 1 ms 216 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 1 ms 340 KB Output is correct

Subtask #3
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 304 KB Output is correct
4 Correct 1 ms 304 KB Output is correct

Subtask #4
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 308 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 308 KB Output is correct
10 Correct 1 ms 308 KB Output is correct

Subtask #5
50.0 / 50.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 304 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 304 KB Output is correct
5 Correct 1 ms 308 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 340 KB Output is correct
9 Correct 1 ms 312 KB Output is correct
10 Correct 1 ms 312 KB Output is correct
11 Correct 1 ms 312 KB Output is correct
12 Correct 1 ms 212 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 1 ms 344 KB Output is correct
18 Correct 1 ms 216 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 1 ms 304 KB Output is correct
24 Correct 1 ms 304 KB Output is correct
25 Correct 1 ms 340 KB Output is correct
26 Correct 1 ms 340 KB Output is correct
27 Correct 1 ms 340 KB Output is correct
28 Correct 1 ms 340 KB Output is correct
29 Correct 1 ms 340 KB Output is correct
30 Correct 1 ms 340 KB Output is correct
31 Correct 1 ms 308 KB Output is correct
32 Correct 1 ms 212 KB Output is correct
33 Correct 1 ms 308 KB Output is correct
34 Correct 1 ms 308 KB Output is correct
35 Correct 5 ms 724 KB Output is correct
36 Correct 1 ms 340 KB Output is correct
37 Correct 6 ms 1088 KB Output is correct
38 Correct 3 ms 2388 KB Output is correct
39 Correct 50 ms 4568 KB Output is correct
40 Correct 53 ms 4600 KB Output is correct
41 Correct 15 ms 4436 KB Output is correct
42 Correct 52 ms 4520 KB Output is correct
43 Correct 91 ms 10684 KB Output is correct
44 Correct 13 ms 4492 KB Output is correct