Submission #1307340

#TimeUsernameProblemLanguageResultExecution timeMemory
1307340yusifmAwesome Arrowland Adventure (eJOI19_adventure)C++20
22 / 100
1 ms628 KiB
#pragma GCC optimize("O3") #include <bits/stdc++.h> #define ll long long #define str string #define pb push_back #define pf push_front #define in insert #define all(v) v.begin(),v.end() const int sz=1000000,INF=1000000000; using namespace std; void solve() { ll n,m,ans=0; cin>>n>>m; vector<vector<char>>grid(n+1,vector<char>(m+1)); for(int i=0;i<n;i++) { for(int j=0;j<m;j++) { cin>>grid[i][j]; if(grid[i][j]=='X') { if(j!=m-1) { ans=-1; } } } } if(ans!=-1) { for(int i=0;i<n;i++) { for(int j=0;j<m;j++) { if(grid[i][j]=='N') { ans++; } else if(grid[i][j]=='S') { ans+=3; } else if(grid[i][j]=='W') { ans+=2; } } } } cout<<ans; } int main() { ios_base::sync_with_stdio(false); cin.tie(nullptr),cout.tie(nullptr); ll t=1; //cin>>t; while(t--) { solve(); } }
#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...