Submission #496408

#	Time	Username	Problem	Language	Result	Execution time	Memory
496408		ergagan	Nautilus (BOI19_nautilus)	C++17	0 / 100	3 ms	716 KiB

nautilus

//я так много думал, что опять попал
#include <bits/stdc++.h>
#define all(x) x.begin(),x.end()
#define pb push_back
#define ppb pop_back
#define pf push_front
#define ppf pop_front
#define f first
#define s second
#define left(v) v + v
#define right(v) v + v + 1
#define ub upper_bound
#define lb lower_bound

using namespace std;
typedef long long ll;

//17 SEVENTEEN
const long double Pi = acos(-1.0);
const ll dx[] = {0,0,1,-1};
const ll dy[] = {1,-1,0,0};
const ll N = (ll) 1e6 + 17;
const ll M = (ll) 5e3 + 69;
const ll inf = (ll) 1e14 + 3;
const ll mod = (ll) 1e9 + 7;
ll sq(ll x) { return x * x; }

ll zxc = 1, n, m, sz, ans;

string s;

char a[M][M];

bool check(ll x, ll y) {
    for(ll i = 1; i <= sz; i++) {

        if(s[i] == 'W') y--;
        if(s[i] == 'N') x--;
        if(s[i] == 'E') y++;
        if(s[i] == 'S') x++;

        if(s[i] == '#' || x < 1 || x > n || y < 1 || y > m) return 0;
    }
    return 1;
}

void solve() {

    cin >> n >> m >> sz;
    for(ll i = 1; i <= n; i++) {
        for(ll j = 1; j <= m; j++) {
            cin >> a[i][j];
        }
    }
    cin >> s;
    s = " " + s;
    for(ll i = 1; i <= n; i++) {
        for(ll j = 1; j <= m; j++) {
            if(a[i][j] != '#')
                ans += check(i, j);
        }
    }
    cout << ans << "\n";
}

int main(/*Уверенно*/) {
ios_base::sync_with_stdio(0);
    cin.tie(0);
/*
	freopen(".in", "r", stdin);
	freopen(".out", "w", stdout);
*/
//    cin >> zxc;
    while(zxc--) {
        solve();
    }
  	return 0;
}
// さよならさ いかなくちゃ

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