#include //9:16PM-10:40PM using namespace std; int arr[501][501]; // int checked[501][501]; // int dx[4] = {-1, 0, 1, 0}; // int dy[4] = {0, -1, 0, 1}; int inrange(int x, int y, int N, int M){ if((x < 0) || (x>=N) || (y<0) ||(y>=M)) return 0; // if(checked[x][y] == 1) return 0; return 1; } int func(int x, int y, int N, int M){ int max = 0; int ret; //shape1 if(inrange(x+3, y, N, M)) { ret = arr[x+1][y] + arr[x+2][y] + arr[x+3][y]; if(max < ret) max = ret; } if(inrange(x, y+3, N, M)){ ret = arr[x][y+1]+arr[x][y+2]+arr[x][y+3]; if(max < ret) max=ret; } //shape2 if(inrange(x+1, y+1, N, M)){ ret = arr[x][y+1] + arr[x+1][y] + arr[x+1][y+1]; if(max < ret) max=ret; } //shape3 if(inrange(x+2, y+1, N, M)){ ret = arr[x+1][y] + arr[x+2][y] + arr[x+2][y+1]; if(max < ret) max=ret; } if(inrange(x+2, y-1, N, M)){ ret = arr[x+1][y] + arr[x+2][y] + arr[x+2][y-1]; if(max < ret) max=ret; } if(inrange(x+1, y+2, N, M)){ ret = arr[x][y+1]+arr[x][y+2]+arr[x+1][y]; if(max < ret) max=ret; } if(inrange(x+1, y+2, N, M)){ ret = arr[x][y+1]+arr[x][y+2]+arr[x+1][y+2]; if(max < ret) max=ret; } if(inrange(x+1, y+2, N, M)){ ret = arr[x+1][y]+arr[x+1][y+1]+arr[x+1][y+2]; if(max < ret) max=ret; } if(inrange(x+1, y-2, N, M)){ ret = arr[x+1][y]+arr[x+1][y-1]+arr[x+1][y-2]; if(max < ret) max=ret; } if(inrange(x+2, y+1, N, M)){ ret = arr[x+1][y]+arr[x+2][y]+arr[x][y+1]; if(max < ret) max=ret; } if(inrange(x+2, y+1, N, M)){ ret = arr[x][y+1]+arr[x+1][y+1]+arr[x+2][y+1]; if(max < ret) max=ret; } //shape4 if(inrange(x+2, y+1, N, M)){ ret = arr[x+1][y]+arr[x+1][y+1]+arr[x+2][y+1]; if(max < ret) max=ret; } if(inrange(x-2, y-1, N, M)){ ret = arr[x+1][y]+arr[x+1][y-1]+arr[x+2][y-1]; if(max < ret) max=ret; } if((inrange(x, y+1, N, M)) && inrange(x+1, y-1, N, M)){ ret = arr[x][y+1]+arr[x+1][y]+arr[x+1][y-1]; if(max < ret) max=ret; } if(inrange(x, y+2, N, M)){ ret = arr[x][y+1]+arr[x+1][y+1]+arr[x+1][y+2]; if(max < ret) max=ret; } //shape 5 if(inrange(x+2, y+1, N, M)){ ret = arr[x+1][y+1]+arr[x+1][y]+arr[x][y]; if(max < ret) max=ret; } if((inrange(x+1, y+1, N, M)) && inrange(x+1, y-1, N, M)){ ret = arr[x+1][y-1]+arr[x+1][y]+arr[x+1][y+1]; if(max < ret) max=ret; } if(inrange(x+2, y-1, N, M)){ ret = arr[x+1][y]+arr[x+2][y]+arr[x+1][y-1]; if(max < ret) max=ret; } if(inrange(x+1, y+2, N, M)){ ret = arr[x][y+1]+arr[x][y+2]+arr[x+1][y+1]; if(max < ret) max=ret; } return arr[x][y] + max; } int main(void){ ios::sync_with_stdio(false); cin.tie(0); int N, M; cin>>N>>M; for(int i=0;i>a; arr[i][j]=a; } } int max = 0; for(int i=0;i

제출 #50531

제출 정보

제출 결과

제출 코드

찾은 반례

입력:

오답 출력:

정답 출력:

입력:

오답 출력:

정답 출력:

입력:

오답 출력:

정답 출력: