oj.uz

Submission #648172

# Submission time Handle Problem Language Result Execution time Memory
648172 2022-10-05T16:04:47 Z ghostwriter Nautilus (BOI19_nautilus) C++14
66 / 100
 1000 ms 2772 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, d[R][R], d1[R][R], rs = 0;
char a[R][R], s[M];
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];
    FOR(i, 1, m) cin >> s[i];
    FOR(i, 1, r)
    FOR(j, 1, c)
    	if (a[i][j] != '#')
    		d1[i][j] = 1;
    FOR(i, 1, m) {
    	char cur = s[i];
    	FOR(x, 1, r)
    	FOR(y, 1, c) {
    		if (a[x][y] == '#') continue;
    		if (cur == 'N') d[x][y] = d1[x + 1][y];
    		else if (cur == 'E') d[x][y] = d1[x][y - 1];
    		else if (cur == 'S') d[x][y] = d1[x - 1][y];
    		else if (cur == 'W') d[x][y] = d1[x][y + 1];
    		else d[x][y] = d1[x - 1][y] || d1[x][y + 1] || d1[x + 1][y] || d1[x][y - 1];
    	}
    	// cerr << i << " : \n";
    	// FOR(x, 1, r) {
	    // 	FOR(y, 1, c) cerr << d[x][y];
	    // 	cerr << '\n';
    	// }
    	// cerr << '\n';
    	FOR(x, 1, r)
    	FOR(y, 1, c)
    		d1[x][y] = d[x][y];
    }
    FOR(i, 1, r)
    FOR(j, 1, c)
    	if (d[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:60:5: note: in expansion of macro 'FOR'
   60 |     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:61:5: note: in expansion of macro 'FOR'
   61 |     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:63:5: note: in expansion of macro 'FOR'
   63 |     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:64:5: note: in expansion of macro 'FOR'
   64 |     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:65:5: note: in expansion of macro 'FOR'
   65 |     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:68:5: note: in expansion of macro 'FOR'
   68 |     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:70:6: note: in expansion of macro 'FOR'
   70 |      FOR(x, 1, r)
      |      ^~~
nautilus.cpp:32:31: warning: unnecessary parentheses in declaration of 'y' [-Wparentheses]
   32 | #define FOR(i, l, r) for (int (i) = (l); (i) <= (r); ++(i))
      |                               ^
nautilus.cpp:71:6: note: in expansion of macro 'FOR'
   71 |      FOR(y, 1, c) {
      |      ^~~
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:85:6: note: in expansion of macro 'FOR'
   85 |      FOR(x, 1, r)
      |      ^~~
nautilus.cpp:32:31: warning: unnecessary parentheses in declaration of 'y' [-Wparentheses]
   32 | #define FOR(i, l, r) for (int (i) = (l); (i) <= (r); ++(i))
      |                               ^
nautilus.cpp:86:6: note: in expansion of macro 'FOR'
   86 |      FOR(y, 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:89:5: note: in expansion of macro 'FOR'
   89 |     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:90:5: note: in expansion of macro 'FOR'
   90 |     FOR(j, 1, c)
      |     ^~~

Subtask #1
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 724 KB Output is correct
2 Correct 4 ms 724 KB Output is correct
3 Correct 5 ms 724 KB Output is correct
4 Correct 6 ms 800 KB Output is correct
5 Correct 4 ms 724 KB Output is correct
6 Correct 2 ms 596 KB Output is correct

Subtask #2
37.0 / 37.0

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

Subtask #3
0 / 34.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 724 KB Output is correct
2 Correct 4 ms 724 KB Output is correct
3 Correct 5 ms 724 KB Output is correct
4 Correct 6 ms 800 KB Output is correct
5 Correct 4 ms 724 KB Output is correct
6 Correct 2 ms 596 KB Output is correct
7 Correct 3 ms 724 KB Output is correct
8 Correct 7 ms 724 KB Output is correct
9 Correct 6 ms 724 KB Output is correct
10 Correct 6 ms 724 KB Output is correct
11 Correct 2 ms 596 KB Output is correct
12 Correct 3 ms 724 KB Output is correct
13 Correct 6 ms 728 KB Output is correct
14 Correct 10 ms 800 KB Output is correct
15 Correct 4 ms 724 KB Output is correct
16 Correct 2 ms 596 KB Output is correct
17 Correct 3 ms 724 KB Output is correct
18 Correct 5 ms 724 KB Output is correct
19 Correct 6 ms 800 KB Output is correct
20 Correct 4 ms 728 KB Output is correct
21 Correct 2 ms 596 KB Output is correct
22 Execution timed out 1084 ms 2772 KB Time limit exceeded
23 Halted 0 ms 0 KB -