Submission #834615

#TimeUsernameProblemLanguageResultExecution timeMemory
834615VMaksimoski008Awesome Arrowland Adventure (eJOI19_adventure)C++14
10 / 100
1 ms316 KiB
#include <bits/stdc++.h> #define pb push_back #define eb emplace_back #define sz(x) (int)x.size() #define all(x) x.begin(), x.end() #define uniq(x) x.erase(unique(all(x)), x.end()) #define rall(x) x.rbegin(), x.rend() //#define int long long using namespace std; using ll = long long; using ull = unsigned long long; using ld = long double; using pii = pair<int, int>; using pll = pair<ll, ll>; const int mod = 1e9 + 7; const int LOG = 20; const int maxn = 1e5 + 5; const double eps = 1e-9; void setIO() { ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); } int dr[4] = {0, -1, 0, 1}; int dc[4] = {-1, 0, 1, 0}; int32_t main() { setIO(); int n, m; cin >> n >> m; int mat[n][m]; for(int i=0; i<n; i++) { for(int j=0; j<m; j++) { char ch; cin >> ch; if(ch == 'X') mat[i][j] = -1; if(ch == 'E') mat[i][j] = 2; if(ch == 'W') mat[i][j] = 0; if(ch == 'N') mat[i][j] = 1; if(ch == 'S') mat[i][j] = 3; } } if(n == 1) { int ans = 0; for(int j=0; j<m-1; j++) { if(mat[0][j] == -1) ans = -1; if(ans == -1) break; } cout << ans << '\n'; } return 0; }
#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...