oj.uz

답안 #329602

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
329602 2020-11-21T19:10:32 Z wind_reaper Nautilus (BOI19_nautilus) C++17
66 / 100
 1000 ms 1388 KB 
// #define _GLIBCXX_DEBUG
// #pragma GCC optimize "trapv"
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <chrono>

// #pragma GCC optimize("Ofast,no-stack-protector,unroll-loops,fast-math")
// pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,tune=native")

using namespace std;
using namespace __gnu_pbds;
using namespace chrono;

#define pb push_back 
#define f first
#define s second
#define min3(a, b, c) min(min(a, b), c)
#define max3(a, b, c) max(max(a, b), c)
#define all(v) v.begin(), v.end()

typedef long long ll;
typedef double ld;
typedef long double lld;
typedef unsigned long long ull;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef vector<pii> vpi;
typedef vector<pll> vpl;

template <class T> using ordered_set = tree <T, null_type, less <T>, rb_tree_tag, tree_order_statistics_node_update>;

const int INF = 1e9;
// const ll INF = 1e18;
const ll mod = 1000000007;
// const ll mod = 998244353;

void solve(int tc){
	int r, c, m;
	cin >> r >> c >> m; 

	vector<string> mat(r);

	for(int i = 0; i < r; i++)
		cin >> mat[i];

	vector<vector<bool>> grid(r, vector<bool>(c));

	for(int i = 0; i < r; i++)
		for(int j = 0; j < c; j++)
			grid[i][j] = (mat[i][j] == '.' ? 1 : 0); 

	string s;
	cin >> s;
	bool dp[r][c][2];

	memset(dp, 0, sizeof(dp));
	for(int i = 0; i < r; i++)
		for(int j = 0; j < c; j++)
			dp[i][j][0] = grid[i][j];

	// for(int i = 0; i < r; i++){
	// 	for(int j = 0; j < c; j++)
	// 		cout << dp[i][j][0] << ' ';

	// 	cout << '\n';
	// }
	for(int i = 0; i < m; i++){
		if(s[i] == 'N'){
			for(int row = 1; row < r; row++)
				for(int col = 0; col < c; col++){
					dp[row-1][col][(i+1)%2] = (grid[row-1][col]&grid[row][col]&dp[row][col][i%2]); 
					dp[row][col][i%2] = 0; 
				}
		}
		if(s[i] == 'W'){
			for(int row = 0; row < r; row++)
				for(int col = 1; col < c; col++){
					dp[row][col-1][(i+1)%2] |= (grid[row][col-1]&grid[row][col]&dp[row][col][i%2]); 
					dp[row][col][i%2] = 0; 
				}
		}
		if(s[i] == 'E'){
			for(int row = 0; row < r; row++)
				for(int col = 0; col < c - 1; col++){
					dp[row][col+1][(i+1)%2] |= (grid[row][col+1]&grid[row][col]&dp[row][col][i%2]); 
					dp[row][col][i%2] = 0; 
				}
		}
		if(s[i] == 'S'){
			for(int row = 0; row < r-1; row++)
				for(int col = 0; col < c; col++){
					dp[row + 1][col][(i+1)%2] |= (grid[row+1][col]&grid[row][col]&dp[row][col][i%2]); 
					dp[row][col][i%2] = 0; 
				}
		}
		if(s[i] == '?'){
			for(int row = 1; row < r; row++)
				for(int col = 0; col < c; col++)
					dp[row-1][col][(i+1)%2] |= (grid[row-1][col]&grid[row][col]&dp[row][col][i%2]); 

			for(int row = 0; row < r; row++)
				for(int col = 1; col < c; col++)
					dp[row][col-1][(i+1)%2] |= (grid[row][col-1]&grid[row][col]&dp[row][col][i%2]); 

			for(int row = 0; row < r; row++)
				for(int col = 0; col < c - 1; col++)
					dp[row][col+1][(i+1)%2] |= (grid[row][col+1]&grid[row][col]&dp[row][col][i%2]); 

			for(int row = 0; row < r-1; row++)
				for(int col = 0; col < c; col++)
					dp[row+1][col][(i+1)%2] |= (grid[row+1][col]&grid[row][col]&dp[row][col][i%2]); 

			// for(int row = 0; row < r-1; row++)
			// 	for(int col = 0; col < c; col++)
			// 		dp[row][col][i%2] = 0; 
		}
		for(int row = 0; row < r; row++)
			for(int col = 0; col < c; col++)
				dp[row][col][i%2] = 0; 
	}	

	int ans = 0; 

	for(int i = 0; i < r; i++)
		for(int j = 0; j < c; j++)
			ans += dp[i][j][m%2];

	cout << ans << '\n'; 
}

int main(){
	ios_base::sync_with_stdio(NULL);
	cin.tie(NULL);
	#ifdef LOCAL
		auto begin = high_resolution_clock::now();
	#endif

    int tc = 1;
    // cin >> tc; 
    for (int t = 0; t < tc; t++) solve(t);
    
    #ifdef LOCAL 
    	auto end = high_resolution_clock::now();
    	cout << fixed << setprecision(4) << "Execution Time: " << duration_cast<duration<double>>(end - begin).count() << "seconds" << endl;
    #endif
	return 0;
}

Subtask #1
29.0 / 29.0

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

Subtask #2
37.0 / 37.0

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

Subtask #3
0 / 34.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 364 KB Output is correct
2 Correct 3 ms 364 KB Output is correct
3 Correct 3 ms 364 KB Output is correct
4 Correct 4 ms 364 KB Output is correct
5 Correct 4 ms 364 KB Output is correct
6 Correct 4 ms 364 KB Output is correct
7 Correct 5 ms 364 KB Output is correct
8 Correct 5 ms 364 KB Output is correct
9 Correct 5 ms 364 KB Output is correct
10 Correct 5 ms 364 KB Output is correct
11 Correct 5 ms 364 KB Output is correct
12 Correct 7 ms 364 KB Output is correct
13 Correct 7 ms 364 KB Output is correct
14 Correct 7 ms 364 KB Output is correct
15 Correct 7 ms 364 KB Output is correct
16 Correct 7 ms 364 KB Output is correct
17 Correct 8 ms 364 KB Output is correct
18 Correct 8 ms 364 KB Output is correct
19 Correct 8 ms 364 KB Output is correct
20 Correct 9 ms 492 KB Output is correct
21 Correct 8 ms 364 KB Output is correct
22 Execution timed out 1082 ms 1388 KB Time limit exceeded
23 Halted 0 ms 0 KB -