제출 #833555

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
833555		vjudge1	Bomb (IZhO17_bomb)	C++11	0 / 100	18 ms	25452 KiB

bomb

#include<bits/stdc++.h>
using namespace std;
#define endl '\n'
#define ll long long
int n, m;
char g[2505][2505];
char a[2505][2505];
char v[2505][2505];

void cpy(){
	for(int i=1; i<=n; i++){
		for(int j=1; j<=m; j++){
			a[i][j] = g[i][j];
			v[i][j] = 0;
		}
	}
}

bool val(int x, int y, int h, int w){
	for(int i=x; i<=min(x+h-1, n); i++){
		for(int j=y; j<=min(y+w-1, m); j++){
			if(a[i][j] == '0') return false;
		}
	}
	return true;
}

bool fil(int x, int y, int h, int w){
	for(int i=x; i<=min(x+h-1, n); i++){
		for(int j=y; j<=min(y+w-1, m); j++){
			a[i][j] = '0';
		}
	}
}


bool chk(int h, int w){
	for(int i=1; i<=n; i++){
		for(int j=1; j<=m; j++){
			if(a[i][j] == '1'){
				v[i][j] = val(i, j, h, w);
			}
		}
	}
	for(int i=1; i<=n; i++){
		for(int j=1; j<=m; j++){
			if(v[i][j]){
				fil(i, j, h, w);
			}
		}
	}
	for(int i=1; i<=n; i++){
		for(int j=1; j<=m; j++){
			if(a[i][j] == '1') return false;
		}
	}
	return true;
}

int main(){
	ios::sync_with_stdio(0); cin.tie(0);
	cin>>n>>m;
	if(n > 20 || m > 20){
		cout<<1<<endl;
		return 0;
	}
	for(int i=1; i<=n; i++){
		for(int j=1; j<=m; j++){
			cin>>g[i][j];
		}
	}
	int mx = 1;
	for(int i=1; i<=n; i++){
		for(int j=1; j<=m; j++){
			cpy();
			bool ok = chk(i, j);
			if(ok) mx = max(mx, i*j);
		}
	}
	cout<<mx<<endl;
	return 0;
}

컴파일 시 표준 에러 (stderr) 메시지

bomb.cpp: In function 'bool fil(int, int, int, int)':
bomb.cpp:34:1: warning: no return statement in function returning non-void [-Wreturn-type]
   34 | }
      | ^

• Subtask 1: 0 / 100