-
Notifications
You must be signed in to change notification settings - Fork 0
/
Q2583.java
85 lines (72 loc) · 2.26 KB
/
Q2583.java
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
package forRank;
import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.OutputStreamWriter;
import java.util.ArrayList;
import java.util.Collections;
import java.util.StringTokenizer;
public class Q2583 {
private static int M; //max Row
private static int N; //max Col
private static boolean visited[][];
private static int rowAdder[] = {0, 1, 0, -1};
private static int colAdder[] = {1, 0, -1, 0};
private static int counter;
private static ArrayList<Integer> getSolution(){
ArrayList<Integer> al = new ArrayList<Integer>();
for (int i = 0; i < M; i++) {
for (int j = 0; j < N; j++) {
if(!visited[i][j]){
counter = 1;
visited[i][j] = true;
dfs(i, j);
al.add(counter);
}
}
}
Collections.sort(al);
return al;
}
private static void dfs(int row, int col){
for (int i = 0; i < 4; i++) {
int nextRow = row + rowAdder[i];
int nextCol = col + colAdder[i];
if(nextRow >= 0 && nextCol >= 0 && nextRow < M && nextCol < N){
if(!visited[nextRow][nextCol]){
visited[nextRow][nextCol] = true;
counter++;
dfs(nextRow, nextCol);
}
}
}
}
public static void main(String[] args) throws IOException {
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
BufferedWriter bw = new BufferedWriter(new OutputStreamWriter(System.out));
StringTokenizer st = new StringTokenizer(br.readLine());
M = Integer.parseInt(st.nextToken()); //y, row
N = Integer.parseInt(st.nextToken()); //x, col
int K = Integer.parseInt(st.nextToken());
visited = new boolean[M][N];
for (int i = 0; i < K; i++) {
st = new StringTokenizer(br.readLine());
int x1 = Integer.parseInt(st.nextToken());
int y1 = Integer.parseInt(st.nextToken());
int x2 = Integer.parseInt(st.nextToken());
int y2 = Integer.parseInt(st.nextToken());
for (int x = x1; x < x2; x++) {
for (int y = y1; y < y2; y++)
visited[y][x] = true;
}
}
ArrayList<Integer> rs = getSolution();
bw.write(rs.size() + "\n");
for (int i = 0; i < rs.size(); i++)
bw.write(rs.get(i) + " ");
bw.write("\n");
br.close();
bw.close();
}
}