Submission #559866

#	Time	Username	Problem	Language	Result	Execution time	Memory
559866		aryan12	Nautilus (BOI19_nautilus)	C++17	100 / 100	218 ms	692 KiB

nautilus

#include <bits/stdc++.h>
using namespace std;
#define int long long

mt19937_64 RNG(chrono::steady_clock::now().time_since_epoch().count());

const int N = 502, M = 5002;

void Solve() 
{
	int n, m, q;
	cin >> n >> m >> q;
	bitset<N> a[N];
	bitset<N> dp[N][2];
	for(int i = 0; i < n; i++)
	{
		string s;
		cin >> s;
		for(int j = 0; j < m; j++)
		{
			a[i][j] = (s[j] == '.') ? 1 : 0;
			if(a[i][j] == 1)
			{
				dp[i][1][j] = 1;
			}
		}
	}
	string s;
	cin >> s;
	for(int i = 0; i < q; i++)
	{	
		int cur = i & 1, prev = cur ^ 1;
		for(int j = 0; j < n; j++)
		{
			if(s[i] == 'N')
			{
				dp[j][cur] = dp[j + 1][prev] & a[j];
			}
			else if(s[i] == 'S' && j != 0)
			{
				dp[j][cur] = dp[j - 1][prev] & a[j];
			}
			else if(s[i] == 'W')
			{
				dp[j][cur] = (dp[j][prev] >> 1) & a[j];
			}
			else if(s[i] == 'E')
			{
				dp[j][cur] = (dp[j][prev] << 1) & a[j];
			}
			else
			{
				if(s[i] == 'S')
				{
					dp[j][cur].reset();
					continue;
				}
				if(j == 0)
				{
					dp[j][cur] = ((dp[j + 1][prev]) | (dp[j][prev] >> 1) | (dp[j][prev] << 1)) & a[j];
				}
				else
				{
					dp[j][cur] = ((dp[j - 1][prev]) | (dp[j + 1][prev]) | (dp[j][prev] >> 1) | (dp[j][prev] << 1)) & a[j];
				}
			}
		}
		// for(int j = 0; j < n; j++)
		// {
		// 	for(int k = 0; k < m; k++)
		// 	{
		// 		cout << dp[j][i & 1][k] << " ";
		// 	}
		// 	cout << "\n";
		// }
	}
	int ans = 0;
	for(int i = 0; i < n; i++)
	{
		for(int j = 0; j < m; j++)
		{
			ans += dp[i][(q - 1) & 1][j];
			// cout << dp[i][(q - 1) & 1][j] << " ";
		}
		// cout << "\n";
	}
	cout << ans << "\n";
}

int32_t main() 
{
	auto begin = std::chrono::high_resolution_clock::now();
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	int t = 1;
	// cin >> t;
	for(int i = 1; i <= t; i++) 
	{
		//cout << "Case #" << i << ": ";
		Solve();
	}
	auto end = std::chrono::high_resolution_clock::now();
    auto elapsed = std::chrono::duration_cast<std::chrono::nanoseconds>(end - begin);
    cerr << "Time measured: " << elapsed.count() * 1e-9 << " seconds.\n"; 
	return 0;
}

• Subtask 1: 29 / 29
• Subtask 2: 37 / 37
• Subtask 3: 34 / 34