#include using namespace std; inline void rotate(int shape[][2], int origin[][2]) { for (int i = 0; i < 4; i++) { shape[i][0] = origin[i][1]; shape[i][1] = origin[i][0]; } return; } inline void flip(int shape[][2], int origin[][2], int vertical, int offset) { for (int i = 0; i < 4; i++) { if (vertical) { shape[i][0] = origin[i][0]; shape[i][1] = -1 * origin[i][1] + offset; } else { shape[i][1] = origin[i][1]; shape[i][0] = -1 * origin[i][0] + offset; } } return; } int main() { int N, M; cin >> N >> M; int** board = new int* [N]; for (int n = 0; n < N; n++) { board[n] = new int[M]; for (int m = 0; m < M; m++) { cin >> board[n][m]; } } int a[4][2] = { {0, 0}, {1, 0}, {2, 0}, {3, 0} }; int b[4][2] = { {0, 0}, {1, 0}, {2, 0} ,{2, 1} }; int c[4][2] = { {0, 0}, {1, 0}, {1, 1}, {2, 1} }; int d[4][2] = { {0, 0}, {1, 0}, {2, 0}, {1, 1} }; int e[4][2] = { {0, 0}, {0, 1}, {1, 0}, {1, 1} }; int max = 0; // a_1 for (int n = 0; n < N - 3; n++) { for (int m = 0; m < M; m++) { int temp = 0; for (int i = 0; i < 4; i++) { temp += board[n + a[i][0]][m + a[i][1]]; } if (max < temp) { max = temp; } } } // a_2 int shape[4][2]; rotate(shape, a); for (int n = 0; n < N; n++) { for (int m = 0; m < M - 3; m++) { int temp = 0; for (int i = 0; i < 4; i++) { temp += board[n + shape[i][0]][m + shape[i][1]]; } if (max < temp) { max = temp; } } } //b_1 int N_b1 = N - 2; int M_b1 = M - 1; for (int n = 0; n < N_b1; n++) { for (int m = 0; m < M_b1; m++) { int temp = 0; for (int i = 0; i < 4; i++) { temp += board[n + b[i][0]][m + b[i][1]]; } if (max < temp) { max = temp; } } } //b_1_flip_v flip(shape, b, 1, 1); for (int n = 0; n < N_b1; n++) { for (int m = 0; m < M_b1; m++) { int temp = 0; for (int i = 0; i < 4; i++) { temp += board[n + shape[i][0]][m + shape[i][1]]; } if (max < temp) { max = temp; } } } //b_1_flip_h flip(shape, b, 0, 2); for (int n = 0; n < N_b1; n++) { for (int m = 0; m < M_b1; m++) { int temp = 0; for (int i = 0; i < 4; i++) { temp += board[n + shape[i][0]][m + shape[i][1]]; } if (max < temp) { max = temp; } } } //b_1_flip_flip flip(shape, b, 0, 2); flip(shape, shape, 1, 1); for (int n = 0; n < N_b1; n++) { for (int m = 0; m < M_b1; m++) { int temp = 0; for (int i = 0; i < 4; i++) { temp += board[n + shape[i][0]][m + shape[i][1]]; } if (max < temp) { max = temp; } } } //b_2 int N_b2 = N - 1; int M_b2 = N - 2; rotate(shape, b); for (int n = 0; n < N_b2; n++) { for (int m = 0; m < M_b2; m++) { int temp = 0; for (int i = 0; i < 4; i++) { temp += board[n + shape[i][0]][m + shape[i][1]]; } if (max < temp) { max = temp; } } } //b_2_flip_v rotate(shape, b); flip(shape, shape, 1, 2); for (int n = 0; n < N_b2; n++) { for (int m = 0; m < M_b2; m++) { int temp = 0; for (int i = 0; i < 4; i++) { temp += board[n + shape[i][0]][m + shape[i][1]]; } if (max < temp) { max = temp; } } } //b_2_flip_h rotate(shape, b); flip(shape, shape, 0, 1); for (int n = 0; n < N_b2; n++) { for (int m = 0; m < M_b2; m++) { int temp = 0; for (int i = 0; i < 4; i++) { temp += board[n + shape[i][0]][m + shape[i][1]]; } if (max < temp) { max = temp; } } } //b_2_flip_flip rotate(shape, b); flip(shape, shape, 0, 1); flip(shape, shape, 1, 2); for (int n = 0; n < N_b2; n++) { for (int m = 0; m < M_b2; m++) { int temp = 0; for (int i = 0; i < 4; i++) { temp += board[n + shape[i][0]][m + shape[i][1]]; } if (max < temp) { max = temp; } } } //c_1 int N_c1 = N - 2; int M_c1 = M - 1; for (int n = 0; n < N_c1; n++) { for (int m = 0; m < M_c1; m++) { int temp = 0; for (int i = 0; i < 4; i++) { temp += board[n + c[i][0]][m + c[i][1]]; } if (max < temp) { max = temp; } } } //c_1_flip flip(shape, c, 1, 1); for (int n = 0; n < N_c1; n++) { for (int m = 0; m < M_c1; m++) { int temp = 0; for (int i = 0; i < 4; i++) { temp += board[n + shape[i][0]][m + shape[i][1]]; } if (max < temp) { max = temp; } } } //c_2 int N_c2 = N - 1; int M_c2 = M - 2; rotate(shape, c); for (int n = 0; n < N_c2; n++) { for (int m = 0; m < M_c2; m++) { int temp = 0; for (int i = 0; i < 4; i++) { temp += board[n + shape[i][0]][m + shape[i][1]]; } if (max < temp) { max = temp; } } } //c_2_flip rotate(shape, c); flip(shape, shape, 0, 1); for (int n = 0; n < N_c2; n++) { for (int m = 0; m < M_c2; m++) { int temp = 0; for (int i = 0; i < 4; i++) { temp += board[n + shape[i][0]][m + shape[i][1]]; } if (max < temp) { max = temp; } } } //d_1 for (int n = 0; n < N - 2; n++) { for (int m = 0; m < M - 1; m++) { int temp = 0; for (int i = 0; i < 4; i++) { temp += board[n + d[i][0]][m + d[i][1]]; } if (max < temp) { max = temp; } } } //d_1_flip_v flip(shape, d, 1, 1); for (int n = 0; n < N - 2; n++) { for (int m = 0; m < M - 1; m++) { int temp = 0; for (int i = 0; i < 4; i++) { temp += board[n + shape[i][0]][m + shape[i][1]]; } if (max < temp) { max = temp; } } } //d_2 rotate(shape, d); for (int n = 0; n < N - 1; n++) { for (int m = 0; m < M - 2; m++) { int temp = 0; for (int i = 0; i < 4; i++) { temp += board[n + shape[i][0]][m + shape[i][1]]; } if (max < temp) { max = temp; } } } //d_2_flip_h rotate(shape, d); flip(shape, shape, 0, 1); for (int n = 0; n < N - 1; n++) { for (int m = 0; m < M - 2; m++) { int temp = 0; for (int i = 0; i < 4; i++) { temp += board[n + shape[i][0]][m + shape[i][1]]; } if (max < temp) { max = temp; } } } //e for (int n = 0; n < N - 1; n++) { for (int m = 0; m < M - 1; m++) { int temp = 0; for (int i = 0; i < 4; i++) { temp += board[n + e[i][0]][m + e[i][1]]; } if (max < temp) { max = temp; } } } cout << max << endl; return 0; }

제출 #48956

제출 정보

제출 결과

제출 코드

찾은 반례

입력:

오답 출력:

정답 출력:

입력:

오답 출력:

정답 출력: