oj.uz

답안 #925664

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
925664 2024-02-12T07:09:22 Z vjudge1 Nautilus (BOI19_nautilus) C++17
100 / 100
 207 ms 1460 KB 
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
//#pragma GCC optimize("Ofast,unroll-loops,fast-math,O3")

#include<bits/stdc++.h>	

using namespace std;

#define all(a) a.begin(), a.end()                                                   
#define rall(a) a.rbegin(), a.rend()                 
#define sz(a) (int)a.size()
#define s second
#define f first
 
using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;

mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
     
vector<pii> rid = {{0, 1}, {0, -1}, {1, 0}, {-1, 0}};
vector<pii> dir = {{-1, -1}, {-1, 1}, {1, -1}, {1, 1}};
 
const int N = 3e5 + 1, mod = 998244353;

const ll inf = 1e9;
 
double eps = 1e-15;
                                                
bool flg = 0;

void slv() {
	int r, c, m;
	cin >> r >> c >> m;
	char a[r][c];
	bitset<N> s, h;
	for (int i = 0; i < r; i++) {
		for (int j = 0; j < c; j++) {
			cin >> a[i][j];
			if (a[i][j] == '.') {
				s[j + i * c] = 1;
				h[j + i * c] = 1;
			}
		}
	}
	string hs;
	cin >> hs;
	for (int i = 0; i < m; i++) {
		if (hs[i] == 'W') {
			for (int i = 0; i < r; i++) 
				s[i * c] = 0;
			s = h & (s >> 1);
		}else if (hs[i] == 'E') {
			for (int i = 1; i <= r; i++) 
				s[i * c - 1] = 0;
			s = h & (s << 1);
		}else if (hs[i] == 'N') {
			for (int i = 0; i < c; i++) 
				s[i] = 0;
			s = h & (s >> c);
		}else if (hs[i] == 'S') {
			for (int i = 0; i < c; i++) 
				s[(r - 1) * c + i] = 0;
			s = h & (s << c);
		}else {
			bitset<N> w = s, e = s, n = s, S = s;
			for (int i = 0; i < r; i++) 
				w[i * c] = 0;
			for (int i = 1; i <= r; i++) 
				e[i * c - 1] = 0;
			for (int i = 0; i < c; i++) 
				n[i] = 0;
			for (int i = 0; i < c; i++) 
				S[(r - 1) * c + i] = 0;
			s = h & ((w >> 1) | (e << 1) | (n >> c) | (S << c));
		}
	}
	int ans = 0;
	for (int i = 0; i < r * c; i++) {
		if (s[i]) {
			ans++;
		}
	}
	cout << ans;
}                                                                           
 
main() {
	//freopen("rsq.in", "r", stdin);                                                                                     
	//freopen("rsq.out", "w", stdout);                                                                                     
	ios_base::sync_with_stdio(0);	                                                                                       
	cin.tie(0);
	int tp = 1;
	if (flg) cin >> tp;
	while (tp--) {  	
		slv();
	}
}
//wenomechainsama

Compilation message

nautilus.cpp:86:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   86 | main() {
      | ^~~~

Subtask #1
29.0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 860 KB Output is correct
2 Correct 2 ms 860 KB Output is correct
3 Correct 2 ms 856 KB Output is correct
4 Correct 2 ms 860 KB Output is correct
5 Correct 2 ms 860 KB Output is correct
6 Correct 2 ms 856 KB Output is correct

Subtask #2
37.0 / 37.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 860 KB Output is correct
2 Correct 2 ms 860 KB Output is correct
3 Correct 2 ms 856 KB Output is correct
4 Correct 2 ms 860 KB Output is correct
5 Correct 2 ms 860 KB Output is correct
6 Correct 2 ms 856 KB Output is correct
7 Correct 3 ms 860 KB Output is correct
8 Correct 2 ms 860 KB Output is correct
9 Correct 3 ms 860 KB Output is correct
10 Correct 3 ms 860 KB Output is correct
11 Correct 3 ms 860 KB Output is correct
12 Correct 4 ms 856 KB Output is correct
13 Correct 4 ms 860 KB Output is correct
14 Correct 4 ms 860 KB Output is correct
15 Correct 4 ms 860 KB Output is correct
16 Correct 3 ms 860 KB Output is correct
17 Correct 4 ms 856 KB Output is correct
18 Correct 5 ms 860 KB Output is correct
19 Correct 4 ms 860 KB Output is correct
20 Correct 4 ms 860 KB Output is correct
21 Correct 6 ms 980 KB Output is correct

Subtask #3
34.0 / 34.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 860 KB Output is correct
2 Correct 2 ms 860 KB Output is correct
3 Correct 2 ms 856 KB Output is correct
4 Correct 2 ms 860 KB Output is correct
5 Correct 2 ms 860 KB Output is correct
6 Correct 2 ms 856 KB Output is correct
7 Correct 3 ms 860 KB Output is correct
8 Correct 2 ms 860 KB Output is correct
9 Correct 3 ms 860 KB Output is correct
10 Correct 3 ms 860 KB Output is correct
11 Correct 3 ms 860 KB Output is correct
12 Correct 4 ms 856 KB Output is correct
13 Correct 4 ms 860 KB Output is correct
14 Correct 4 ms 860 KB Output is correct
15 Correct 4 ms 860 KB Output is correct
16 Correct 3 ms 860 KB Output is correct
17 Correct 4 ms 856 KB Output is correct
18 Correct 5 ms 860 KB Output is correct
19 Correct 4 ms 860 KB Output is correct
20 Correct 4 ms 860 KB Output is correct
21 Correct 6 ms 980 KB Output is correct
22 Correct 92 ms 1212 KB Output is correct
23 Correct 94 ms 1368 KB Output is correct
24 Correct 92 ms 1372 KB Output is correct
25 Correct 90 ms 1368 KB Output is correct
26 Correct 89 ms 1452 KB Output is correct
27 Correct 144 ms 1372 KB Output is correct
28 Correct 151 ms 1448 KB Output is correct
29 Correct 146 ms 1460 KB Output is correct
30 Correct 146 ms 1372 KB Output is correct
31 Correct 147 ms 1372 KB Output is correct
32 Correct 201 ms 1372 KB Output is correct
33 Correct 193 ms 1456 KB Output is correct
34 Correct 202 ms 1456 KB Output is correct
35 Correct 198 ms 1452 KB Output is correct
36 Correct 207 ms 1372 KB Output is correct