-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathRectangles.cpp
More file actions
44 lines (39 loc) · 956 Bytes
/
Rectangles.cpp
File metadata and controls
44 lines (39 loc) · 956 Bytes
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
#include <bits/stdc++.h>
using namespace std;
void solve() {
int n, m; cin>>n>>m;
vector<string> s(n);
for (int i=0; i<n; i++) cin>>s[i];
bool rotate=false;
if (n>m) {
rotate=true;
swap(n, m);
}
vector< vector<int> > f(n, vector<int>(m, 1e9)), a(n, vector<int>(m));
for (int i=0; i<n; i++)
for (int j=0; j<m; j++) a[i][j]= rotate? s[j][i]=='1': s[i][j]=='1';
for (int u=0; u<n; u++) {
for (int d=u+1; d<n; d++) {
int lst=-1;
for (int l=0; l<m; l++) {
if (a[u][l] && a[d][l]) {
if (lst!=-1) {
for (int i=lst; i<=l; i++)
f[d][i]=min(f[d][i], (d-u+1)*(l-lst+1));
}
lst=l;
}
}
}
for (int d=n-2; d>=u; d--)
for (int i=0; i<m; i++)
f[d][i]=min(f[d][i], f[d+1][i]);
}
if (rotate) swap(n, m);
for (int i=0; i<n; i++)
for (int j=0; j<m; j++) cout<<(rotate?f[j][i]:f[i][j])%(int(1e9))<<" \n"[j+1==m];
}
int main() {
int nc; cin>>nc; while (nc--) solve();
return 0;
}