답안 #807395

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
807395	2023-08-04T16:47:50 Z	MODDI	Nautilus (BOI19_nautilus)	C++14	66 / 100	1000 ms	3284 KB

nautilus

#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
using namespace std;
#define pb push_back
#define mp make_pair
typedef long long ll;
typedef pair<long long, long long> pll;
typedef pair<int,int> pii;
typedef vector<long long> vl;
typedef vector<int> vi;
int r, c, n;
string str;
int mat[501][501];
int dp[2][501][501];
int main(){
	ios_base::sync_with_stdio(false);
	cin.tie(nullptr);
	cin>>r>>c>>n;
	memset(dp, 0, sizeof dp);
	memset(mat, 0, sizeof mat);
	for(int i = 0; i < r; i++){
		string s;
		cin>>s;
		for(int j = 0; j < c; j++){
			if(s[j] == '.'){
				mat[i][j] = 1;
				dp[0][i][j] = 1;
			}
		}
	}
	cin>>str;
	for(int step = 1; step <= n; step++){
		for(int i = 0; i < r; i++){
			for(int j = 0; j < c; j++){
				dp[step%2][i][j] = 0;
			}
		}
		for(int i = 0; i < r; i++){
			for(int j = 0; j < c; j++){
				if((str[step-1] == 'E' || str[step-1] == '?') && mat[i][j] == 1 && dp[(step-1)%2][i][j-1] == 1 && j > 0)	
					dp[step%2][i][j] = 1;
				if((str[step-1] == 'W' || str[step-1] == '?') && mat[i][j] == 1 && dp[(step-1)%2][i][j+1] == 1 && j + 1 < c)
					dp[step%2][i][j] = 1;
				if((str[step-1] == 'N' || str[step-1] == '?') && i < r-1 && mat[i][j] == 1 && dp[(step-1)%2][i+1][j] == 1)
					dp[step%2][i][j] = 1;
				if((str[step-1]=='S' || str[step-1] == '?') && i > 0 && mat[i][j] == 1 && dp[(step-1)%2][i-1][j]==1)
					dp[step%2][i][j] = 1;
			}
		}
	}
	ll ans = 0;
	for(int i = 0; i < r; i++){
		for(int j = 0; j < c;j ++){
			ans += dp[n%2][i][j];
		}
	}
	cout<<ans<<"\n";
	return 0;
}

Subtask #1

29.0 / 29.0

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

Subtask #2

37.0 / 37.0

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

Subtask #3

0 / 34.0

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