Submission #1073445

#TimeUsernameProblemLanguageResultExecution timeMemory
1073445steveonalexNautilus (BOI19_nautilus)C++17
100 / 100
168 ms1368 KiB
#include <bits/stdc++.h> using namespace std; typedef long long ll; typedef unsigned long long ull; #define MASK(i) (1LL << (i)) #define GETBIT(mask, i) (((mask) >> (i)) & 1) #define ALL(v) (v).begin(), (v).end() #define block_of_code if(true) ll max(ll a, ll b){return (a > b) ? a : b;} ll min(ll a, ll b){return (a < b) ? a : b;} ll gcd(ll a, ll b){return __gcd(a, b);} ll lcm(ll a, ll b){return a / gcd(a, b) * b;} ll LASTBIT(ll mask){return (mask) & (-mask);} int pop_cnt(ll mask){return __builtin_popcountll(mask);} int ctz(ull mask){return __builtin_ctzll(mask);} int logOf(ull mask){return 63 - __builtin_clzll(mask);} mt19937_64 rng(chrono::high_resolution_clock::now().time_since_epoch().count()); ll rngesus(ll l, ll r){return l + (ull) rng() % (r - l + 1);} double rngesus_d(double l, double r){ double cur = rngesus(0, MASK(60) - 1); cur /= MASK(60) - 1; return l + cur * (r - l); } template <class T1, class T2> bool maximize(T1 &a, T2 b){ if (a < b) {a = b; return true;} return false; } template <class T1, class T2> bool minimize(T1 &a, T2 b){ if (a > b) {a = b; return true;} return false; } template <class T> void printArr(T container, string separator = " ", string finish = "\n", ostream &out = cout){ for(auto item: container) out << item << separator; out << finish; } template <class T> void remove_dup(vector<T> &a){ sort(ALL(a)); a.resize(unique(ALL(a)) - a.begin()); } const int N = 500; int main(void){ ios::sync_with_stdio(0);cin.tie(0); cout.tie(0); clock_t start = clock(); int n, m, k; cin >> n >> m >> k; vector<string> s(n); for(int i = 0; i<n; ++i) cin >> s[i]; bitset<N * N> mask, dp, aux, nxt; #define tile(u, v) ((u) * m + (v)) for(int i = 0; i<n; ++i) for(int j = 0; j < m; ++j) if (s[i][j] == '.') mask[tile(i, j)] = dp[tile(i, j)] = 1; string ins; cin >> ins; for(char c: ins){ if (c == 'S'){ dp = (dp << m) & mask; } else if (c == 'N'){ dp = (dp >> m) & mask; } else if (c == 'W'){ for(int i = 0; i < n; ++i) dp[tile(i, 0)] = 0; dp = (dp >> 1) & mask; } else if (c == 'E'){ for(int i = 0; i < n; ++i) dp[tile(i, m-1)] = 0; dp = (dp << 1) & mask; } else{ aux = dp; nxt = (aux >> m) | (aux << m); for(int i = 0; i < n; ++i) aux[tile(i, 0)] = 0; nxt = nxt | (aux >> 1); aux = dp; for(int i = 0; i < n; ++i) aux[tile(i, m-1)] = 0; nxt = nxt | (aux << 1); dp = nxt & mask; } } cout << dp.count() << "\n"; cerr << "Time elapsed: " << clock() - start << " ms\n"; return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...