oj.uz

답안 #559866

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
559866 2022-05-10T19:09:50 Z aryan12 Nautilus (BOI19_nautilus) C++17
100 / 100
 218 ms 692 KB 
#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.0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 424 KB Output is correct
2 Correct 1 ms 404 KB Output is correct
3 Correct 1 ms 420 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 468 KB Output is correct
6 Correct 1 ms 340 KB Output is correct

Subtask #2
37.0 / 37.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 424 KB Output is correct
2 Correct 1 ms 404 KB Output is correct
3 Correct 1 ms 420 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 468 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 2 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 2 ms 420 KB Output is correct
13 Correct 1 ms 420 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 1 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 1 ms 340 KB Output is correct

Subtask #3
34.0 / 34.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 424 KB Output is correct
2 Correct 1 ms 404 KB Output is correct
3 Correct 1 ms 420 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 468 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 2 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 2 ms 420 KB Output is correct
13 Correct 1 ms 420 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 1 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 1 ms 340 KB Output is correct
22 Correct 101 ms 668 KB Output is correct
23 Correct 94 ms 676 KB Output is correct
24 Correct 91 ms 672 KB Output is correct
25 Correct 97 ms 672 KB Output is correct
26 Correct 88 ms 672 KB Output is correct
27 Correct 161 ms 668 KB Output is correct
28 Correct 163 ms 596 KB Output is correct
29 Correct 161 ms 692 KB Output is correct
30 Correct 159 ms 596 KB Output is correct
31 Correct 161 ms 672 KB Output is correct
32 Correct 210 ms 680 KB Output is correct
33 Correct 211 ms 668 KB Output is correct
34 Correct 211 ms 672 KB Output is correct
35 Correct 218 ms 596 KB Output is correct
36 Correct 203 ms 668 KB Output is correct