답안 #925948

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
925948 2024-02-12T11:29:34 Z vjudge1 Nautilus (BOI19_nautilus) C++17
100 / 100
33 ms 856 KB
#pragma GCC optimize("O3", "unroll-loops", "Ofast") // "Ofast" 	
#pragma GCC target("avx2", "bmi", "bmi2", "lzcnt", "popcnt") 

#include <bits/stdc++.h>

//#define int long long
#define vt vector
#define pb push_back
#define all(x) (x).begin(), (x).end()
#define sz(x) (int)(x).size()
#define f first
#define s second
#define dbg(x) cerr << #x << " = " << x << '\n'
#define bit(x, i) ((x) >> (i) & 1)

using namespace std;
using ll = long long;
using ld = long double;
using pii = pair<int, int>;

const int N = 500 + 5, mod = 1e9 + 7;
const ll inf = 1e18 + 7;
const ld eps = 1e-6;

ll add (ll a, ll b) {
	a += b;
	if (a < 0) a += mod;
	if (a >= mod) a -= mod;
	return a;
}

ll mul (ll a, ll b) {
	a *= b;
	if (a >= mod) a %= mod;
	return a;
}

int n, m, M;
string s;

bitset<N> dp[N], dp2[N], b[N];

void solve () {
	cin >> n >> m >> M;
	char a[n + 1][m + 1];
	for (int i = 1; i <= n; i++) {
		for (int j = 1; j <= m; j++) cin >> a[i][j], dp[i][j] = b[i][j] = (a[i][j] == '.');
	}           
	cin >> s;
	s = ' ' + s;
	for (int k = 1; k <= M; k++) { 
		for (int i = 1; i <= n; i++) {
			if (s[k] == 'N') dp2[i] = dp[i + 1];
			if (s[k] == 'S') dp2[i] = dp[i - 1];
			if (s[k] == 'E') dp2[i] = dp[i] << 1;
			if (s[k] == 'W') dp2[i] = dp[i] >> 1;
			if (s[k] == '?') dp2[i] = (dp[i + 1] | dp[i - 1] | (dp[i] << 1) | (dp[i] >> 1));
    	}
    	for (int i = 1; i <= n; i++) dp[i] = (dp2[i] & b[i]);
    }
    int ans = 0;
    for (int i = 1; i <= n; i++) ans += dp[i].count();
    cout << ans;
	cout << '\n';
}

bool testcases = 0;

signed main() {
#ifdef AMIR
	freopen(".in", "r", stdin);
	freopen(".out", "w", stdout);
#endif
	cin.tie(0) -> sync_with_stdio(0);
	int test = 1;
	if (testcases) cin >> test;
	for (int cs = 1; cs <= test; cs++) {
		solve();
	}
}
# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 ms 344 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 ms 344 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 1 ms 344 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 1 ms 344 KB Output is correct
15 Correct 1 ms 344 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 1 ms 600 KB Output is correct
18 Correct 1 ms 348 KB Output is correct
19 Correct 1 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 1 ms 348 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 ms 344 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 1 ms 344 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 1 ms 344 KB Output is correct
15 Correct 1 ms 344 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 1 ms 600 KB Output is correct
18 Correct 1 ms 348 KB Output is correct
19 Correct 1 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 1 ms 348 KB Output is correct
22 Correct 19 ms 604 KB Output is correct
23 Correct 21 ms 604 KB Output is correct
24 Correct 21 ms 604 KB Output is correct
25 Correct 20 ms 604 KB Output is correct
26 Correct 19 ms 604 KB Output is correct
27 Correct 25 ms 600 KB Output is correct
28 Correct 29 ms 856 KB Output is correct
29 Correct 32 ms 604 KB Output is correct
30 Correct 31 ms 604 KB Output is correct
31 Correct 25 ms 600 KB Output is correct
32 Correct 29 ms 600 KB Output is correct
33 Correct 30 ms 604 KB Output is correct
34 Correct 31 ms 604 KB Output is correct
35 Correct 29 ms 600 KB Output is correct
36 Correct 33 ms 808 KB Output is correct