oj.uz

답안 #752218

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
752218 2023-06-02T14:02:02 Z penguin133 Nautilus (BOI19_nautilus) C++17
66 / 100
 1000 ms 4944 KB 
#include <bits/stdc++.h>
using namespace std;

#define int long long
#define pi pair<int, int>
#define pii pair<int, pi>
#define fi first
#define se second
#ifdef _WIN32
#define getchar_unlocked _getchar_nolock
#endif
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());

int r, c, m;
bool ok[501][501];
char G[501][501];
string s;
int dx[] = {-1, 0, 1, 0}, dy[] = {0, 1, 0, -1};

void solve(){
	cin >> r >> c >> m;
	for(int i=1;i<=r;i++)for(int j=1;j<=c;j++)cin >> G[i][j];
	queue <pi> q;
	for(int i=1;i<=r;i++)for(int j=1;j<=c;j++){
		if(G[i][j] == '.'){
			q.push({i, j});
		}
	}
	cin >> s;
	for(int a = 0; a < m; a++){
		while(!q.empty()){
			int x = q.front().fi, y = q.front().se;
			q.pop();
			if(s[a] != '?'){
				if(s[a] == 'W'){
					if(y > 1 && G[x][y-1] != '#')ok[x][y - 1] = 1;
				}
				if(s[a] == 'E'){
					if(y < c && G[x][y+1] != '#')ok[x][y + 1] = 1;
				}
				if(s[a] == 'S'){
					if(x < r && G[x+1][y] != '#')ok[x + 1][y] = 1;
				}
				if(s[a] == 'N'){
					if(x > 1 && G[x-1][y] != '#')ok[x-1][y] = 1;
				}
				continue;
			}
			for(int i = 0; i < 4; i++){
				int x1 = x + dx[i], y1 = y + dy[i];
				if(x1 < 1 || x1 > r || y1 < 1 || y1 > c || G[x1][y1] == '#')continue;
				ok[x1][y1] = 1;
			}
		}
		for(int i = 1; i <= r; i++)for(int j = 1; j <= c; j++){
			if(ok[i][j])q.push({i, j});
			if(a != m - 1)ok[i][j] = 0;
		}
	}
	
	int ans = 0;
	for(int i=1;i<=r;i++)for(int j=1;j<=c;j++)ans += ok[i][j];
	cout << ans;
}

main(){
	ios::sync_with_stdio(0);cin.tie(0);
	int tc = 1;
	//cin >> tc;
	for(int tc1=1;tc1<=tc;tc1++){
		// cout << "Case #" << tc1 << ": ";
		solve();
	}
}

Compilation message

nautilus.cpp:66:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   66 | main(){
      | ^~~~

Subtask #1
29.0 / 29.0

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

Subtask #2
37.0 / 37.0

# 결과 실행 시간 메모리 Grader output
1 Correct 14 ms 596 KB Output is correct
2 Correct 3 ms 468 KB Output is correct
3 Correct 2 ms 468 KB Output is correct
4 Correct 2 ms 468 KB Output is correct
5 Correct 2 ms 340 KB Output is correct
6 Correct 2 ms 340 KB Output is correct
7 Correct 20 ms 724 KB Output is correct
8 Correct 7 ms 468 KB Output is correct
9 Correct 3 ms 468 KB Output is correct
10 Correct 2 ms 468 KB Output is correct
11 Correct 2 ms 340 KB Output is correct
12 Correct 27 ms 468 KB Output is correct
13 Correct 25 ms 564 KB Output is correct
14 Correct 20 ms 468 KB Output is correct
15 Correct 2 ms 340 KB Output is correct
16 Correct 2 ms 340 KB Output is correct
17 Correct 29 ms 596 KB Output is correct
18 Correct 28 ms 468 KB Output is correct
19 Correct 17 ms 468 KB Output is correct
20 Correct 6 ms 464 KB Output is correct
21 Correct 2 ms 340 KB Output is correct

Subtask #3
0 / 34.0

# 결과 실행 시간 메모리 Grader output
1 Correct 14 ms 596 KB Output is correct
2 Correct 3 ms 468 KB Output is correct
3 Correct 2 ms 468 KB Output is correct
4 Correct 2 ms 468 KB Output is correct
5 Correct 2 ms 340 KB Output is correct
6 Correct 2 ms 340 KB Output is correct
7 Correct 20 ms 724 KB Output is correct
8 Correct 7 ms 468 KB Output is correct
9 Correct 3 ms 468 KB Output is correct
10 Correct 2 ms 468 KB Output is correct
11 Correct 2 ms 340 KB Output is correct
12 Correct 27 ms 468 KB Output is correct
13 Correct 25 ms 564 KB Output is correct
14 Correct 20 ms 468 KB Output is correct
15 Correct 2 ms 340 KB Output is correct
16 Correct 2 ms 340 KB Output is correct
17 Correct 29 ms 596 KB Output is correct
18 Correct 28 ms 468 KB Output is correct
19 Correct 17 ms 468 KB Output is correct
20 Correct 6 ms 464 KB Output is correct
21 Correct 2 ms 340 KB Output is correct
22 Execution timed out 1067 ms 4944 KB Time limit exceeded
23 Halted 0 ms 0 KB -