蓝桥杯 历届试题 剪格子

 1 #include<iostream>
 2 #include<cstring>
 3 #include<cstdio>
 4 #include<queue>
 5 #include<algorithm>
 6 using namespace std;
 7 int map[15][15];
 8 bool vis[15][15];
 9 int sum,num,m,n;
10 int dir[4][2]={{0,-1},{0,1},{-1,0},{1,0}};//上下左右
11 bool in(int x,int y){
12     if(x<0||x>=n|y<0||y>=m||vis[x][y])
13         return false;
14     return true;
15 }
16 void dfs(int x,int y,int s,int nu){
17     if(s==sum){
18         if(nu<num){
19             num=nu;
20 
21             //cout<<nu<<"   "<<num<<endl;
22 
23             return;
24         }
25     }
26 
27     int i,j,k,xx,yy;
28     for(i=0;i<4;i++){
29         xx=x+dir[i][0];
30         yy=y+dir[i][1];
31         if(in(xx,yy)&&(s+map[xx][yy]<=sum)&&nu+1<num){
32             //cout<<nu<<"   "<<xx<<"   "<<yy<<endl;
33             vis[xx][yy]=true;
34             dfs(xx,yy,s+map[xx][yy],nu+1);
35             vis[xx][yy]=false;
36         }
37     }
38     //cout<<map[0][3]<<endl;
39 }
40 int main(){
41     //freopen("D:\\input.txt","r",stdin);
42 
43     int i,j,k;
44     while(scanf("%d%d",&m,&n)!=EOF){
45     memset(vis,false,sizeof(vis));
46     sum=0;
47     for(i=0;i<n;i++){
48         for(j=0;j<m;j++){
49             scanf("%d",&map[i][j]);
50             sum+=map[i][j];
51         }
52     }
53 
54     if(sum%2){
55         cout<<0<<endl;
56     }
57     else{
58         num=m*n;
59         sum=sum/2;
60         //cout<<sum<<endl;
61         vis[0][0]=true;
62         dfs(0,0,map[0][0],1);
63         vis[0][0]=false;
64         //cout<<num<<endl;
65         if(num==m*n){
66             num=0;
67         }
68         cout<<num<<endl;
69     }
70     }
71     return 0;
72 }