Submission #496465

#	Time	Username	Problem	Language	Result	Execution time	Memory
496465		armashka	Nautilus (BOI19_nautilus)	C++17	66 / 100	25 ms	2036 KiB

nautilus

#include <bits/stdc++.h>
 
//#pragma comment(linker, "/stack:200000000")
//#pragma GCC optimize("Ofast")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
 
#define fast ios_base::sync_with_stdio(false);cin.tie(nullptr);cout.tie(nullptr);
#define all(v) v.begin(),v.end()
#define pb push_back
#define sz size()
#define ft first
#define sd second
 
using namespace std;
typedef long long ll;
typedef pair<ll, ll> pll;
typedef unsigned long long ull;
 
const int N = 2e5 + 5;
const ll M = 1e8;
const ll inf = 1e9;
const ll mod = 1e9;
const double Pi = acos(-1); 
 
ll binpow(ll x, ll ti) { ll res = 1;while (ti){if(ti & 1)res *= x;x *= x;ti >>= 1; x %= mod; res %= mod;} return res;}
ll binmul(ll x, ll ti) { ll res = 0;while (ti){if(ti & 1)res += x;x += x;ti >>= 1; x %= mod; res %= mod;} return res;}
ll nok(ll a, ll b) { return (a*b)/__gcd(abs(a),abs(b)) * (a*b > 0 ? 1 : -1); }
bool odd(ll n) { return (n % 2 == 1); }
bool even(ll n) { return (n % 2 == 0); }            
 
ll n, m, k;
string s;
char c[105][105];
set <pll> st;
bool used[105][105][105]; 

void rec(ll x, ll y, ll pos) {
	if (used[x][y][pos]) return;
	used[x][y][pos] = 1;
	if (pos == k) {
		st.insert({x, y});
		return;
	}
	if ((s[pos] == 'E' || s[pos] == '?') && y < m && c[x][y + 1] == '.') rec(x, y + 1, pos + 1);
	if ((s[pos] == 'W'  || s[pos] == '?') && y > 1 && c[x][y - 1] == '.') rec(x, y - 1, pos + 1);
	if ((s[pos] == 'S' || s[pos] == '?') && x < n && c[x + 1][y] == '.') rec(x + 1, y, pos + 1);
	if ((s[pos] == 'N' || s[pos] == '?') && x > 1 && c[x - 1][y] == '.') rec(x - 1, y, pos + 1);
}
 
const void solve(/*Armashka*/) {	
	cin >> n >> m >> k;
	for (int i = 1; i <= n; ++ i) {
		for (int j = 1; j <= m; ++ j) {
			cin >> c[i][j];
		}
	}
	cin >> s;
	for (int i = 1; i <= n; ++ i) {
		for (int j = 1; j <= m; ++ j) {
			if (c[i][j] == '.') rec(i, j, 0);
		}
	}
	cout << st.sz << "\n";
}   
 
signed main() {
    fast;
    //freopen("divide.in", "r", stdin);
    //freopen("divide.out", "w", stdout);
    int tt = 1;
    //cin >> tt;
    while (tt --) {
        solve();
    }
}                                                                          
 
/*
5 4 4
1 2
3 1
3 4
5 3
4 5 2 3
2 1 3 1
1 3 5
2 3 4 5
2 1 3 1
*/

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