JOJ 1052: Square Destroyer解题报告

题意：

 

给定正方形，求最少取多少个火柴，所有正方形都被破坏。

 

思路：

1. 每个火柴影响的正方形记录出来，把每个火柴看成一个集合，相当于求完全的覆盖

*   深搜的减枝策略

1. 已经超过最优解，减枝

2.将之后的全部加上都无法覆盖

3.加上当前的，当前覆盖无变化

4.深搜已用根数

 

2. 计算每条边影响的正方形

 

1. 从正方形来计算这个正方形有哪些边构成，循环跑正方形

2. 计算某个边以后所有边全用，正方形集合的并集

 

3. 棍子所在行列转化为是第几要棍子

 

4. 用位计算模拟集合，因为最长为55位，用long long 型。

 

5. nowcover未初始化 wa  N次……

 

代码：

. #include <iostream> #include <algorithm> #include <cmath> using namespace std; long long congregation[62]; long long aftercongration[62]; bool choosestick[62]; int totaledge; int totalsquare; long long nowcover; int minstick; int n; long long maxcover; void dfs(int stickcnt,int laststick,long long nowcover); void calcong(int n); int turn(int x ,int y); int main() { int cases; cin>>cases; while (cases--) { nowcover=0; minstick=0x7fffffff; cin>>n; totaledge=2*(n)*(n+1); totalsquare=0; for (int i=1;i<=n;++i) { totalsquare+=i*i; } maxcover=(long long )pow(2.0,totalsquare)-1; calcong(n); int p; cin>>p; while (p--) { int havedeleteedge; cin>>havedeleteedge; nowcover=nowcover|congregation[havedeleteedge]; choosestick[havedeleteedge]=true; } if(n==0) { cout<<0<<endl; continue; } dfs(0,0,nowcover); cout<<minstick<<endl; } } void dfs(int stickcnt,int laststick,long long nowcover) { if(nowcover==maxcover && stickcnt<minstick) { minstick=stickcnt; } if(stickcnt>=minstick) { return; } if( ( nowcover|aftercongration[laststick+1] ) !=maxcover ) { //printf("%d/n",nowcover|aftercongration[laststick+1] ); //printf("maxcover=%d/n",maxcover); return; } for(int i=laststick+1;i<=totaledge;++i) { long long afteradd=nowcover|congregation[i]; if(afteradd!=nowcover) dfs(stickcnt+1,i,afteradd); } } void calcong(int n) { for(int i=0;i<62;++i) { congregation[i]=0; aftercongration[i]=0; } int nowsquare=0; int x=1; int y=0; for (int side=1;side<=n;++side) { while(1) { ++y; if (y+side-1>n) { x+=2; y=1; if (x+2*side>n*2+1) { x=1; y=0; break; } } ++nowsquare; //printf("nowsquare=%d",nowsquare); //system("pause"); //找到第几个方形，求出起如边 long long p=1; for (int i=y;i<=y+side-1;++i) { congregation[turn(x,i)]|=p<<(nowsquare-1); } for (int i=x+1;i<=x+1+2*side-2;i+=2) { congregation[turn(i,y)]|=p<<(nowsquare-1); } for (int i=x+1;i<=x+1+2*side-2;i+=2) { congregation[turn(i,y+side)]|=p<<(nowsquare-1); } for (int i=y;i<=y+side-1;++i) { congregation[turn(x+2*side,i)]|=p<<(nowsquare-1); } //影响该方形的边记录 } } aftercongration[totaledge]=congregation[totaledge]; for (int i=totaledge-1;i>=1;--i) { aftercongration[i]=aftercongration[i+1]|congregation[i]; } //计算aftergration; } int turn(int x ,int y) { if (x%2==1) { return n*(x/2)+(n+1)*(x/2)+y; } else { return n*(x/2)+(n+1)*(x/2-1)+y; } }