-
Notifications
You must be signed in to change notification settings - Fork 0
/
l_shaped_plots
73 lines (71 loc) · 1.93 KB
/
l_shaped_plots
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
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
#include<bits/stdc++.h>
using namespace std;
int main()
{
int t;
cin>>t;
for(int q=1;q<=t;q++)
{
int r,c;
cin>>r>>c;
int a[r][c]={};
for(int i=0;i<r;i++)
{
for(int j=0;j<c;j++)
{
cin>>a[i][j];
}
}
int up[r][c]={};
int left[r][c]={};
int right[r][c]={};
int down[r][c]={};
for(int i=0;i<r;i++)
{
left[i][0]=a[i][0];
right[i][c-1]=a[i][c-1];
}
for(int i=0;i<c;i++)
{
up[0][i]=a[0][i];
down[r-1][i]=a[r-1][i];
}
for(int i=0;i<r;i++)
{
for(int j=0;j<c;j++)
{
if(a[i][j]==1)
{
if(i>0)up[i][j]+=up[i-1][j]+1;
if(j>0)left[i][j]+=left[i][j-1]+1;
}
}
}
for(int i=r-1;i>=0;i--)
{
for(int j=c-1;j>=0;j--)
{
if(a[i][j]==1)
{
if(i<(r-1))down[i][j]+=down[i+1][j]+1;
if(j<(c-1))right[i][j]+=right[i][j+1]+1;
}
}
}
int ans=0,d=0;
for(int i=0;i<r;i++)
{
for(int j=0;j<c;j++)
{
if(a[i][j]==1){
if(left[i][j]>1) ans+=max(d,min(left[i][j],up[i][j]/2)-1)+max(d,min(left[i][j],down[i][j]/2)-1);
if(up[i][j]>1) ans+=max(d,min(left[i][j]/2,up[i][j])-1)+max(d,min(right[i][j]/2,up[i][j])-1);
if(right[i][j]>1) ans+=max(d,min(right[i][j],up[i][j]/2)-1)+max(d,min(right[i][j],down[i][j]/2)-1);
if(down[i][j]>1) ans+=max(d,min(left[i][j]/2,down[i][j])-1)+max(d,min(right[i][j]/2,down[i][j])-1);
}
}
}
cout<<"Case #"<<q<<": "<<ans<<endl;
}
return 0;
}