oj.uz

Submission #648193

# Submission time Handle Problem Language Result Execution time Memory
648193 2022-10-05T16:39:50 Z ghostwriter Nautilus (BOI19_nautilus) C++14
100 / 100
 326 ms 920 KB 
#include <bits/stdc++.h>
using namespace std;
#ifdef LOCAL
#include <debug.h>
#else
#define debug(...)
#endif
#define ft front
#define bk back
#define st first
#define nd second
#define ins insert
#define ers erase
#define pb push_back
#define pf push_front
#define _pb pop_back
#define _pf pop_front
#define lb lower_bound
#define ub upper_bound
#define mtp make_tuple
#define bg begin
#define ed end
#define all(x) (x).bg(), (x).ed()
#define sz(x) (int)(x).size()
typedef long long ll; typedef unsigned long long ull;
typedef double db; typedef long double ldb;
typedef pair<int, int> pi; typedef pair<ll, ll> pll;
typedef vector<int> vi; typedef vector<ll> vll; typedef vector<pi> vpi; typedef vector<pll> vpll;
typedef string str;
template<typename T> T gcd(T a, T b) { return (b == 0? a : gcd(b, a % b)); }
template<typename T> T lcm(T a, T b) { return a / gcd(a, b) * b; }
#define FOR(i, l, r) for (int (i) = (l); (i) <= (r); ++(i))
#define FOS(i, r, l) for (int (i) = (r); (i) >= (l); --(i))
#define FRN(i, n) for (int (i) = 0; (i) < (n); ++(i))
#define FSN(i, n) for (int (i) = (n) - 1; (i) >= 0; --(i))
#define EACH(i, x) for (auto &(i) : (x))
#define WHILE while
#define file "TEST"
mt19937 rd(chrono::steady_clock::now().time_since_epoch().count());
ll rand(ll l, ll r) { return uniform_int_distribution<ll>(l, r)(rd); }
/*
----------------------------------------------------------------
    END OF TEMPLATE
----------------------------------------------------------------
    Tran The Bao - ghostwriter
    Training for VOI23 gold medal
----------------------------------------------------------------
    DIT ME CHUYEN BAO LOC
----------------------------------------------------------------
*/
const int R = 502;
const int M = 5002;
int r, c, m, rs = 0;
char a[R][R], s[M];
bitset<R> d[R], d1[R], d2[R];
signed main() {
    ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
    // freopen(file".inp", "r", stdin);
    // freopen(file".out", "w", stdout);
    cin >> r >> c >> m;
    FOR(i, 1, r)
    FOR(j, 1, c) {
    	cin >> a[i][j];
    	if (a[i][j] == '.') d1[i][j] = d2[i][j] = 1;
    }
    FOR(i, 1, m) cin >> s[i];
    FOR(i, 1, m) {
    	char cur = s[i];
    	FOR(x, 1, r) {
    		if (cur == 'N') d[x] = d2[x] & d1[x + 1];
    		else if (cur == 'E') d[x] = d2[x] & (d1[x] << 1);
    		else if (cur == 'S') d[x] = d2[x] & d1[x - 1];
    		else if (cur == 'W') d[x] = d2[x] & (d1[x] >> 1);
    		else d[x] = (d2[x] & d1[x - 1]) | (d2[x] & (d1[x] << 1)) | (d2[x] & d1[x + 1]) | (d2[x] & (d1[x] >> 1));
    	}
    	FOR(x, 1, r) swap(d[x], d1[x]);
    }
    FOR(i, 1, r)
    FOR(j, 1, c)
    	if (d1[i][j])
    		++rs;
    cout << rs;
    return 0;
}
/*
----------------------------------------------------------------
From Benq:
    stuff you should look for
        * int overflow, array bounds
        * special cases (n=1?)
        * do smth instead of nothing and stay organized
        * WRITE STUFF DOWN
        * DON'T GET STUCK ON ONE APPROACH
----------------------------------------------------------------
*/

Compilation message

nautilus.cpp: In function 'int main()':
nautilus.cpp:32:31: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
   32 | #define FOR(i, l, r) for (int (i) = (l); (i) <= (r); ++(i))
      |                               ^
nautilus.cpp:61:5: note: in expansion of macro 'FOR'
   61 |     FOR(i, 1, r)
      |     ^~~
