제출 #1265208

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1265208		kwanddwo	Tracks in the Snow (BOI13_tracks)	C++20	0 / 100	2141 ms	1114112 KiB

tracks

#include <bits/stdc++.h>
using namespace std;

char cmap[4000][4000];
bool seen[4000][4000];
int n, m;

char currChar;
int changeCount = 1;

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

void flood_fill(pair<int, int> curr, deque<pair<int, int>>& q) {
	int y = curr.first, x = curr.second;
	cout << y << ", " << x << "\n";
	if (seen[y][x])
		return;

	seen[y][x] = true;
	for (int i = 0; i < 4; i++) {
		int nextY = y + dy[i];
		int nextX = x + dx[i]; 	
		if (nextY < 0 || nextY > n - 1)
			continue;
		if (nextX < 0 || nextX > m - 1)
			continue;
		if (seen[nextY][nextX])
			continue;
		
		char c = cmap[nextY][nextX];
		if (c == '.')
			continue;
		if (c != currChar) {
			q.push_back(make_pair(nextY, nextX));
			continue;
		}
		flood_fill(make_pair(nextY, nextX), q);
	}
}

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

	cin >> n >> m;
	for (int i = 0; i < n; i++) {
		for (int j = 0; j < m; j++) {
			cin >> cmap[i][j];
		}
	}

	currChar = cmap[0][0];
	pair<int, int> curr;
	deque<pair<int, int>> q;
	q.push_back({0, 0});

	while (!q.empty()) {
		curr = q.front();
		if (seen[curr.first][curr.second]) {
			q.pop_front();
			continue;
		}
		if (cmap[curr.first][curr.second] != currChar) {
			changeCount++;
			currChar = cmap[curr.first][curr.second];
		}
		flood_fill(curr, q);
		cout << "q: ";
		for (int i = 0; i < q.size(); i++)
			cout << "(" << q[i].first << ", " << q[i].second << ")" << ", ";
		cout << "\n";
		q.pop_front();
	}

	cout << changeCount << "\n";
	for (int i = 0; i < n; i++) {
		for (int j = 0; j < m; j++) {
			cout << seen[i][j] ? 1 : 0;
		}
		cout << "\n";
	}
}

• Subtask 1: 0 / 30
• Subtask 2: 0 / 70