#include <bits/stdc++.h>
#include <fstream>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
template<class T> using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
struct custom_hash {static uint64_t splitmix64(uint64_t x) {x += 0x9e3779b97f4a7c15;x = (x ^ (x >> 30)) * 0xbf58476d1ce4e5b9;x = (x ^ (x >> 27)) * 0x94d049bb133111eb;return x ^ (x >> 31);}size_t operator()(uint64_t x) const {static const uint64_t FIXED_RANDOM = chrono::steady_clock::now().time_since_epoch().count();return splitmix64(x + FIXED_RANDOM);}};
// string __fname = ""; ifstream in (__fname + ".in"); ofstream out (__fname + ".out");
// #define cin in
// #define cout out
#define int64 long long
#define uint64 unsigned long long
#define x first
#define y second
#define pb push_back
#define pii pair <int, int>
#define pii64 pair <int64, int64>
#define db(x) cout << "> " << #x << ": " << (x) << "\n"
#define qr queries()
#define yn(x) if (x) {ctn("Yes");}else {ctn("No");}
void solve(int);
void queries(){int n;cin >> n;for (int i = 1; i <= n; i++) solve(i);}
template<class T>T ceildiv(T a, T b) {return a / b + !!(a % b);}
template<class T>T gcd (T a, T b){return (b ? gcd(b, a % b): a);}
template<class T>T lcm (T a, T b){return a * b / gcd(a, b);}
// // // // // // // // // // // // // // // // // // // // // //
/* TEMPLATE - VANILLA */
// // // // // // // // // // // // // // // // // // // // // //
const int ddx[] = {-1, -1, 0, 1, 1, 1, 0, -1};
const int ddy[] = {0, 1, 1, 1, 0, -1, -1, -1};
const int dx[] = {-1, 0, 1, 0};
const int dy[] = {0, 1, 0, -1};
const double pi = 3.14159265359;
const double eps = 1e-6;
const int64 hash_inv = 940594066;
const int64 hash_p = 101;
const int64 mod = 1e9 + 7;
const int maxn = 501;
bitset <maxn> c[maxn];
bitset <maxn> dp[2][maxn];
string dir;
int n,m,k;
void solve(int id){
return;
}
int main(){
ios_base::sync_with_stdio(0); cin.tie(0); cout << fixed; cout << setprecision(10);
cin >> n >> m >> k;
for (int i = 0; i < n; i++){
string s;
cin >> s;
for (int j = 0; j < m; j++) {
if (s[j] == '.') {
c[i][j] = 1;
dp[0][i][j] = 1;
}
}
}
cin >> dir;
for (int i = 1; i <= k; i++){
for (int j = 0; j < n; j++) dp[i % 2][j] = 0;
for (int j = 0; j < n; j++) {
if (dir[i - 1] == 'E' || dir[i - 1] == '?') dp[i % 2][j] |= (dp[(i - 1) % 2][j] << 1 & c[j]);
if (dir[i - 1] == 'W' || dir[i - 1] == '?') dp[i % 2][j] |= (dp[(i - 1) % 2][j] >> 1 & c[j]);
if ((dir[i - 1] == 'S' || dir[i - 1] == '?') && j > 0) dp[i % 2][j] |= (dp[(i - 1) % 2][j - 1] & c[j]);
if ((dir[i - 1] == 'N' || dir[i - 1] == '?') && j < n - 1) dp[i % 2][j] |= (dp[(i - 1) % 2][j + 1] & c[j]);
}
}
int rs = 0;
for (int i = 0; i < n; i++) rs += dp[k % 2][i].count();
cout << rs;
return 0;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
224 KB |
Output is correct |
2 |
Correct |
1 ms |
340 KB |
Output is correct |
3 |
Correct |
1 ms |
340 KB |
Output is correct |
4 |
Correct |
1 ms |
340 KB |
Output is correct |
5 |
Correct |
1 ms |
340 KB |
Output is correct |
6 |
Correct |
1 ms |
340 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
224 KB |
Output is correct |
2 |
Correct |
1 ms |
340 KB |
Output is correct |
3 |
Correct |
1 ms |
340 KB |
Output is correct |
4 |
Correct |
1 ms |
340 KB |
Output is correct |
5 |
Correct |
1 ms |
340 KB |
Output is correct |
6 |
Correct |
1 ms |
340 KB |
Output is correct |
7 |
Correct |
1 ms |
340 KB |
Output is correct |
8 |
Correct |
1 ms |
340 KB |
Output is correct |
9 |
Correct |
1 ms |
340 KB |
Output is correct |
10 |
Correct |
1 ms |
340 KB |
Output is correct |
11 |
Correct |
1 ms |
340 KB |
Output is correct |
12 |
Correct |
1 ms |
340 KB |
Output is correct |
13 |
Correct |
1 ms |
340 KB |
Output is correct |
14 |
Correct |
1 ms |
340 KB |
Output is correct |
15 |
Correct |
1 ms |
340 KB |
Output is correct |
16 |
Correct |
1 ms |
340 KB |
Output is correct |
17 |
Correct |
1 ms |
340 KB |
Output is correct |
18 |
Correct |
2 ms |
340 KB |
Output is correct |
19 |
Correct |
1 ms |
340 KB |
Output is correct |
20 |
Correct |
1 ms |
340 KB |
Output is correct |
21 |
Correct |
1 ms |
340 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
224 KB |
Output is correct |
2 |
Correct |
1 ms |
340 KB |
Output is correct |
3 |
Correct |
1 ms |
340 KB |
Output is correct |
4 |
Correct |
1 ms |
340 KB |
Output is correct |
5 |
Correct |
1 ms |
340 KB |
Output is correct |
6 |
Correct |
1 ms |
340 KB |
Output is correct |
7 |
Correct |
1 ms |
340 KB |
Output is correct |
8 |
Correct |
1 ms |
340 KB |
Output is correct |
9 |
Correct |
1 ms |
340 KB |
Output is correct |
10 |
Correct |
1 ms |
340 KB |
Output is correct |
11 |
Correct |
1 ms |
340 KB |
Output is correct |
12 |
Correct |
1 ms |
340 KB |
Output is correct |
13 |
Correct |
1 ms |
340 KB |
Output is correct |
14 |
Correct |
1 ms |
340 KB |
Output is correct |
15 |
Correct |
1 ms |
340 KB |
Output is correct |
16 |
Correct |
1 ms |
340 KB |
Output is correct |
17 |
Correct |
1 ms |
340 KB |
Output is correct |
18 |
Correct |
2 ms |
340 KB |
Output is correct |
19 |
Correct |
1 ms |
340 KB |
Output is correct |
20 |
Correct |
1 ms |
340 KB |
Output is correct |
21 |
Correct |
1 ms |
340 KB |
Output is correct |
22 |
Correct |
144 ms |
420 KB |
Output is correct |
23 |
Correct |
120 ms |
676 KB |
Output is correct |
24 |
Correct |
126 ms |
684 KB |
Output is correct |
25 |
Correct |
144 ms |
672 KB |
Output is correct |
26 |
Correct |
127 ms |
656 KB |
Output is correct |
27 |
Correct |
154 ms |
684 KB |
Output is correct |
28 |
Correct |
151 ms |
600 KB |
Output is correct |
29 |
Correct |
189 ms |
668 KB |
Output is correct |
30 |
Correct |
158 ms |
672 KB |
Output is correct |
31 |
Correct |
154 ms |
656 KB |
Output is correct |
32 |
Correct |
215 ms |
676 KB |
Output is correct |
33 |
Correct |
188 ms |
672 KB |
Output is correct |
34 |
Correct |
189 ms |
672 KB |
Output is correct |
35 |
Correct |
189 ms |
672 KB |
Output is correct |
36 |
Correct |
181 ms |
656 KB |
Output is correct |