oj.uz

답안 #1082695

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1082695 2024-09-01T07:50:43 Z Grothendieck_505 Tracks in the Snow (BOI13_tracks) C++14
100 / 100
 405 ms 118880 KB 
#include <bits/stdc++.h>
using namespace std;

int dx[4]{1, -1, 0, 0}, dy[4]{0, 0, 1, -1};

int n, m, depth[4000][4000], ans = 1;
string snow[4000];

bool inside(int x, int y) {
	return (x > -1 && x < n && y > -1 && y < m && snow[x][y] != '.');
}

int main() {
	iostream::sync_with_stdio(false);
	cin.tie(0);

	cin >> n >> m;
	for (int i = 0; i < n; i++) cin >> snow[i];

	deque<pair<int, int>> q;
	q.push_back({0, 0});
	depth[0][0] = 1;

	while (q.size()) {
		pair<int, int> c = q.front();
		q.pop_front();
		ans = max(ans, depth[c.first][c.second]);

		for (int i = 0; i < 4; i++) {
			int x = c.first + dx[i], y = c.second + dy[i];
			if (inside(x, y) && depth[x][y] == 0) {
				if (snow[x][y] == snow[c.first][c.second]) {
					depth[x][y] = depth[c.first][c.second];
					q.push_front({x, y});
				} else {
					depth[x][y] = depth[c.first][c.second] + 1;
					q.push_back({x, y});
				}
			}
		}
	}

	cout << ans;
	return 0;
}

Subtask #1
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 8 ms 3672 KB Output is correct
2 Correct 1 ms 604 KB Output is correct
3 Correct 0 ms 604 KB Output is correct
4 Correct 5 ms 3420 KB Output is correct
5 Correct 2 ms 1884 KB Output is correct
6 Correct 0 ms 600 KB Output is correct
7 Correct 1 ms 604 KB Output is correct
8 Correct 1 ms 604 KB Output is correct
9 Correct 1 ms 860 KB Output is correct
10 Correct 2 ms 1628 KB Output is correct
11 Correct 2 ms 1628 KB Output is correct
12 Correct 4 ms 2140 KB Output is correct
13 Correct 2 ms 1884 KB Output is correct
14 Correct 1 ms 1884 KB Output is correct
15 Correct 7 ms 3436 KB Output is correct
16 Correct 8 ms 3676 KB Output is correct
17 Correct 6 ms 3576 KB Output is correct
18 Correct 5 ms 3416 KB Output is correct

Subtask #2
70.0 / 70.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 15964 KB Output is correct
2 Correct 27 ms 10304 KB Output is correct
3 Correct 132 ms 59768 KB Output is correct
4 Correct 42 ms 25684 KB Output is correct
5 Correct 107 ms 42832 KB Output is correct
6 Correct 405 ms 94228 KB Output is correct
7 Correct 7 ms 16472 KB Output is correct
8 Correct 6 ms 15964 KB Output is correct
9 Correct 1 ms 860 KB Output is correct
10 Correct 1 ms 604 KB Output is correct
11 Correct 7 ms 16236 KB Output is correct
12 Correct 1 ms 1116 KB Output is correct
13 Correct 27 ms 10332 KB Output is correct
14 Correct 15 ms 7256 KB Output is correct
15 Correct 13 ms 9308 KB Output is correct
16 Correct 12 ms 4444 KB Output is correct
17 Correct 64 ms 21384 KB Output is correct
18 Correct 41 ms 28248 KB Output is correct
19 Correct 43 ms 25680 KB Output is correct
20 Correct 34 ms 19024 KB Output is correct
21 Correct 81 ms 41556 KB Output is correct
22 Correct 118 ms 42936 KB Output is correct
23 Correct 127 ms 34716 KB Output is correct
24 Correct 85 ms 38732 KB Output is correct
25 Correct 202 ms 80824 KB Output is correct
26 Correct 217 ms 118880 KB Output is correct
27 Correct 272 ms 107208 KB Output is correct
28 Correct 380 ms 94188 KB Output is correct
29 Correct 376 ms 92612 KB Output is correct
30 Correct 336 ms 96980 KB Output is correct
31 Correct 299 ms 62036 KB Output is correct
32 Correct 241 ms 92552 KB Output is correct