-
Notifications
You must be signed in to change notification settings - Fork 0
/
Main17822.java
139 lines (115 loc) · 2.88 KB
/
Main17822.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
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
138
139
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.LinkedList;
import java.util.Queue;
import java.util.StringTokenizer;
public class Main17822 {
public static void main(String[] args) throws NumberFormatException, 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());
int T = Integer.parseInt(st.nextToken());
// map
int[][] map = new int[N + 1][M];
for (int i = 1; i <= N; i++) {
st = new StringTokenizer(br.readLine());
for (int j = 0; j < M; j++) {
map[i][j] = Integer.parseInt(st.nextToken());
}
}
for (int t = 0; t < T; t++) {
st = new StringTokenizer(br.readLine());
int x = Integer.parseInt(st.nextToken());
int d = Integer.parseInt(st.nextToken());
int k = Integer.parseInt(st.nextToken());
rotate(map, x, d, k);
boolean flag = false;
//인접 숫자 찾기
for (int i = 1; i <= N; i++) {
for (int j = 0; j < M; j++) {
if(map[i][j] != 0) {
for (int w = 0; w < 4; w++) {
int nx = i + dx[w];
int ny = (j + dy[w] +M) % M;
if (nx == 0 || nx > N)
continue;
if (map[nx][ny] !=0 && map[nx][ny] == map[i][j]) {
flag = true;
find(map, i, j);
}
}
}
}
}
if(!flag) {
//인접한 수들 중 같은 수가 없는 경우
int cnt =0;
double avg =0;
for(int i=1;i<=N;i++) {
for(int j=0;j<M;j++) {
if(map[i][j] !=0) {
cnt++;
avg+=map[i][j];
}
}
}
if(cnt !=0) {
avg/=(double)cnt;
}
for(int i=1;i<=N;i++) {
for(int j=0;j<M;j++) {
if(map[i][j] !=0) {
if(map[i][j] < avg) {
map[i][j] +=1;
}else if(map[i][j] >avg){
map[i][j] -=1;
}
}
}
}
}
}
int cnt = 0;
for(int i=1;i<=N;i++) {
for(int j=0;j<M;j++) {
cnt+=map[i][j];
}
}
System.out.println(cnt);
}
static int N, M;
static int[] dx = { -1, 1, 0, 0 };
static int[] dy = { 0, 0, -1, 1 };
static void find(int[][] map, int x, int y) {
Queue<int[]> q = new LinkedList<int[]>();
q.offer(new int[] {x,y});
int val = map[x][y];
map[x][y] = 0;
while(!q.isEmpty()) {
int[] p = q.poll();
for (int k = 0; k < 4; k++) {
int nx = p[0] + dx[k];
int ny = (p[1] + dy[k]+M) % M;
if (nx == 0 || nx > N)
continue;
if (map[nx][ny] == val) {
map[nx][ny] = 0;
q.offer(new int[] { nx, ny });
}
}
}
}
static void rotate(int[][] map, int x, int d, int k) {
for (int i = 1; i <= N; i++) {
if (i % x == 0) { // 배수
int[] tmp = new int[M];
for (int j = 0; j < M; j++) {
tmp[(j + (d == 0 ? k : -k + M)) % M] = map[i][j];
}
map[i] = tmp;
}
}
}
}