# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
496338 | 2021-12-21T06:05:10 Z | Ziel | Nautilus (BOI19_nautilus) | C++17 | 4 ms | 844 KB |
/** * LES GREATEABLES BRO TEAM **/ #include <bits/stdc++.h> using namespace std; using ll = long long; #define sz(x) (int)x.size() const bool FLAG = false; void setIO(const string &f = ""); #define int ll void solve() { int r, c, m; cin >> r >> c >> m; vector<vector<char>> a(r + 1, vector<char>(c + 1)); for (int i = 1; i <= r; i++) { for (int j = 1; j <= c; j++) { cin >> a[i][j]; } } string s; cin >> s; int ans = 0; auto in_frame = [r, c](int x, int y) -> bool { return x >= 1 && x <= r && y >= 1 && y <= c; }; set<pair<int, int>> st; for (int i = 1; i <= r; i++) { for (int j = 1; j <= c; j++) { int ci = i, cj = j; bool ok = true; for (int k = 0; k < m; k++) { if (s[k] == 'N') ci--; if (s[k] == 'S') ci++; if (s[k] == 'E') cj++; if (s[k] == 'W') cj--; if (in_frame(ci, cj) && a[ci][cj] == '.') continue; else { ok = false; break; } } if (!ok) continue; st.insert({ci,cj}); } } cout << sz(st); } signed main() { setIO(); int tt = 1; if (FLAG) { cin >> tt; } while (tt--) { solve(); } return 0; } void setIO(const string &f) { ios_base::sync_with_stdio(false); cin.tie(nullptr); if (fopen((f + ".in").c_str(), "r")) { freopen((f + ".in").c_str(), "r", stdin); freopen((f + ".out").c_str(), "w", stdout); } }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 4 ms | 844 KB | Output is correct |
2 | Incorrect | 1 ms | 332 KB | Output isn't correct |
3 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 4 ms | 844 KB | Output is correct |
2 | Incorrect | 1 ms | 332 KB | Output isn't correct |
3 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 4 ms | 844 KB | Output is correct |
2 | Incorrect | 1 ms | 332 KB | Output isn't correct |
3 | Halted | 0 ms | 0 KB | - |