#include #include using namespace std; int g_N, g_M; int g_A[21][21]; // -1 : 검은색, 0 : 무지개, 1 ~ M : 일반, 9 : 없음 int g_A_Check[21][21]; int g_count_b, g_count_b_max; // 블록 그룹 int g_count_rainbow, g_count_rainbow_max; // 무지개 블록 int g_pos_r_max, g_pos_c_max; int g_sum; bool Group(); // if 블록 그룹 찾으면 true, else false void Search(int r, int c, int before); void Delete(int r, int c, int before); void Gravity(); void Rotate(); int main() { ios_base :: sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); // Coding Area cin >> g_N >> g_M; for(int i = 1; i <= g_N; i++) { for(int j = 1; j <= g_N; j++) { cin >> g_A[i][j]; } } while(Group()) { Gravity(); Rotate(); Gravity(); } cout << g_sum; // return 0; } bool Group() { bool ret = false; g_count_b_max = 0; g_count_rainbow_max = 0; memset(g_A_Check, 0, sizeof(g_A_Check)); for(int i = 1; i <= g_N; i++) { for(int j = 1; j <= g_N; j++) { if(!g_A[i][j] || g_A[i][j] == 9 || g_A[i][j] == -1) continue; g_count_b = 0; g_count_rainbow = 0; Search(i, j, g_A[i][j]); if(!ret) ret = (g_count_b > 1); if(g_count_b_max < g_count_b) { g_count_b_max = g_count_b; g_pos_r_max = i; g_pos_c_max = j; g_count_rainbow_max = g_count_rainbow; } if(g_count_b_max == g_count_b) { if(g_count_rainbow_max <= g_count_rainbow) { g_count_rainbow_max = g_count_rainbow; g_pos_r_max = i; g_pos_c_max = j; } } } } if(ret) { memset(g_A_Check, 0, sizeof(g_A_Check)); Delete(g_pos_r_max, g_pos_c_max, g_A[g_pos_r_max][g_pos_c_max]); g_sum += (g_count_b_max * g_count_b_max); } return ret; } void Search(int r, int c, int before) { if(r < 1 || c < 1 || r > g_N || c > g_N) return; if(g_A_Check[r][c]) return; if(g_A[r][c] == -1 || g_A[r][c] == 9) return; if(g_A[r][c] != 0 && before != g_A[r][c]) return; g_count_b++; g_count_rainbow += (g_A[r][c] == 0); g_A_Check[r][c] = 1; //Search(r - 1, c, before); Search(r + 1, c, before); Search(r, c - 1, before); Search(r, c + 1, before); } void Delete(int r, int c, int before) { if(r < 1 || c < 1 || r > g_N || c > g_N) return; if(g_A_Check[r][c]) return; if(g_A[r][c] == -1 || g_A[r][c] == 9) return; if(g_A[r][c] != 0 && before != g_A[r][c]) return; g_A[r][c] = 9; g_A_Check[r][c] = 1; //Delete(r - 1, c, before); Delete(r + 1, c, before); Delete(r, c - 1, before); Delete(r, c + 1, before); } void Gravity() { for(int c = 1; c <= g_N; c++) { for(int r = g_N - 1; r > 0; r--) { if(g_A[r][c] == -1 || g_A[r][c] == 9) continue; int index = r; while(++index <= g_N) { if(g_A[index][c] != 9) break; } if(r != index - 1) { g_A[index - 1][c] = g_A[r][c]; g_A[r][c] = 9; } } } } void Rotate() { int copy_A[21][21]; memset(copy_A, 0, sizeof(copy_A)); for(int i = 1; i <= g_N; i++) { for(int j = 1; j <= g_N; j++) { copy_A[g_N + 1 - j][i] = g_A[i][j]; } } memcpy(g_A, copy_A, sizeof(copy_A)); }

제출 #124999

제출 정보

제출 결과

제출 코드

찾은 반례

입력:

오답 출력:

정답 출력:

입력:

오답 출력:

정답 출력:

입력:

오답 출력:

정답 출력: