Submission #1187502

#TimeUsernameProblemLanguageResultExecution timeMemory
1187502TheSahibNautilus (BOI19_nautilus)C++20
100 / 100
96 ms708 KiB
#pragma GCC optimize("O3") #pragma GCC target("popcnt") #include <bits/stdc++.h> #define ll long long #define ull unsigned long long #define oo 1e9 #define pii pair<int, int> using namespace std; int n, m, q; const int MAX = 503; bitset<MAX * MAX> st, can; int main() { cin >> n >> m >> q; for (int i = 0; i < n; i++) { string s; cin >> s; can[i * (m + 2)] = 0; can[(i + 1) * (m + 2) - 1] = 0; for (int j = 1; j <= m; j++) { can[i * (m + 2) + j] = s[j - 1] == '.'; } } st = can; string s; cin >> s; for (int i = 0; i < q; i++) { if(s[i] == 'W'){ st >>= 1; } else if(s[i] == 'S'){ st <<= m + 2; } else if(s[i] == 'E'){ st <<= 1; } else if(s[i] == 'N'){ st >>= m + 2; } else{ st = (st << 1) | (st >> 1) | (st << (m + 2)) | (st >> (m + 2)); } st &= can; } cout << st.count() << '\n'; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...