oj.uz

Submission #736912

# Submission time Handle Problem Language Result Execution time Memory
736912 2023-05-06T10:39:07 Z ksu2009en Awesome Arrowland Adventure (eJOI19_adventure) C++14
0 / 100
 1 ms 340 KB 
#include <iostream>
#include <vector>
#include <string>
#include <math.h>
#include <cmath>
#include <iomanip>
#include <cstdio>
#include <algorithm>
#include <numeric>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <deque>
#include <bitset>
#include <cstring>
#include <unordered_map>

using namespace std;
typedef int ll;

ll dp[507][507];
string a[507];

char rotate(char c){
    if(c == 'N')
        return 'E';
    if(c == 'E')
        return 'S';
    if(c == 'S')
        return 'W';
    return 'N';
}

pair<ll, ll> move(ll &r, ll &c, char &v){
    if(v == 'N')
        return {r - 1, c};
    if(v == 'E')
        return {r, c + 1};
    if(v == 'S')
        return {r + 1, c};
    return {r, c - 1};
}

ll n, m;

void count_dp(ll r, ll c, ll step){
    if(r < 1 || c < 1 || r > n || c > m || dp[r][c] <= step){
        return;
    }
        
    if(a[r][c] == 'X'){
        if(r == n && c == m)
            dp[r][c] = step;
        return;
    }
    
    dp[r][c] = step;
    
    char v = a[r][c];
    
    for(int i = 0; i < 4; i++){
        auto y = move(r, c, v);
        if(y.first >= 1 && y.second >= 1 && y.first <= n && y.second <= m && dp[y.first][y.second] <= step)
            count_dp(y.first, y.second, step + i);
        
        v = rotate(v);
    }
}

ll cost(char a, char b){
    for(int i = 0; i < 4; i++){
        if(a == b)
            return i;
        
        a = rotate(a);
    }
    return 0;
}

#define endl '\n'

int main(){
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    
    cin >> n >> m;
    
    for(int i = 1; i <= n; i++){
        cin >> a[i];
        
         
        a[i] = "#" + a[i];
    }
    
    for(int i = 1; i <= n; i++)
        for(int j = 1; j <= m; j++)
            dp[i][j] = 1e9;
    
    ll s1 = 1;
    
    count_dp(s1, s1, 0);
    if(dp[n][m] == (ll)(1e9))
        dp[n][m] = -1;
    
    cout << dp[n][m] << endl;
        
     
    return 0;
}
/*
 2 13
 SSNWNEWESEWWE
 WSENESSWNNSWW
 */
/*
 2 11
 W W W E S N N S S E W
 W E E N W W E S S W W
 
 */
/*
 2 5
 EXNWS
 SEEXX
 
 */
/*
 2 4
  EWEW
  EWXX
 
 */

/*
 2 4
 EWEW
 EWEX
 
 */

Subtask #1
0 / 10.0

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

Subtask #2
0 / 12.0

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

Subtask #3
0 / 12.0

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

Subtask #4
0 / 16.0

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

Subtask #5
0 / 50.0

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