nautilus.cpp:32:31: warning: unnecessary parentheses in declaration of 'j' [-Wparentheses]
   32 | #define FOR(i, l, r) for (int (i) = (l); (i) <= (r); ++(i))
      |                               ^
nautilus.cpp:62:5: note: in expansion of macro 'FOR'
   62 |     FOR(j, 1, c) {
      |     ^~~
nautilus.cpp:32:31: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
   32 | #define FOR(i, l, r) for (int (i) = (l); (i) <= (r); ++(i))
      |                               ^
nautilus.cpp:66:5: note: in expansion of macro 'FOR'
   66 |     FOR(i, 1, m) cin >> s[i];
      |     ^~~
nautilus.cpp:32:31: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
   32 | #define FOR(i, l, r) for (int (i) = (l); (i) <= (r); ++(i))
      |                               ^
nautilus.cpp:67:5: note: in expansion of macro 'FOR'
   67 |     FOR(i, 1, m) {
      |     ^~~
nautilus.cpp:32:31: warning: unnecessary parentheses in declaration of 'x' [-Wparentheses]
   32 | #define FOR(i, l, r) for (int (i) = (l); (i) <= (r); ++(i))
      |                               ^
nautilus.cpp:69:6: note: in expansion of macro 'FOR'
   69 |      FOR(x, 1, r) {
      |      ^~~
nautilus.cpp:32:31: warning: unnecessary parentheses in declaration of 'x' [-Wparentheses]
   32 | #define FOR(i, l, r) for (int (i) = (l); (i) <= (r); ++(i))
      |                               ^
nautilus.cpp:76:6: note: in expansion of macro 'FOR'
   76 |      FOR(x, 1, r) swap(d[x], d1[x]);
      |      ^~~
nautilus.cpp:32:31: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
   32 | #define FOR(i, l, r) for (int (i) = (l); (i) <= (r); ++(i))
      |                               ^
nautilus.cpp:78:5: note: in expansion of macro 'FOR'
   78 |     FOR(i, 1, r)
      |     ^~~
nautilus.cpp:32:31: warning: unnecessary parentheses in declaration of 'j' [-Wparentheses]
   32 | #define FOR(i, l, r) for (int (i) = (l); (i) <= (r); ++(i))
      |                               ^
nautilus.cpp:79:5: note: in expansion of macro 'FOR'
   79 |     FOR(j, 1, c)
      |     ^~~

Subtask #1
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 2 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 412 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct

Subtask #2
37.0 / 37.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 2 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 412 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 2 ms 384 KB Output is correct
12 Correct 2 ms 340 KB Output is correct
13 Correct 2 ms 340 KB Output is correct
14 Correct 2 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 2 ms 340 KB Output is correct
17 Correct 2 ms 340 KB Output is correct
18 Correct 2 ms 340 KB Output is correct
19 Correct 2 ms 340 KB Output is correct
20 Correct 2 ms 340 KB Output is correct
21 Correct 2 ms 340 KB Output is correct

Subtask #3
34.0 / 34.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 2 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 412 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 2 ms 384 KB Output is correct
12 Correct 2 ms 340 KB Output is correct
13 Correct 2 ms 340 KB Output is correct
14 Correct 2 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 2 ms 340 KB Output is correct
17 Correct 2 ms 340 KB Output is correct
18 Correct 2 ms 340 KB Output is correct
19 Correct 2 ms 340 KB Output is correct
20 Correct 2 ms 340 KB Output is correct
21 Correct 2 ms 340 KB Output is correct
22 Correct 135 ms 596 KB Output is correct
23 Correct 142 ms 920 KB Output is correct
24 Correct 151 ms 852 KB Output is correct
25 Correct 156 ms 852 KB Output is correct
26 Correct 141 ms 892 KB Output is correct
27 Correct 226 ms 908 KB Output is correct
28 Correct 225 ms 904 KB Output is correct
29 Correct 218 ms 912 KB Output is correct
30 Correct 223 ms 912 KB Output is correct
31 Correct 271 ms 852 KB Output is correct
32 Correct 254 ms 852 KB Output is correct
33 Correct 287 ms 908 KB Output is correct
34 Correct 264 ms 908 KB Output is correct
35 Correct 326 ms 908 KB Output is correct
36 Correct 277 ms 852 KB Output is correct