oj.uz

Submission #370104

# Submission time Handle Problem Language Result Execution time Memory
370104 2021-02-23T09:11:24 Z AdamGS Awesome Arrowland Adventure (eJOI19_adventure) C++14
0 / 100
 5 ms 6380 KB 
#include<bits/stdc++.h>
using namespace std;
#define rep(a, b) for(int a = 0; a < (b); ++a)
#define st first
#define nd second
#define pb push_back
const int LIM=507, INF=1e9+7;
string x[LIM];
int odl[LIM][LIM];
vector<pair<pair<int,int>,int>>V[LIM][LIM];
int main() {
    ios_base::sync_with_stdio(0); cin.tie(0);
    int n, m;
    cin >> n >> m;
    rep(i, n) cin >> x[i];
    priority_queue<pair<int,pair<int,int>>>q;
    rep(i, n) rep(j, m) odl[i][j]=INF;
    q.push({0, {0, 0}});
    while(!q.empty()) {
        int a=q.top().nd.st, b=q.top().nd.nd, o=-q.top().st;
        q.pop();
        if(o>=odl[a][b]) continue;
        odl[a][b]=o;
        if(x[a][b]=='X') continue;
        if(a) {
            if(x[a][b]=='N') q.push({-o, {a-1, b}});
            else if(x[a][b]=='W') q.push({-o-1, {a-1, b}});
            else if(x[a][b]=='S') q.push({-o-2, {a-1, b}});
            else if(x[a][b]=='E') q.push({-o-3, {a-1, b}});
        }
        if(a<n-1) {
            if(x[a][b]=='S') q.push({-o, {a+1, b}});
            else if(x[a][b]=='E') q.push({-o-1, {a+1, b}});
            else if(x[a][b]=='N') q.push({-o-2, {a+1, b}});
            else if(x[a][b]=='W') q.push({-o-3, {a+1, b}});
        }
        if(b) {
            if(x[a][b]=='W') q.push({-o, {a, b-1}});
            else if(x[a][b]=='S') q.push({-o-1, {a, b-1}});
            else if(x[a][b]=='E') q.push({-o-2, {a, b-1}});
            else if(x[a][b]=='N') q.push({-o-3, {a, b-1}});
        }
        if(b<m-1) {
            if(x[a][b]=='E') q.push({-o, {a, b+1}});
            else if(x[a][b]=='N') q.push({-o-1, {a, b+1}});
            else if(x[a][b]=='W') q.push({-o-2, {a, b+1}});
            else if(x[a][b]=='S') q.push({-o-3, {a, b+1}});
        }
    }
    cout << odl[n-1][m-1] << '\n';
}

Subtask #1
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 4 ms 6380 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 12.0

# Verdict Execution time Memory Grader output
1 Incorrect 4 ms 6380 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 6380 KB Output is correct
2 Correct 4 ms 6380 KB Output is correct
3 Incorrect 4 ms 6380 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #4
0 / 16.0

# Verdict Execution time Memory Grader output
1 Incorrect 5 ms 6380 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 50.0

# Verdict Execution time Memory Grader output
1 Incorrect 4 ms 6380 KB Output isn't correct
2 Halted 0 ms 0 KB -