제출 #449897

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
449897		fuad27	Tracks in the Snow (BOI13_tracks)	C++14	24.90 / 100	2099 ms	638552 KiB

tracks

#include<bits/stdc++.h>
using namespace std;
int h, w, ans = 0;
vector<vector<char>> v;
vector<vector<bool>> visited(h, vector<bool> (w, 0));
void dfs(vector<vector<char>> &v, int i, int j, char k) {
if(i < 0 or j < 0  or i >= h or j >=w or v[i][j] == '.' or (v[i][j] != '#' and v[i][j] != k) or visited[i][j])return;
else {
	v[i][j] = '#';
	visited[i][j] = true;
	dfs(v, i+1, j, k);
	dfs(v, i-1, j, k);
	dfs(v, i, j+1, k);
	dfs(v, i, j-1, k);	
}
}
int main () {
cin >> h >> w;
v.resize(h, vector<char> (w));
for(int i = 0;i<h;i++) {
	for(int j = 0;j<w;j++) {
		cin >> v[i][j];
	}
}
queue<pair<int, int>> q;
q.push({0, 0});
vector<vector<int>> visi(h, vector<int>(w, 0));
while(!q.empty()) {
	int x = q.front().first;
	int y = q.front().second;
	q.pop();
	if(v[x][y]!='.' and !visi[x][y]) {
		visited.assign(h, vector<bool> (w, 0));
		if(x) {
			q.push({x-1, y});
		}
		if(y) {
			q.push({x, y-1});
		}
		if(x < h-1) {
			q.push({x+1, y});
		}
		if(y < w -1) {
			q.push({x, y+1});
		}
		if(v[x][y] != '#') {
		dfs(v, x, y, v[x][y]);
		ans++;
	}
	visi[x][y] = 1;
}
}
cout<<ans<<endl;

}

• Subtask 1: 18.333333333333332 / 30
• Subtask 2: 6.5625 / 70