oj.uz

Submission #332835

# Submission time Handle Problem Language Result Execution time Memory
332835 2020-12-03T16:14:03 Z sinamhdv Nautilus (BOI19_nautilus) C++11
100 / 100
 268 ms 160768 KB 
#include <bits/stdc++.h>
using namespace std;

typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
const int mod = 1000 * 1000 * 1000 + 7;
const int INF = 1000 * 1000 * 1000;
const ll LINF = (ll)INF * INF;

#ifdef DEBUG
#define dbg(x) cout << #x << " = " << (x) << endl << flush;
#define dbgr(s, f) { cout << #s << ": "; for (auto _ = (s); _ != (f); _++) cout << *_ << ' '; cout << endl << flush; }
#else
#define dbg(x) ;
#define dbgr(s, f) ;
#endif
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define fast_io ios::sync_with_stdio(false); cin.tie(0); cout.tie(0);
#define msub(a, b) ((mod + ((a) - (b)) % mod) % mod)
#define mdiv(a, b) ((a) * poww((b), mod - 2) % mod)
#define all(x) (x).begin(), (x).end()
#define pb push_back
#define mp make_pair
#define fr first
#define sc second
#define endl '\n'

#define MAXN 510
#define MAXM 5010

bitset<MAXN> dp[MAXM][MAXN];
char grid[MAXN][MAXN];
bitset<MAXN> gbit[MAXN];
char s[MAXM];
int r, c, m;

int32_t main(void)
{
	fast_io;
	cin >> r >> c >> m;
	FOR(i, 1, r + 1)
	{
		FOR(j, 1, c + 1)
		{
			cin >> grid[i][j];
		}
	}
	cin >> (s + 1);
	FOR(i, 1, r + 1)
	{
		FOR(j, 1, c + 1)
		{
			dp[0][i][j] = (grid[i][j] != '.');
			gbit[i][j] = (grid[i][j] != '.');
		}
		dp[0][i][0] = dp[0][i][c + 1] = 1;
	}
	FOR(k, 0, m + 1)
	{
		dp[k][r + 1].set();
		dp[k][0].set();
	}
	FOR(k, 1, m + 1)
	{
		FOR(i, 1, r + 1)
		{
			if (s[k] == 'N')
			{
				dp[k][i] |= dp[k - 1][i + 1];
			}
			else if (s[k] == 'S')
			{
				dp[k][i] |= dp[k - 1][i - 1];
			}
			else if (s[k] == 'E')
			{
				dp[k][i] |= (dp[k - 1][i] << 1);
			}
			else if (s[k] == 'W')
			{
				dp[k][i] |= (dp[k - 1][i] >> 1);
			}
			else	// ?
			{
				dp[k][i] |= (dp[k - 1][i] >> 1) & (dp[k - 1][i] << 1) & (dp[k - 1][i - 1]) & (dp[k - 1][i + 1]);
			}
			dp[k][i] |= gbit[i];
			dp[k][i][0] = dp[k][i][c + 1] = 1;
		}
		/*FOR(i, 1, r +1)
		{
			FOR(j, 1, c + 1)
			{
				cout << dp[k][i][j] << ' ';
			}
			cout << endl;
		}
		dbg("================");
		*/
	}
	int ans = 0;
	FOR(i, 1, r + 1)
	{
		FOR(j, 1, c + 1)
		{
			if (dp[m][i][j] == 0)
			{
				ans++;
			}
		}
	}
	cout << ans << endl;
	return 0;
}

Subtask #1
29.0 / 29.0

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

Subtask #2
37.0 / 37.0

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

Subtask #3
34.0 / 34.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 1644 KB Output is correct
2 Correct 2 ms 1516 KB Output is correct
3 Correct 1 ms 1516 KB Output is correct
4 Correct 2 ms 1516 KB Output is correct
5 Correct 2 ms 1516 KB Output is correct
6 Correct 1 ms 1516 KB Output is correct
7 Correct 2 ms 1516 KB Output is correct
8 Correct 2 ms 1516 KB Output is correct
9 Correct 2 ms 1464 KB Output is correct
10 Correct 2 ms 1516 KB Output is correct
11 Correct 2 ms 1516 KB Output is correct
12 Correct 2 ms 1516 KB Output is correct
13 Correct 2 ms 1516 KB Output is correct
14 Correct 2 ms 1516 KB Output is correct
15 Correct 2 ms 1516 KB Output is correct
16 Correct 2 ms 1516 KB Output is correct
17 Correct 2 ms 1516 KB Output is correct
18 Correct 2 ms 1408 KB Output is correct
19 Correct 2 ms 1536 KB Output is correct
20 Correct 2 ms 1516 KB Output is correct
21 Correct 2 ms 1536 KB Output is correct
22 Correct 175 ms 160620 KB Output is correct
23 Correct 179 ms 160620 KB Output is correct
24 Correct 178 ms 160768 KB Output is correct
25 Correct 174 ms 160620 KB Output is correct
26 Correct 173 ms 160576 KB Output is correct
27 Correct 225 ms 160620 KB Output is correct
28 Correct 242 ms 160620 KB Output is correct
29 Correct 228 ms 160640 KB Output is correct
30 Correct 228 ms 160640 KB Output is correct
31 Correct 223 ms 160620 KB Output is correct
32 Correct 265 ms 160620 KB Output is correct
33 Correct 264 ms 160620 KB Output is correct
34 Correct 268 ms 160748 KB Output is correct
35 Correct 266 ms 160620 KB Output is correct
36 Correct 261 ms 160620 KB Output is correct