oj.uz

답안 #843143

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
843143 2023-09-03T17:55:27 Z Mizo_Compiler Tracks in the Snow (BOI13_tracks) C++14
97.8125 / 100
 731 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;
	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 13 ms 10076 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 11228 KB Output is correct
5 Correct 4 ms 5724 KB Output is correct
6 Correct 1 ms 4440 KB Output is correct
7 Correct 1 ms 4696 KB Output is correct
8 Correct 1 ms 6748 KB Output is correct
9 Correct 1 ms 6748 KB Output is correct
10 Correct 4 ms 5464 KB Output is correct
11 Correct 2 ms 7000 KB Output is correct
12 Correct 4 ms 7004 KB Output is correct
13 Correct 3 ms 5720 KB Output is correct
14 Correct 3 ms 5720 KB Output is correct
15 Correct 10 ms 9560 KB Output is correct
16 Correct 10 ms 10076 KB Output is correct
17 Correct 8 ms 9564 KB Output is correct
18 Correct 9 ms 11232 KB Output is correct

Subtask #2
67.8125 / 70.0

# 결과 실행 시간 메모리 Grader output
1 Correct 14 ms 46684 KB Output is correct
2 Correct 40 ms 19036 KB Output is correct
3 Correct 230 ms 48112 KB Output is correct
4 Correct 77 ms 24920 KB Output is correct
5 Correct 160 ms 38612 KB Output is correct
6 Correct 498 ms 103580 KB Output is correct
7 Correct 12 ms 47596 KB Output is correct
8 Correct 13 ms 46684 KB Output is correct
9 Correct 2 ms 4952 KB Output is correct
10 Correct 1 ms 4956 KB Output is correct
11 Correct 12 ms 47448 KB Output is correct
12 Correct 1 ms 6744 KB Output is correct
13 Correct 37 ms 19036 KB Output is correct
14 Correct 22 ms 13008 KB Output is correct
15 Correct 20 ms 15964 KB Output is correct
16 Correct 19 ms 7000 KB Output is correct
17 Correct 89 ms 28496 KB Output is correct
18 Correct 63 ms 26344 KB Output is correct
19 Correct 66 ms 24780 KB Output is correct
20 Correct 57 ms 25428 KB Output is correct
21 Correct 138 ms 41172 KB Output is correct
22 Correct 165 ms 38616 KB Output is correct
23 Correct 169 ms 32080 KB Output is correct
24 Correct 154 ms 41160 KB Output is correct
25 Correct 279 ms 48144 KB Output is correct
26 Runtime error 731 ms 1048576 KB Execution killed with signal 9
27 Correct 628 ms 359232 KB Output is correct
28 Correct 502 ms 102232 KB Output is correct
29 Correct 528 ms 111996 KB Output is correct
30 Correct 464 ms 109972 KB Output is correct
31 Correct 343 ms 42732 KB Output is correct
32 Correct 385 ms 65360 KB Output is correct