# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1072656 | kh0i | Nautilus (BOI19_nautilus) | C++17 | 197 ms | 1104 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include "bits/stdc++.h"
using namespace std;
#ifdef LOCAL
#include "debug.h"
#else
#define debug(...)
#endif
using ll = long long;
using pii = pair<int, int>;
#define F first
#define S second
#define sz(x) (int)((x).size())
#define all(x) (x).begin(), (x).end()
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
ll get_rand(ll l, ll r) {
assert(l <= r);
return uniform_int_distribution<ll> (l, r)(rng);
}
const int N = 503;
int n, m, k;
char c[N][N];
bitset<N> f[N], g[N], grid[N];
string s;
void solve(){
cin >> n >> m >> k;
for(int i = 1; i <= n; ++i){
for(int j = 1; j <= m; ++j){
cin >> c[i][j];
if(c[i][j] == '.')
grid[i][j] = 1;
}
f[i] = grid[i];
}
cin >> s;
for(char mv : s){
for(int i = 1; i <= n; ++i)
g[i] = 0;
if(mv == '?' or mv == 'N'){
for(int i = 1; i < n; ++i)
g[i] |= f[i + 1];
}
if(mv == '?' or mv == 'S'){
for(int i = 2; i <= n; ++i)
g[i] |= f[i - 1];
}
if(mv == '?' or mv == 'W'){
for(int i = 1; i <= n; ++i)
g[i] |= f[i] >> 1;
}
if(mv == '?' or mv == 'E'){
for(int i = 1; i <= n; ++i)
g[i] |= f[i] << 1;
}
for(int i = 1; i <= n; ++i)
f[i] = (g[i] & grid[i]);
}
int res = 0;
for(int i = 1; i <= n; ++i)
res += f[i].count();
cout << res;
}
int32_t main() {
cin.tie(nullptr)->sync_with_stdio(0);
#define task "troll"
if(fopen(task".inp", "r")){
freopen(task".inp", "r", stdin);
freopen(task".out", "w", stdout);
}
int test = 1;
// cin >> test;
for(int i = 1; i <= test; ++i){
// cout << "Case #" << i << ": ";
solve();
}
#ifdef LOCAL
cerr << "\n[Time]: " << 1000.0 * clock() / CLOCKS_PER_SEC << " ms.\n";
#endif
return 0;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |