#include<bits/stdc++.h>
using namespace std;
int main(){
int n,m,ans=0;
bool possible=true;
cin>>m>>n;
map<char,int>turn={{'W',2},{'N',1},{'S',3},{'E',0}};
vector<vector<char>>v(n+5,vector<char>(m+5));
for(int i=0;i<n;i++){
for(int j=0;j<m;j++){
cin>>v[i][j];
if(v[i][j]=='X' && i<n-1){
possible=false;
}
else{
ans+=turn[v[i][j]];
}
}
}
if(possible==false){
return cout<<-1,0;
}
cout<<ans;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |