oj.uz

Submission #1062364

# Submission time Handle Problem Language Result Execution time Memory
1062364 2024-08-17T04:08:24 Z danielzhu Tracks in the Snow (BOI13_tracks) C++17
100 / 100
 566 ms 26092 KB 
#include <bits/stdc++.h>
using namespace std;
int H, W;
char grid[4001][4001];
vector<pair<int,int>> dir = {{0, 1}, {1, 0}, {0, -1}, {-1, 0}};

void bfs(queue<pair<int,int>> &from, queue<pair<int,int>> &to, char cc){
	while(!from.empty()){
			auto temp = from.front();
			from.pop();
			//grid[temp.first][temp.second] = '.';
			int x = temp.first, y = temp.second;
			for(auto [dx, dy] : dir){
				if(x+dx > -1 && x+dx < H && y+dy > -1 && y+dy < W && grid[x+dx][y+dy] != '.'){
					if(grid[x+dx][y+dy] != cc) to.push({x+dx, y+dy});
					else from.push({x+dx, y+dy});
					grid[x+dx][y+dy] = '.';
				}
			}
	}
}

int main(){
	cin>>H>>W;
	for(int i = 0; i < H; i++){
		string s; cin>>s;
		for(int j = 0; j < W; j++){
			grid[i][j] = s[j];
		}
	}
	int x = 0, y = 0, ans = 0;
	char cc = grid[0][0];
	queue<pair<int,int>> F, R;
	if(cc == 'F') F.push({0,0});
	else R.push({0,0});
	grid[0][0] = '.';
	while(true){
		if(cc == 'F' && F.empty()) break;
		if(cc == 'R' && R.empty()) break;
		if(cc == 'F')
			bfs(F, R, cc);
		else if(cc == 'R')
			bfs(R, F, cc);
		ans++;
		if(cc == 'F') cc = 'R';
		else if(cc == 'R') cc = 'F';
	}
	cout<<ans<<endl;
	return 0;
}

Compilation message

tracks.cpp: In function 'int main()':
tracks.cpp:31:6: warning: unused variable 'x' [-Wunused-variable]
   31 |  int x = 0, y = 0, ans = 0;
      |      ^
tracks.cpp:31:13: warning: unused variable 'y' [-Wunused-variable]
   31 |  int x = 0, y = 0, ans = 0;
      |             ^

Subtask #1
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 2652 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 2652 KB Output is correct
4 Correct 6 ms 2652 KB Output is correct
5 Correct 2 ms 2652 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 1 ms 2652 KB Output is correct
8 Correct 1 ms 2652 KB Output is correct
9 Correct 1 ms 2652 KB Output is correct
10 Correct 2 ms 2648 KB Output is correct
11 Correct 2 ms 2652 KB Output is correct
12 Correct 4 ms 2648 KB Output is correct
13 Correct 2 ms 2652 KB Output is correct
14 Correct 2 ms 2660 KB Output is correct
15 Correct 10 ms 2696 KB Output is correct
16 Correct 10 ms 2664 KB Output is correct
17 Correct 9 ms 2652 KB Output is correct
18 Correct 6 ms 2648 KB Output is correct

Subtask #2
70.0 / 70.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 15196 KB Output is correct
2 Correct 45 ms 6772 KB Output is correct
3 Correct 298 ms 15956 KB Output is correct
4 Correct 67 ms 8788 KB Output is correct
5 Correct 184 ms 12880 KB Output is correct
6 Correct 537 ms 26076 KB Output is correct
7 Correct 3 ms 15960 KB Output is correct
8 Correct 3 ms 15196 KB Output is correct
9 Correct 2 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 3 ms 15708 KB Output is correct
12 Correct 1 ms 2652 KB Output is correct
13 Correct 40 ms 6744 KB Output is correct
14 Correct 22 ms 4728 KB Output is correct
15 Correct 19 ms 4700 KB Output is correct
16 Correct 19 ms 2652 KB Output is correct
17 Correct 96 ms 8800 KB Output is correct
18 Correct 83 ms 9044 KB Output is correct
19 Correct 64 ms 8788 KB Output is correct
20 Correct 67 ms 8788 KB Output is correct
21 Correct 176 ms 12880 KB Output is correct
22 Correct 186 ms 13140 KB Output is correct
23 Correct 187 ms 10852 KB Output is correct
24 Correct 173 ms 12880 KB Output is correct
25 Correct 317 ms 15980 KB Output is correct
26 Correct 313 ms 14944 KB Output is correct
27 Correct 427 ms 17748 KB Output is correct
28 Correct 548 ms 26092 KB Output is correct
29 Correct 566 ms 24556 KB Output is correct
30 Correct 489 ms 23520 KB Output is correct
31 Correct 423 ms 15188 KB Output is correct
32 Correct 384 ms 16736 KB Output is correct