제출 #526215

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
526215		Yazan_Alattar	Nautilus (BOI19_nautilus)	C++14	100 / 100	151 ms	632 KiB

nautilus

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define F first
#define S second
#define pb push_back
#define endl "\n"
#define all(x) x.begin(), x.end()
const int M = 505;
const ll inf = 2e9;
const ll mod = 998244353;
const double pi = acos(-1);
const int dx[] = {1, 0, -1, 0}, dy[] = {0, 1, 0, -1};

vector < bitset <M> > dp(M);
bitset <M> a[M];
string s;
int n, m, ans, len;

int main()
{
	cin >> n >> m >> len;
	for(int i = 1; i <= n; ++i) for(int j = 1; j <= m; ++j){
		char c;
		cin >> c;
		if(c == '.') a[i][j] = 1, dp[i][j] = 1;
	}
	cin >> s;
	for(int i = 0; i < len; ++i){
		vector < bitset <M> > to(M);
		for(int j = 1; j <= n; ++j){
			if(s[i] == '?' || s[i] == 'N') to[j - 1] |= dp[j];
			if(s[i] == '?' || s[i] == 'S') to[j + 1] |= dp[j];
			if(s[i] == '?' || s[i] == 'E') to[j] |= (dp[j] << 1);
			if(s[i] == '?' || s[i] == 'W') to[j] |= (dp[j] >> 1);
		}
		dp = to;
		for(int j = 1; j <= n; ++j) dp[j] &= a[j];
	}
	for(int i = 1; i <= n; ++i) ans += dp[i].count();
	cout << ans << endl;
	return 0;
}

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