1 #include<bits/stdc++.h>
 2 using namespace std;
 3 long long Level_ZS=0,a[16],b[16],c[16],d[16];int n;
 4 int main(){
 5     scanf("%d",&n);
 6     for(int i=1;i<=n;++i)scanf("%lld%lld%lld%lld",&a[i],&b[i],&c[i],&d[i]);
 7     for(int st=0;st<1<<n;++st){
 8         long long Level_WHK=0,Level_OI=0;
 9         for(int i=0;i<=15;++i)
10             if(st&1<<i)Level_WHK+=a[i],Level_OI=max(Level_OI-b[i],0ll);
11             else Level_WHK=max(Level_WHK-d[i],0ll),Level_OI+=c[i];
12         Level_ZS=max(Level_ZS,Level_WHK*Level_OI);
13     }
14     printf("%lld\n",Level_ZS);
15 }

 1 #include<cstdio>
 2 int q,n,m,x1,x2,y1,y2,st[3][2002],ed[3][2002],ans;char s[2002][2002];
 3 const int xx[4]={0,-1,1,0},yy[4]={-1,0,0,1};
 4 void dfs(int x,int y){
 5     s[x][y]='0';
 6     for(int i=0;i<4;++i)if(x+xx[i]>=x1&&x+xx[i]<=x2&&y+yy[i]>=y1&&y+yy[i]<=y2&&s[x+xx[i]][y+yy[i]]=='1')dfs(x+xx[i],y+yy[i]);
 7 }
 8 int main(){
 9     scanf("%d%d%d",&n,&m,&q);
10     for(int i=1;i<=n;++i)scanf("%s",s[i]+1);
11     if(q==1){
12         scanf("%d%d%d%d",&x1,&y1,&x2,&y2);
13         for(int i=x1;i<=x2;++i)for(int j=y1;j<=y2;++j)if(s[i][j]=='1')ans++,dfs(i,j);
14         printf("%d\n",ans);
15         return 0;
16     }
17     if(n==1){
18         for(int i=1;i<=m;++i){
19             if(s[1][i]=='1'&&s[1][i-1]!='1')st[1][i]++;
20             if(s[1][i]=='1'&&s[1][i+1]!='1')ed[1][i]++;
21             st[1][i]+=st[1][i-1];ed[1][i]+=ed[1][i-1];
22         }
23         for(int i=1;i<=q;++i){
24             scanf("%d%d%d%d",&x1,&y1,&x2,&y2);
25             printf("%d\n",st[1][y2]-ed[1][y1-1]);
26         }
27         return 0;
28     }
29     if(n==2){
30         for(int i=1;i<=m;++i){
31             if(s[1][i]=='1'&&s[1][i-1]!='1')st[1][i]++;
32             if(s[1][i]=='1'&&s[1][i+1]!='1')ed[1][i]++;
33             st[1][i]+=st[1][i-1];ed[1][i]+=ed[1][i-1];
34             if(s[2][i]=='1'&&s[2][i-1]!='1')st[2][i]++;
35             if(s[2][i]=='1'&&s[2][i+1]!='1')ed[2][i]++;
36             st[2][i]+=st[2][i-1];ed[2][i]+=ed[2][i-1];
37             if(((s[1][i]=='1'&&s[1][i+1]!='1')||((s[2][i]=='1'&&s[2][i+1]!='1')))&&!((s[1][i]=='1'&&s[1][i+1]=='1')||(s[2][i]=='1'&&s[2][i+1]=='1')))ed[3][i]++;
38             if(((s[1][i]=='1'&&s[1][i-1]!='1')||((s[2][i]=='1'&&s[2][i-1]!='1')))&&!((s[1][i]=='1'&&s[1][i-1]=='1')||(s[2][i]=='1'&&s[2][i-1]=='1')))st[3][i]++;
39             st[3][i]+=st[3][i-1];ed[3][i]+=ed[3][i-1];
40         }
41         for(int i=1;i<=q;++i){
42             scanf("%d%d%d%d",&x1,&y1,&x2,&y2);
43             if(x1==x2)printf("%d\n",st[x2][y2]-ed[x1][y1-1]);
44             else printf("%d\n",st[3][y2]-ed[3][y1-1]);
45         }
46         return 0;
47     }
48 }