제출 #125445

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
125445		mechfrog88	Nautilus (BOI19_nautilus)	C++14	66 / 100	316 ms	262144 KiB

nautilus

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#pragma GCC optimize("unroll-loops,no-stack-protector")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
 
using namespace __gnu_pbds;
using namespace std;
 
template <typename T>
using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
 
typedef long long ll;
typedef long double ld;
 
int main(){
	ios_base::sync_with_stdio(false);
	cin.tie(NULL);
	ll r,c,m;
	cin >> r >> c >> m;
	vector <string> grid(r);
	for (int z=0;z<r;z++){
		cin >> grid[z];
	}
	string signal;
	cin >> signal;
	bool dp[m+1][r][c];
	for (int i=0;i<=m;i++){
		for (int j=0;j<r;j++){
			for (int k=0;k<c;k++){
				dp[i][j][k] = false;
			}
		}
	}
	for (int j=0;j<r;j++){
		for (int k=0;k<c;k++){
			if (grid[j][k] == '#') continue;
			dp[0][j][k] = true;
		}
	}
	for (int i=1;i<=m;i++){
		char now = signal[i-1];
		for (int j=0;j<r;j++){
			for (int k=0;k<c;k++){
				if (grid[j][k] == '#') continue; 
				if ((now == 'W' || now == '?') && k < c-1)	dp[i][j][k] = dp[i][j][k] || dp[i-1][j][k+1]; 
				if ((now == 'E' || now == '?')  && k > 0)	dp[i][j][k] = dp[i][j][k] || dp[i-1][j][k-1];
				if ((now == 'S' || now == '?')  && j > 0)	dp[i][j][k] = dp[i][j][k] || dp[i-1][j-1][k];
				if ((now == 'N' || now == '?')  && j < r-1)	dp[i][j][k] = dp[i][j][k] || dp[i-1][j+1][k];
			}
		}
	}
	ll ans = 0;
	for (int z=0;z<r;z++){
		for (int x=0;x<c;x++){
			if (dp[m][z][x]) ans++;
		}
	}
	cout << ans << endl;
}

• Subtask 1: 29 / 29
• Subtask 2: 37 / 37
• Subtask 3: 0 / 34