Submission #975251

#TimeUsernameProblemLanguageResultExecution timeMemory
975251vjudge1Awesome Arrowland Adventure (eJOI19_adventure)C++17
22 / 100
1 ms604 KiB
#include <bits/stdc++.h>
using namespace std;
#define ll long long

const int N = 5e2 + 5;

char grid[N][N];

int n, m;

signed main(){
    ios_base::sync_with_stdio(0); cin.tie(0);

    cin >> n >> m;

    for ( int i = 1; i <= n; i++){
        for ( int j = 1; j <= m; j++){
            cin >> grid[i][j];
        }
    }

    // subsoal 1 & 2

    if ( n == 1 ){
        bool valid = true;

        for ( int i = 1; i <= m - 1; i++){
            if ( grid[1][i] == 'X') valid = false;
        }

        if ( !valid ){
            cout << -1 << endl;
            return 0;
        }

        int ans = 0;

        for ( int i = 1; i <= m - 1; i++){
            if ( grid[1][i] == 'N') ans++;
            else if ( grid[1][i] == 'S') ans += 3;
            else if ( grid[1][i] == 'W') ans += 2; 
        }
        cout << ans << endl;
    }

}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...