oj.uz

Submission #343892

# Submission time Handle Problem Language Result Execution time Memory
343892 2021-01-04T17:17:43 Z kapsel Tracks in the Snow (BOI13_tracks) C++17
100 / 100
 707 ms 130812 KB 
#include <bits/stdc++.h>

using namespace std;

/*
 * BFS 0/1
 * Dla krawedzi o wagach 0 lub 1.
 * Zadanie: BOI 2013 Tracks in the Snow: https://oj.uz/problem/view/BOI13_tracks
 */

#define LL long long
#define ULL unsigned LL
#define LD long double

const int N = 4e3 + 4;
int dx[4]{1, -1, 0, 0}, dy[4]{0, 0, 1, -1};
int n, m, depth[N][N];
string snow[N];

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

int main() {
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	cout.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;
	int ans = 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;
}

Subtask #1
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 14 ms 3948 KB Output is correct
2 Correct 1 ms 492 KB Output is correct
3 Correct 1 ms 620 KB Output is correct
4 Correct 9 ms 3564 KB Output is correct
5 Correct 3 ms 2028 KB Output is correct
6 Correct 1 ms 492 KB Output is correct
7 Correct 1 ms 620 KB Output is correct
8 Correct 1 ms 748 KB Output is correct
9 Correct 1 ms 876 KB Output is correct
10 Correct 3 ms 1792 KB Output is correct
11 Correct 3 ms 1516 KB Output is correct
12 Correct 6 ms 2156 KB Output is correct
13 Correct 3 ms 2028 KB Output is correct
14 Correct 3 ms 2028 KB Output is correct
15 Correct 12 ms 3692 KB Output is correct
16 Correct 15 ms 3868 KB Output is correct
17 Correct 9 ms 3692 KB Output is correct
18 Correct 12 ms 3564 KB Output is correct

Subtask #2
70.0 / 70.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 15980 KB Output is correct
2 Correct 45 ms 11884 KB Output is correct
3 Correct 239 ms 75756 KB Output is correct
4 Correct 77 ms 29420 KB Output is correct
5 Correct 191 ms 51564 KB Output is correct
6 Correct 704 ms 110092 KB Output is correct
7 Correct 13 ms 16748 KB Output is correct
8 Correct 13 ms 16000 KB Output is correct
9 Correct 2 ms 876 KB Output is correct
10 Correct 1 ms 620 KB Output is correct
11 Correct 13 ms 16364 KB Output is correct
12 Correct 2 ms 1260 KB Output is correct
13 Correct 49 ms 11884 KB Output is correct
14 Correct 26 ms 8044 KB Output is correct
15 Correct 24 ms 10476 KB Output is correct
16 Correct 22 ms 4972 KB Output is correct
17 Correct 121 ms 25324 KB Output is correct
18 Correct 96 ms 32492 KB Output is correct
19 Correct 76 ms 29420 KB Output is correct
20 Correct 57 ms 22508 KB Output is correct
21 Correct 142 ms 50744 KB Output is correct
22 Correct 194 ms 51564 KB Output is correct
23 Correct 229 ms 42476 KB Output is correct
24 Correct 142 ms 47596 KB Output is correct
25 Correct 480 ms 96492 KB Output is correct
26 Correct 427 ms 130812 KB Output is correct
27 Correct 576 ms 121508 KB Output is correct
28 Correct 707 ms 108932 KB Output is correct
29 Correct 700 ms 107292 KB Output is correct
30 Correct 636 ms 111472 KB Output is correct
31 Correct 616 ms 72300 KB Output is correct
32 Correct 492 ms 107048 KB Output is correct