-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathMain.java
More file actions
137 lines (115 loc) · 3.66 KB
/
Main.java
File metadata and controls
137 lines (115 loc) · 3.66 KB
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
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
import java.io.BufferedReader;
import java.io.IOException;
import java.util.LinkedList;
import java.util.Queue;
import java.util.StringTokenizer;
import java.io.InputStreamReader;
public class Main {
static int N,M;
static int[][] map, melt;
static boolean[][] visited;
static int[] dx = {-1,1,0,0};
static int[] dy = {0,0,-1,1};
public static void main(String[] args) throws IOException {
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
StringTokenizer st = new StringTokenizer(br.readLine());
N = Integer.parseInt(st.nextToken());
M = Integer.parseInt(st.nextToken());
map = new int[N][M];
for(int i=0; i<N; i++){
st = new StringTokenizer(br.readLine());
for(int j=0; j<M; j++){
map[i][j] = Integer.parseInt(st.nextToken());
}
}
int numOfIce = 1;
int time = 0;
while(true){
numOfIce = calNumOfIce();
// System.out.println("numOfIce: "+numOfIce);
if(numOfIce >=2){
break;
} else if(numOfIce == 0) {
time = 0;
break;
}
checkMeltingAmount();
// System.out.println("check melting");
// for(int i=0; i<N; i++){
// for(int j=0; j<M; j++){
// System.out.print(melt[i][j]+" ");
// }
// System.out.println();
// }
MeltingIce();
// System.out.println("after meltimg");
// for(int i=0; i<N; i++){
// for(int j=0; j<M; j++){
// System.out.print(map[i][j]+" ");
// }
// System.out.println();
// }
time++;
// System.out.println("time: "+time);
}
System.out.println(time);
br.close();
}
public static int calNumOfIce() {
int num = 0;
visited = new boolean[N][M];
for(int i=0; i<N; i++){
for(int j=0; j<M; j++){
if(map[i][j] > 0 && !visited[i][j]){
num++;
bfs(i,j);
}
}
}
return num;
}
public static void bfs(int x, int y){
Queue<int[]> q = new LinkedList<>();
q.add(new int[] {x,y});
visited[x][y] = true;
while(!q.isEmpty()){
int[] tmp= q.poll();
for(int i=0; i<4; i++){
int nx = tmp[0] + dx[i];
int ny = tmp[1] + dy[i];
if(0<=nx && nx<N && 0<=ny && ny<M){
if(!visited[nx][ny] && map[nx][ny] > 0){
visited[nx][ny] = true;
q.add(new int[] {nx,ny});
}
}
}
}
}
public static void checkMeltingAmount(){
melt = new int[N][M];
for(int i=0; i<N; i++){
for(int j=0; j<M; j++){
for(int k=0; k<4; k++){
int nx = i + dx[k];
int ny = j + dy[k];
if(map[i][j] !=0 && 0<=nx && nx<N && 0<=ny && ny<M){
if(map[nx][ny] == 0){
melt[i][j]++;
}
}
}
}
}
}
public static void MeltingIce() {
for(int i=0; i<N; i++){
for(int j=0; j<M; j++){
if(melt[i][j] > 0){
map[i][j] -= melt[i][j];
if(map[i][j] < 0) map[i][j] = 0;
}
}
}
}
}