FilesExpand file tree

 main

/

P101_2.java

Copy path

Blame

More file actions

Blame

More file actions

Latest commit

 

History

History

History

43 lines (38 loc) · 1.31 KB

 main

/

P101_2.java

Copy path

Top

File metadata and controls

• Code
• Blame

43 lines (38 loc) · 1.31 KB

Raw

Copy raw file

Download raw file

Open symbols panel

Edit and raw actions

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

package ch24;

public class P101_2 {

public int solution(int[][] board, int[][] skill) {

int N = board.length; // 행

int M = board[0].length; // 열

int[][] matrix = new int[N + 1][M + 1];

for (int[] s : skill) {

// s[0] 값에 따라 공격 또는 회복

int degree = s[5] * ((s[0] == 1) ? -1 : 1);

matrix[s[1]][s[2]] += degree; // 상단 / 좌측

matrix[s[1]][s[4] + 1] += (degree * -1); // 상단 / 우측+1

matrix[s[3] + 1][s[2]] += (degree * -1); // 하단+1 / 좌측

matrix[s[3] + 1][s[4] + 1] += degree; // 하단+1 / 우측+1

}

// 누적합 계산

// 좌우

for (int i = 0; i < N; i++) {

for (int j = 1; j < M; j++) {

matrix[i][j] += matrix[i][j - 1];

}

}

// 상하

for (int j = 0; j < M; j++) {

for (int i = 1; i < N; i++) {

matrix[i][j] += matrix[i - 1][j];

}

}

// 파괴되지 않은 건물 개수 계산

int answer = 0;

for (int i = 0; i < N; i++) {

for (int j = 0; j < M; j++) {

if (board[i][j] + matrix[i][j] > 0)

answer++;

}

}

return answer;

}

}