#include #include #define MAX_NM 500 #define MAX_TETROMINO 5 typedef struct { int x; int y; }Pos; typedef struct { Pos block[4]; }Tetromino; int N, M; int map[MAX_NM][MAX_NM]; int max; Tetromino tetromino[MAX_TETROMINO] = { {{ {0,0}, {0,1}, {0,2}, {0,3} }}, {{ {0,0}, {0,1}, {1,0}, {1,1} }}, {{ {0,0}, {1,0}, {2,0}, {2,1} }}, {{ {0,0}, {1,0}, {1,1}, {2,1} }}, {{ {0,0}, {0,1}, {0,2}, {1,1} }} }; void rotate(Tetromino *cur, int n) { for (int i = 0;i < n;i++) { for (int j = 1;j < 4;j++) { Pos temp = cur->block[j]; cur->block[j] = (Pos){ temp.y, temp.x * -1 }; } } /* 0,1 1,0 0,-1 -1,0 2,1 1,-2 -2,-1 -1,2 */ } bool checkValid(int x, int y, Tetromino object) { bool ret = 1; for (int i = 0;i < 4;i++) { Pos temp = object.block[i]; temp.x += x; temp.y += y; if (temp.x < 0 || temp.y < 0 || temp.x >= N || temp.y >= M) { ret = 0; return ret; } } return ret; } int calPoint(int x, int y, Tetromino object) { int ret = 0; Tetromino cur = { 0 }; for (int i = 0;i < 4;i++) { cur.block[i] = (Pos){ object.block[i].x + x, object.block[i].y + y }; ret += map[cur.block[i].x][cur.block[i].y]; } /* for (int i = 0;i < N;i++) { for (int j = 0;j < M;j++) { int skip = 0; for (int k = 0;k < 4;k++) { if (i == cur.block[k].x && j == cur.block[k].y) { skip = 1; ret += map[i][j]; continue; } } if (!skip) { //ret += map[i][j]; } } } */ return ret; } void makeCase() { for (int i = 0;i < N;i++) { for (int j = 0;j < M;j++) { for (int k = 0;k < 5;k++) { for (int l = 0;l < 4;l++) { Tetromino new = tetromino[k]; //new.block[0].x = tetromino[k].block[0].x; //new.block[1].y = tetromino[k].block[1].y; //new.block[2].x = tetromino[k].block[2].x; //new.block[3] = tetromino[k].block[3]; rotate(&new, l); /* if (i == 0 & j == 0) { //printf("%d = %d %d\n", point, k, l); for (int m = 0;m < 4;m++) { printf("i:%d = %d %d\n", m, new.block[m].x, new.block[m].y); } } */ bool valid = checkValid(i, j, new); if (valid) { int point = calPoint(i, j, new); //printf("%d\n", point); if (point > max) max = point; } } } } } } int main() { scanf("%d %d", &N, &M); for (int i = 0;i < N;i++) { for (int j = 0;j < M;j++) { scanf("%d", &map[i][j]); } } makeCase(); printf("%d", max); return 0; }

제출 #39701

제출 정보

제출 결과

제출 코드

찾은 반례

입력:

오답 출력:

정답 출력:

입력:

오답 출력:

정답 출력:

입력:

오답 출력:

정답 출력: