#include #include using namespace std; int N, M; vector> v; int type1_1(int x, int y){ //젤 긴거 if(y+3 >= M) return 0; return v[x][y]+v[x][y+1]+v[x][y+2]+v[x][y+3]; } int type1_2(int x, int y){ //젤 긴거 if(x+3 >= N) return 0; return v[x][y]+v[x+1][y]+v[x+2][y]+v[x+3][y]; } int type2(int x, int y){ //정사각형 if(y+1>=M || x+1 >= N) return 0; return v[x][y]+v[x][y+1]+v[x+1][y]+v[x+1][y+1]; } int type3_1(int x, int y){ //주황색 if(x+2 >= N || y+1 >= M) return 0; return v[x][y]+v[x+2][y+1]+v[x+1][y]+v[x+2][y]; } int type3_2(int x, int y){ //주황색 if(x+2 >= N || y+1 >= M) return 0; return v[x][y]+v[x][y+1]+v[x+1][y]+v[x+2][y]; } int type3_3(int x, int y){ //주황색 if(y-1 < 0 || x+2 >= N) return 0; return v[x][y]+v[x+2][y-1]+v[x+1][y]+v[x+2][y]; } int type3_4(int x, int y){ //주황색 if(x+2 >= N || y+1 >= M) return 0; return v[x][y]+v[x][y+1]+v[x+1][y+1]+v[x+2][y+1]; } int type3_5(int x, int y){ //주황색 if(x+1 >= N || y+2 >= M) return 0; return v[x][y]+v[x][y+1]+v[x][y+2]+v[x+1][y+2]; } int type3_6(int x, int y){ //주황색 if(x+1 >= N || y+2 >= M) return 0; return v[x][y]+v[x+1][y]+v[x+1][y+1]+v[x+1][y+2]; } int type3_7(int x, int y){ //주황색 if(x+1 >= N || y+2 >= M) return 0; return v[x][y]+v[x][y+1]+v[x][y+2]+v[x+1][y]; } int type3_8(int x, int y){ //주황색 if(x+1 >= N || y - 2 <0) return 0; return v[x][y]+v[x+1][y]+v[x+1][y-1]+v[x+1][y-2]; } int type4_1(int x, int y){ if(x+2 >=N || y+1>=M) return 0; return v[x][y]+v[x+1][y]+v[x+1][y+1]+v[x+2][y+1]; } int type4_2(int x, int y){ if(x+2 >=N || y-1 < 0) return 0; return v[x][y]+v[x+1][y]+v[x+1][y-1]+v[x+2][y-1]; } int type4_3(int x, int y){ if(x-1 < 0 || y+2 >= M) return 0; return v[x][y]+v[x][y+1]+v[x-1][y+1]+v[x-1][y+2]; } int type4_4(int x, int y){ if(x+1 >=N || y+2 >= M) return 0; return v[x][y]+v[x][y+1]+v[x+1][y+1]+v[x+1][y+1]; } int type5_1(int x, int y){ if(x+1 >= N || y+2 >= M) return 0; return v[x][y]+v[x][y+1]+v[x][y+2]+v[x+1][y+1]; } int type5_2(int x, int y){ if(x+2 >= N || y+1 >= M) return 0; return v[x][y]+v[x+1][y]+v[x+2][y]+v[x+1][y+1]; } int type5_3(int x, int y){ if(x+2 >= N || y-1 < 0) return 0; return v[x][y]+v[x+1][y]+v[x+2][y]+v[x+1][y-1]; } int type5_4(int x, int y){ if(x-1 < 0 || y+2 >= M) return 0; return v[x][y]+v[x][y+1]+v[x][y+2]+v[x-1][y+1]; } int main(){ ios::sync_with_stdio(NULL); cin.tie(0); cin >> N >> M; v = vector>(N, vector(M)); int result = 0; for(int i=0;i> v[i][j]; } } for(int i=0;i

제출 #32033

제출 정보

제출 결과

제출 코드

찾은 반례

입력:

오답 출력:

정답 출력:

입력:

오답 출력:

정답 출력:

입력:

오답 출력:

정답 출력: