oj.uz

답안 #507378

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
507378 2022-01-12T11:28:18 Z MurotY Nautilus (BOI19_nautilus) C++14
29 / 100
 1000 ms 716 KB 
#include<bits/stdc++.h>
#define ios ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define ll long long 
#define ff first
#define ss second
using namespace std;
const int N=5555;
char a[N][N];
bool u[N][N];
int n, m, q;
ll ans=0;
string s;
void rec(ll x, ll y, ll pos){
	if (x >= n || x < 0 || y >= m || y < 0 || a[x][y] == '#') return ;
//	cout << x <<" " << y <<" " << pos <<" " << q <<"\n"; 
	if (pos >= q) {
		ans++; return ;
	}
	if (s[pos] == 'N' || s[pos] == '?') rec(x-1, y, pos+1);
	if (s[pos] == 'E' || s[pos] == '?') rec(x, y+1, pos+1);
	if (s[pos] == 'W' || s[pos] == '?') rec(x, y-1, pos+1);
	if (s[pos] == 'S' || s[pos] == '?') rec(x+1, y, pos+1);
	return ;
}
int main()
{
	cin >> n >> m >> q;
	for (int i=0;i<n;i++) {
		for (int j=0;j<m;j++) cin >> a[i][j];
	}
	cin >> s;
	for (int i=0;i<n;i++){
		for (int j=0;j<m;j++){
			if (a[i][j] != '#'){
		          rec(i, j, 0);
			}
		}
	}
	cout << ans;
}

Subtask #1
29.0 / 29.0

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

Subtask #2
0 / 37.0

# 결과 실행 시간 메모리 Grader output
1 Correct 9 ms 716 KB Output is correct
2 Correct 2 ms 716 KB Output is correct
3 Correct 1 ms 716 KB Output is correct
4 Correct 1 ms 716 KB Output is correct
5 Correct 1 ms 716 KB Output is correct
6 Correct 1 ms 716 KB Output is correct
7 Execution timed out 1091 ms 716 KB Time limit exceeded
8 Halted 0 ms 0 KB -

Subtask #3
0 / 34.0

# 결과 실행 시간 메모리 Grader output
1 Correct 9 ms 716 KB Output is correct
2 Correct 2 ms 716 KB Output is correct
3 Correct 1 ms 716 KB Output is correct
4 Correct 1 ms 716 KB Output is correct
5 Correct 1 ms 716 KB Output is correct
6 Correct 1 ms 716 KB Output is correct
7 Execution timed out 1091 ms 716 KB Time limit exceeded
8 Halted 0 ms 0 KB -