Submission #999843

# Submission time Handle Problem Language Result Execution time Memory
999843 2024-06-16T07:32:25 Z hacizadal Awesome Arrowland Adventure (eJOI19_adventure) C++17
0 / 100
1 ms 348 KB
/* :) */
#include <bits/stdc++.h>
using namespace std;
#define endl '\n'
#define ll long long
#define pll pair<ll, ll>
char a[505][505];

int main()
{
    ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
    ll n, m, f = 1, cnt = 0;
    cin>>n>>m;
    for (ll i = 1; i<=n; i++){
        for (ll j = 1; j<=m; j++){
            cin>>a[i][j];
            if (a[i][j] == 'X' and i < n) f = 0;
        }
    }
    if (f){
        cout<<-1;
        return 0;
    }
    for (ll i = 1; i<=n-1; i++){
        if (a[i][1] == 'N') cnt += 2;
        else if (a[i][1] == 'W') cnt++;
        else if (a[i][1] == 'S') cnt += 3;
    }
    cout<<cnt;
}
# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Incorrect 0 ms 348 KB Output isn't correct
4 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Incorrect 0 ms 348 KB Output isn't correct
4 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 344 KB Output isn't correct
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 348 KB Output isn't correct
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Incorrect 0 ms 348 KB Output isn't correct
4 Halted 0 ms 0 KB -