-
Notifications
You must be signed in to change notification settings - Fork 0
/
BOJ_2573.cpp
92 lines (88 loc) · 1.88 KB
/
BOJ_2573.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
#include<iostream>
#include<vector>
#include<list>
#include<queue>
#include<cmath>
#include<string>
#include<algorithm>
#include<cstring>
#include<functional>
#include<cstdio>
#include<stack>
using namespace std;
#pragma warning(disable:4996)
#define INTMAX 0x7fffffff
#define gets(x) cin.getline(x,sizeof(x))
#define getstr(x) getline(cin,x)
#define square(x) (x)*(x)
int N, M, cnt = 0, year = 0;
int px[] = { -1,1,0,0 };
int py[] = { 0,0,-1,1 };
vector<vector<int>> v(300, vector<int>(300, 0));
vector<vector<int>> tmp;
vector<vector<bool>> visit(300, vector<bool>(300, false));
int melt(int x, int y) {
int num = 0;
for (int i = 0; i < 4; i++) {
int tmpx = x + px[i], tmpy = y + py[i];
if (tmpx >= 0 && tmpx < N&&tmpy >= 0 && tmpy < M)
if (tmp[tmpx][tmpy] == 0)
num++;
}
return num;
}
void check(int x, int y) {
visit[x][y] = true;
for (int i = 0; i < 4; i++) {
int tmpx = x + px[i], tmpy = y + py[i];
if (tmpx >= 0 && tmpx < N&&tmpy >= 0 && tmpy < M) {
if (!visit[tmpx][tmpy] && tmp[tmpx][tmpy] != 0) {
check(tmpx, tmpy);
}
}
}
}
int main(void) {
cin >> N >> M;
bool flag = false;
for (int i = 0; i < N; i++)
for (int j = 0; j < M; j++)
cin >> v[i][j];
tmp.assign(v.begin(), v.end());
while (1) {
cnt = 0;
//visit.clear();
for (int i = 0; i < N; i++) {
for (int j = 0; j < M; j++) {
if (v[i][j] != 0 && !visit[i][j]) {
flag = true;
cnt++;
check(i, j);
}
}
}
if (!flag) {
cout << "0" << endl;
system("pause");
return 0;
}
if (cnt >= 2) {
cout << year << endl;
system("pause");
return 0;
}
for (int i = 0; i < N; i++) {
for (int j = 0; j < M; j++) {
if (tmp[i][j] != 0) {
v[i][j] -= melt(i, j);
if (v[i][j] < 0) v[i][j] = 0;
}
}
}
flag = false;
tmp.assign(v.begin(), v.end());
for (int i = 0; i < N; i++)
fill(visit[i].begin(), visit[i].begin() + M, false);
year++;
}
}