제출 #1148225

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1148225		KluydQ	Nautilus (BOI19_nautilus)	C++20	66 / 100	22 ms	1860 KiB

nautilus

#include <bits/stdc++.h>
 
#define respagold ios_base::sync_with_stdio(0), cin.tie(0);
#define ll long long
//#define int long long
#define int2 __int128_t
#define FOR( i, x, n, d ) for( int i = x; i <= n; i += d )
#define FORR( i, x, n, d ) for( int i = x; i >= n; i -= d )
#define F first
#define S second
#define all(x) x.begin(), x.end()
#define sz(x) (int)(x.size())
#define pb push_back
#define ins insert
#define lb lower_bound
#define ub upper_bound
#define pii pair <int, int>
#define mkp make_pair
 
using namespace std;
 
const int N = 1e3 + 123;
const int inf = 2e9;
const int MOD1 = 1e9 + 7;
const int MOD = 998244353;
const int P = 6547;
 
int a[N], b[N], n, m, k, L, R, x, y, z, w;
char mp[N][N]; string s;
bool used[101][101][101], good[101][101];
 
mt19937 rng( chrono::steady_clock::now().time_since_epoch().count());
 
int rand( int l, int r )
{
    uniform_int_distribution <int> uid( l, r );
    return uid( rng );
}
set <pii> st;

bool valid( int x, int y )
{
	if( x < 1 || x > n || y < 1 || y > m || mp[x][y] == '#' ) return 0;
	return 1;
}
void rec( int i, int x, int y )
{
	if( used[i][x][y] ) return;
	used[i][x][y] = 1;
	
	if( i == s.size() )
	{
		good[x][y] = 1;
		return;
	}
	if( s[i] == 'N' && valid( x - 1, y ) ) rec( i + 1, x - 1, y );
	if( s[i] == 'S' && valid( x + 1, y ) ) rec( i + 1, x + 1, y );
	if( s[i] == 'E' && valid( x, y + 1 ) ) rec( i + 1, x, y + 1 );
	if( s[i] == 'W' && valid( x, y - 1 ) ) rec( i + 1, x, y - 1 );
	
	if( s[i] == '?' )
	{
		if( valid( x - 1, y ) ) rec( i + 1, x - 1, y );
		if( valid( x + 1, y ) ) rec( i + 1, x + 1, y );
		if( valid( x, y + 1 ) ) rec( i + 1, x, y + 1 );
		if( valid( x, y - 1 ) ) rec( i + 1, x, y - 1 );
	}
}
void solve()
{
	cin >> n >> m >> k;
	
	FOR( i, 1, n, 1 )
	{
		string s; cin >> s;
		
		FOR( j, 1, m, 1 ) mp[i][j] = s[j - 1];
	}
	cin >> s;
	
	FOR( i, 1, n, 1 )
	{
		FOR( j, 1, m, 1 )
		{
			if( mp[i][j] == '.' ) rec( 0, i, j ); 
		}
	}
	int ans = 0;
	FOR( i, 1, n, 1 ) FOR( j, 1, m, 1 ) ans += good[i][j];
	cout << ans;
}
signed main() 
{
//	freopen("connect.in", "r", stdin);
//	freopen("connect.out", "w", stdout);
	    
    respagold
    
    int test = 1;
    
    if( !test ) cin >> test;
	
	while( test -- )
	{
		solve();
	}
}
// solved by KluydQ  

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