oj.uz

답안 #843172

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
843172 2023-09-03T18:37:19 Z Youssif_Elkadi Tracks in the Snow (BOI13_tracks) C++17
97.8125 / 100
 733 ms 1048576 KB 
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef double ld;
#define pb push_back
#define sz(x) int(x.size())
#define all(x) x.begin(),x.end()
#define F first
#define S second
const int N = 4000;
int n, m, ans = 1;
char c[N][N];
bool fc[N][N];
int dx[] = {1, -1, 0, 0};
int dy[] = {0, 0, 1, -1};
vector<pair<int, int>> f, r;
bool vis[N][N];
 
void dfs(int i, int j) {
	fc[i][j] = true;
  if(vis[i][j])return;
	vis[i][j] = true;
	for (int ii = 0; ii < 4; ii++) {
		int nx = i + dx[ii], ny = j + dy[ii];
		if (nx < 0 || ny < 0 || nx >= n || ny >= m)continue;
		if (c[nx][ny] == c[0][0]) {
			if (!fc[nx][ny])dfs(nx, ny);
		} else if (!vis[nx][ny]) {
			if (c[nx][ny] == 'F')f.pb({nx, ny});
			else if (c[nx][ny] == 'R')r.pb({nx, ny});
			vis[nx][ny] = true;
		}
	}
}
 
int main () {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	cin >> n >> m;
	for (int i = 0; i < n; i++) {
		for (int j = 0; j < m; j++) {
			cin >> c[i][j];
		}
	}
	dfs(0, 0);
	char cur = 'R';
	if (c[0][0] == cur)cur = 'F';
	while (!f.empty() || !r.empty()) {
		if (cur == 'R') {
			if (!r.empty())ans++;
			while (!r.empty()) {
				int x = r.back().F, y = r.back().S;
				r.pop_back();
				for (int i = 0; i < 4; i++) {
					int nx = x + dx[i], ny = y + dy[i];
					if (nx < 0 || ny < 0 || nx >= n || ny >= m)continue;
					if (vis[nx][ny])continue;
					vis[nx][ny] = true;
					if (c[nx][ny] == 'R')r.pb({nx, ny});
					else if (c[nx][ny] == 'F')f.pb({nx, ny});
				}
			}
		} else {
			if (!f.empty()) {
				ans++;
			}
			while (!f.empty()) {
				int x = f.back().F, y = f.back().S;
				f.pop_back();
				for (int i = 0; i < 4; i++) {
					int nx = x + dx[i], ny = y + dy[i];
					if (nx < 0 || ny < 0 || nx >= n || ny >= m)continue;
					if (vis[nx][ny])continue;
					vis[nx][ny] = true;
					if (c[nx][ny] == 'R')r.pb({nx, ny});
					else if (c[nx][ny] == 'F')f.pb({nx, ny});
				}
			}
		}
		if (cur == 'F')cur = 'R';
		else cur = 'F';
	}
	cout << ans;
}

Subtask #1
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 9 ms 9560 KB Output is correct
2 Correct 1 ms 4444 KB Output is correct
3 Correct 1 ms 4696 KB Output is correct
4 Correct 7 ms 10840 KB Output is correct
5 Correct 3 ms 5720 KB Output is correct
6 Correct 1 ms 4440 KB Output is correct
7 Correct 1 ms 4700 KB Output is correct
8 Correct 1 ms 4900 KB Output is correct
9 Correct 1 ms 4952 KB Output is correct
10 Correct 3 ms 5464 KB Output is correct
11 Correct 2 ms 5720 KB Output is correct
12 Correct 5 ms 5976 KB Output is correct
13 Correct 3 ms 5720 KB Output is correct
14 Correct 3 ms 5720 KB Output is correct
15 Correct 9 ms 9560 KB Output is correct
16 Correct 10 ms 9560 KB Output is correct
17 Correct 8 ms 9560 KB Output is correct
18 Correct 7 ms 10840 KB Output is correct

Subtask #2
67.8125 / 70.0

# 결과 실행 시간 메모리 Grader output
1 Correct 14 ms 46680 KB Output is correct
2 Correct 37 ms 17756 KB Output is correct
3 Correct 247 ms 48212 KB Output is correct
4 Correct 58 ms 24912 KB Output is correct
5 Correct 163 ms 37968 KB Output is correct
6 Correct 490 ms 101932 KB Output is correct
7 Correct 14 ms 47704 KB Output is correct
8 Correct 13 ms 46684 KB Output is correct
9 Correct 2 ms 4956 KB Output is correct
10 Correct 1 ms 4952 KB Output is correct
11 Correct 16 ms 47448 KB Output is correct
12 Correct 1 ms 4952 KB Output is correct
13 Correct 37 ms 17752 KB Output is correct
14 Correct 21 ms 12888 KB Output is correct
15 Correct 18 ms 15704 KB Output is correct
16 Correct 17 ms 7256 KB Output is correct
17 Correct 88 ms 27984 KB Output is correct
18 Correct 66 ms 25680 KB Output is correct
19 Correct 63 ms 24912 KB Output is correct
20 Correct 56 ms 23728 KB Output is correct
21 Correct 147 ms 40756 KB Output is correct
22 Correct 167 ms 37908 KB Output is correct
23 Correct 170 ms 32080 KB Output is correct
24 Correct 150 ms 40648 KB Output is correct
25 Correct 306 ms 48068 KB Output is correct
26 Runtime error 733 ms 1048576 KB Execution killed with signal 9
27 Correct 611 ms 357824 KB Output is correct
28 Correct 499 ms 103984 KB Output is correct
29 Correct 496 ms 112892 KB Output is correct
30 Correct 463 ms 109484 KB Output is correct
31 Correct 329 ms 42576 KB Output is correct
32 Correct 373 ms 65780 KB Output is correct