oj.uz

답안 #925663

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
925663 2024-02-12T07:08:40 Z vjudge1 Nautilus (BOI19_nautilus) C++17
29 / 100
 2 ms 860 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 856 KB Output is correct
2 Correct 2 ms 860 KB Output is correct
3 Correct 2 ms 860 KB Output is correct
4 Correct 2 ms 856 KB Output is correct
5 Correct 2 ms 856 KB Output is correct
6 Correct 2 ms 860 KB Output is correct

Subtask #2
0 / 37.0

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

Subtask #3
0 / 34.0

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