#include using namespace std; int board[21][21]; int N; int ans = -1; void input() { cin >> N; for (int i = 0; i < N; i++) { for (int j = 0; j < N; j++) { cin >> board[i][j]; } } } void move(int dir) { // 각각 상 하 좌 우 if (dir == 0) { for (int j = 0; j < N; j++) { int cur = 0; for (int i = 1; i < N; i++) { if (board[i][j] == 0) continue; int tmp = board[i][j]; board[i][j] = 0; if (board[cur][j] == 0) { board[cur][j] = tmp; } else if (board[cur][j] == tmp) { board[cur][j] *= 2; cur++; } else { cur++; board[cur][j] = tmp; } } } } else if (dir == 1) { for (int j = 0; j < N; j++) { int cur = N - 1; for (int i = N - 2; i >= 0; i--) { if (board[i][j] == 0) continue; int tmp = board[i][j]; board[i][j] = 0; if (board[cur][j] == 0) { board[cur][j] = tmp; } else if (board[cur][j] == tmp) { board[cur][j] *= 2; cur--; } else { cur--; board[cur][j] = tmp; } } } } else if (dir == 2) { for (int i = 0; i < N; i++) { int cur = 0; for (int j = 1; j < N; j++) { if (board[i][j] == 0) continue; int tmp = board[i][j]; board[i][j] = 0; if (board[i][cur] == 0) { board[i][cur] = tmp; } else if (board[i][cur] == tmp) { board[i][cur] *= 2; cur++; } else { cur++; board[i][cur] = tmp; } } } } else if (dir == 3) { for (int i = 0; i < N; i++) { int cur = N - 1; for (int j = N - 2; j >= 0; j--) { if (board[i][j] == 0) continue; int tmp = board[i][j]; board[i][j] = 0; if (board[i][cur] == 0) { board[i][cur] = tmp; } else if (board[i][cur] == tmp) { board[i][cur] *= 2; cur--; } else { cur--; board[i][cur] = tmp; } } } } } int temp[21][21]; void copy() { for (int i = 0; i < N; i++) { for (int j = 0; j < N; j++) { temp[i][j] = board[i][j]; } } } void dfs(int cnt) { if (cnt == 5) { for (int i = 0; i < N; i++) { for (int j = 0; j < N; j++) { ans = max(ans, board[i][j]); } } return; } for (int dir = 0; dir < 4; dir++) { copy(); move(dir); dfs(cnt + 1); copy(); } } void solve() { input(); dfs(0); cout << ans; } int main(void) { ios::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL); solve(); return 0; }

제출 #52966

제출 정보

제출 결과

제출 코드

찾은 반례

입력:

오답 출력:

정답 출력:

입력:

오답 출력:

정답 출력:

입력:

오답 출력:

정답 출력: