oj.uz

답안 #496220

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
496220 2021-12-21T03:23:19 Z armashka Nautilus (BOI19_nautilus) C++17
29 / 100
 8 ms 844 KB 
#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;

void rec(ll x, ll y, ll pos = 0) {
	if (pos == k) {
		st.insert({x, y});
		return;
	}
	if (s[pos] == 'E' && y < m && c[x][y + 1] == '.') rec(x, y + 1, pos + 1);
	if (s[pos] == 'W' && y > 1 && c[x][y - 1] == '.') rec(x, y - 1, pos + 1);
	if (s[pos] == 'S' && x < n && c[x + 1][y] == '.') rec(x + 1, y, pos + 1);
	if (s[pos] == 'N' && 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);
		}
	}
	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.0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Correct 8 ms 844 KB Output is correct
2 Correct 2 ms 324 KB Output is correct
3 Correct 1 ms 336 KB Output is correct
4 Correct 1 ms 336 KB Output is correct
5 Correct 1 ms 328 KB Output is correct
6 Correct 0 ms 336 KB Output is correct

Subtask #2
0 / 37.0

# 결과 실행 시간 메모리 Grader output
1 Correct 8 ms 844 KB Output is correct
2 Correct 2 ms 324 KB Output is correct
3 Correct 1 ms 336 KB Output is correct
4 Correct 1 ms 336 KB Output is correct
5 Correct 1 ms 328 KB Output is correct
6 Correct 0 ms 336 KB Output is correct
7 Incorrect 1 ms 336 KB Output isn't correct
8 Halted 0 ms 0 KB -

Subtask #3
0 / 34.0

# 결과 실행 시간 메모리 Grader output
1 Correct 8 ms 844 KB Output is correct
2 Correct 2 ms 324 KB Output is correct
3 Correct 1 ms 336 KB Output is correct
4 Correct 1 ms 336 KB Output is correct
5 Correct 1 ms 328 KB Output is correct
6 Correct 0 ms 336 KB Output is correct
7 Incorrect 1 ms 336 KB Output isn't correct
8 Halted 0 ms 0 KB -