1、可行性剪枝
所谓可行性剪枝,就是如当前状态和题意不符,并且由于题目可以推出,往后的所有情况和题意都不符,那么就可以进行剪枝,直接把这种情况及后续的所有情况判负,直接返回。
2、排除等效冗余
所谓排除等效冗余,就是当几个枝桠具有完全相同的效果的时候,只选择其中一个走就可以了。
3、最优性剪枝
所谓最优性剪枝,是在我们用搜索方法解决最优化问题的时候的一种常用剪枝方法。当搜到一半的时候,发现比已经搜索到的最优解差,则该方案肯定是不行的,即刻停止搜索,进行回溯。
4、顺序剪枝
普遍来讲,搜索的顺序是不固定的,对一个问题来讲,算法可以进入搜索树的任意的一个子节点。但假如我们要搜索一个最小值,而非要从最大值存在的那个节点开搜,就可能存在搜索到最后才出解。而我们从最小的节点开搜很可能马上就出解。这就是顺序剪枝的一个应用。一般来讲,有单调性存在的搜索问题可以和贪心思想结合,进行顺序剪枝。
5、记忆化剪枝
记忆化搜索其实是搜索的另外一个分支。在这里简单介绍一下记忆化的原理:
就是记录搜索的每一个状态,当重复搜索到相同的状态的时候直接返回。
+ 自我理解
洛古例题
eg:首都
参考题解:
// luogu-judger-enable-o2
#include<iostream>
#include<cstdio>
#include <bits/stdc++.h>
using namespace std;
inline int read() {
int x=0,f=1;
char ch=getchar();
while (!isdigit(ch)) {
if (ch=='-') f=-1;
ch=getchar();
}
while (isdigit(ch)) {
x=(x<<1)+(x<<3)+ch-'0';
ch=getchar();
}
return x*f;
}
const int maxn = 3e5+1e2;
int ch[maxn][3];
int fa[maxn],rev[maxn],st[maxn];
int n,m;
int sta[maxn];
int sum[maxn],xv[maxn];
int ans;
int son(int x) {
if (ch[fa[x]][0]==x) return 0;
else return 1;
}
bool notroot(int x) {
return ch[fa[x]][0]==x || ch[fa[x]][1]==x;
}
void update(int x) {
sum[x]=sum[ch[x][0]]+sum[ch[x][1]]+xv[x]+1;
}
void reverse(int x) {
swap(ch[x][0],ch[x][1]);
rev[x]^=1;
}
void pushdown(int x) {
if (rev[x]) {
if (ch[x][0]) reverse(ch[x][0]);
if (ch[x][1]) reverse(ch[x][1]);
rev[x]=0;
}
}
void rotate(int x) {
int y=fa[x],z=fa[y];
int b=son(x),c=son(y);
if (notroot(y)) ch[z][c]=x;
fa[x]=z;
ch[y][b]=ch[x][!b];
fa[ch[x][!b]]=y;
ch[x][!b]=y;
fa[y]=x;
update(y);
update(x);
}
void splay(int x) {
int y=x,cnt=0;
st[++cnt]=y;
while (notroot(y)) y=fa[y],st[++cnt]=y;
while (cnt) pushdown(st[cnt--]);
while (notroot(x)) {
int y=fa[x],z=fa[y];
int b=son(x),c=son(y);
if (notroot(y)) {
if (b==c) rotate(y);
else rotate(x);
}
rotate(x);
}
update(x);
}
void access(int x) {
for (int y=0; x; y=x,x=fa[x]) {
splay(x);
xv[x]+=sum[ch[x][1]]-sum[y];
ch[x][1]=y;
update(x);
}
}
void makeroot(int x) {
access(x);
splay(x);
reverse(x);
}
int findroot(int x) {
access(x);
splay(x);
while (ch[x][0]) {
pushdown(x);
x=ch[x][0];
}
return x;
}
void split(int x,int y) {
makeroot(x);
access(y);
splay(y);
}
void link(int x,int y) {
split(x,y);
if (findroot(y)!=x) {
xv[y]+=sum[x];
fa[x]=y;
update(y);
}
}
int q;
bool flag=false;
int top;
void dfs(int x,int lim) {
if (top>lim) {
flag=true;
return;
}
pushdown(x);
if (ch[x][0]) dfs(ch[x][0],lim);
if (flag) return;
sta[++top]=x;
if (flag) return;
if (ch[x][1]) dfs(ch[x][1],lim);
if (flag) return;
}
int main() {
n=read();
q=read();
for (int i=1; i<=n; i++) sum[i]=1,ans^=i;
for (int i=1; i<=q; i++) {
char s[10];
scanf("%s",s+1);
if (s[1]=='X') {
cout<<ans<<"\n";
}
if (s[1]=='Q') {
int x=read();
cout<<findroot(x)<<"\n";
}
if (s[1]=='A') {
int x=read(),y=read();
flag=false;
top=0;
int rx=findroot(x);
splay(rx);
int ry=findroot(y);
splay(ry);
ans^=rx^ry;
if (sum[rx]>sum[ry] || (sum[rx]==sum[ry] && rx<ry)) swap(x,y),swap(rx,ry);
int ymh = sum[rx];
int size = sum[rx]+sum[ry];
link(x,y);
access(x);
splay(ry);
dfs(ry,ymh);
int r = ry;
for (int i=1; i<=top; i++) {
splay(sta[i]);
int now = xv[sta[i]]+1+sum[ch[sta[i]][1]];
if (2*now>size || (2*now==size && sta[i]<=r)) r=sta[i];
else break;
}
makeroot(r);
ans^=r;
}
}
return 0;
}
eg:魔术数字游戏
参考题解:
#include<bits/stdc++.h>
using namespace std;
int n,m,a[11][11],f[101],g[11],d=0;
void s(int x,int y) {
if(x==4&&y>4) {
for(int i=1; i<=4; i++) {
for(int j=1; j<=4; j++) if(j==4) cout<<a[i][j]<<endl;
else cout<<a[i][j]<<" ";
}
cout<<endl;
}
if(y>4) {
int z=0;
for(int i=1; i<=4; i++) z+=a[x][i];
if(z==34) s(x+1,1);
return;
}
if(x==n&&y==m) {
s(x,y+1);
return;
}
for(int i=2; i<=16; i++) if(f[i]==0) {
if(x==4) {
int z=i;
for(int j=1; j<=3; j++) z+=a[j][y];
if(z!=34) continue;
}
if(x==4&&y==4) {
int z=i+a[1][1]+a[4][1]+a[1][4];
if(z!=34) continue;
}
if(x==4&&y==1) {
int z=i+a[1][4]+a[2][3]+a[3][2];
if(z!=34) continue;
}
if(x==4&&y==4) {
int z=i+a[1][1]+a[2][2]+a[3][3];
if(z!=34) continue;
}
if(x==3&&y==3) {
int z=i+a[2][2]+a[2][3]+a[3][2];
if(z!=34) continue;
}
if(x==2&&y==2) {
int z=i+a[1][1]+a[1][2]+a[2][1];
if(z!=34) continue;
}
if(x==2&&y==4) {
int z=i+a[1][3]+a[1][4]+a[2][3];
if(z!=34) continue;
}
if(x==4&&y==2) {
int z=i+a[3][1]+a[3][2]+a[4][1];
if(z!=34) continue;
}
if(x==4&&y==4) {
int z=i+a[3][3]+a[3][4]+a[4][3];
if(z!=34) continue;
}
f[i]=1;
a[x][y]=i;
s(x,y+1);
f[i]=0;
}
}
int main() {
cin>>n>>m;
a[n][m]=1;
f[1]=1;
s(1,1);
return 0;
}
eg:矩阵
参考题解:
#include<iostream>
#include<cstdio>
#include<cstring>
using namespace std;
const int N=200+5;
int a[N][N],c[N][N],n,m,p,l[N][N],r[N][N];
int f(int x) {
return x&1?-1:1;
}
bool dfs(int j) {
if(j==m)return true;
for(int k=0; k<p; k++) {
a[0][j]=k;
bool mark=true;
for(int i=1; i<n; i++) {
int t1=(c[i][j]+f(i+j+1)*a[0][0]+f(i)*a[0][j])*(-f(j));
int t2=(c[i][j]+f(i+j+1)*a[0][0]+f(i)*a[0][j]-(p-1))*(-f(j));
if(t1>t2)swap(t1,t2);
l[i][j]=max(l[i][j-1],t1);
r[i][j]=min(r[i][j-1],t2);
if(l[i][j]>r[i][j]) {
mark=false;
break;
}
}
if(mark) {
if(dfs(j+1))return true;
}
}
return false;
}
int main() {
//freopen("a.in","r",stdin);
scanf("%d%d%d",&n,&m,&p);
for(int i=0; i<n; i++)
for(int j=0; j<m; j++) {
int x;
scanf("%d",&x);
r[i][j]=p-1;
if(i&&j)c[i][j]=x-c[i][j-1]-c[i-1][j]-c[i-1][j-1];
}
for(int i=0; i<p; i++) {
a[0][0]=i;
if(dfs(1)) {
for(int j=1; j<n; j++)
a[j][0]=l[j][m-1];
for(int j=1; j<n; j++)
for(int k=1; k<m; k++)
a[j][k]=f(k)*a[j][0]+f(j)*a[0][k]+f(j+k+1)*a[0][0]+c[j][k];
break;
}
}
for(int i=0; i<n; i++)
for(int j=0; j<m; j++)
printf("%d%s",a[i][j],j==m-1?"\n":" ");
return 0;
}
eg:攻占黄金乡
参考题解:
#include<iostream>
#include<cstdio>
#include<algorithm>
#include<cmath>
#include<cstring>
#include<vector>
#include<queue>
#include<set>
#include<map>
#include<stack>
#include<bitset>
using namespace std;
const int maxn = 1505;
const int maxm = maxn*maxn;
const int dx[6] = {-1,1,0,0,0,0};
const int dy[6] = {0,0,-1,1,0,0};
const int dz[6] = {0,0,0,0,-1,1};
struct Point{
int x,y,z; Point(){}
Point(int x,int y,int z): x(x),y(y),z(z){}
};
int n,m,k,T,Need,tot,tp,Cnt,stk[26],cnt[maxn],p[maxn]
,pos[maxn],last[maxm],from[maxm],Num[maxm],siz[26],res[26];
char c[maxn]; bool bo[26];
vector <int> v[maxn];
vector <Point> G[26][26];
int Get_Num(const Point &p) {return p.z * n * m + p.y * n + p.x;}
bool cmp(const int &x,const int &y) {return v[x].size() > v[y].size();}
Point Get_Point(const int &t) {return Point(t % n,t / n % m,t / n / m);}
void Add(int x,int y) {Num[++Cnt] = y; from[Cnt] = last[x]; last[x] = Cnt;}
int Dis(const Point &A,const Point &B) {return abs(A.x - B.x) + abs(A.y - B.y) + abs(A.z - B.z);}
int getint()
{
char ch = getchar(); int ret = 0;
while (ch < '0' || '9' < ch) ch = getchar();
while ('0' <= ch && ch <= '9')
ret = ret*10 + ch - '0',ch = getchar();
return ret;
}
char Getc()
{
char ch = getchar();
while (ch < 'a' || 'z' < ch) ch = getchar();
return ch - 'a';
}
void Build_Graph()
{
for (int x = 0; x < n; x++)
for (int y = 0; y < m; y++)
for (int z = 0; z < k; z++)
{
char now = Getc(); ++siz[now];
c[Get_Num(Point(x,y,z))] = now;
if (!bo[now]) ++Need,bo[now] = 1;
}
for (int x = 0; x < n; x++)
for (int y = 0; y < m; y++)
for (int z = 0; z < k; z++)
for (int t = 0; t < 6; t++)
{
int xx = x + dx[t],yy = y + dy[t],zz = z + dz[t];
if (xx < 0 || xx >= n || yy < 0 || yy >= m || zz < 0 || zz >= k) continue;
Point p1 = Point(x,y,z),p2 = Point(xx,yy,zz);
if (c[Get_Num(p1)] == c[Get_Num(p2)]) continue;
G[c[Get_Num(p1)]][c[Get_Num(p2)]].push_back(p1);
}
}
void Dfs_Pre()
{
for (int i = 0; i < tot; i++)
for (int j = i + 1; j < tot; j++)
{
if (c[i] == c[j]) {v[i].push_back(j); v[j].push_back(i); continue;}
if (!G[c[i]][c[j]].size()) continue;
Point p1 = Get_Point(i),p2 = Get_Point(j);
vector <Point> &g = G[c[i]][c[j]];
for (int t = 0; t < g.size(); t++)
{
bool flag = 0; Point pa = g[t];
for (int o = 0; o < 6; o++)
{
int xx = pa.x + dx[o],yy = pa.y + dy[o],zz = pa.z + dz[o];
if (xx < 0 || xx >= n || yy < 0 || yy >= m || zz < 0 || zz >= k) continue;
Point pb = Point(xx,yy,zz);
if (c[Get_Num(pb)] != c[j]) continue;
int dis1 = Dis(p1,pa),dis2 = Dis(p2,pb);
if (dis1 == dis2) continue;
if (abs(dis1 - dis2) > 1) {flag = 1; break;}
if (c[i] < c[j] && dis1 < dis2) {flag = 1; break;}
if (c[i] > c[j] && dis1 > dis2) {flag = 1; break;}
}
if (flag) {v[i].push_back(j); v[j].push_back(i); break;}
}
}
}
bool Dfs(int x,int sum)
{
if (sum == Need) return 1;
if (cnt[p[x]]) return Dfs(x + 1,sum);
bo[c[p[x]]] = 1;
stk[tp++] = p[x]; --res[c[p[x]]];
bool pass = 1;
for (int i = last[p[x]]; i; i = from[i])
{
if (!cnt[Num[i]])
{
--res[c[Num[i]]];
if (!bo[c[Num[i]]] && !res[c[Num[i]]]) pass = 0;
}
++cnt[Num[i]];
}
if (pass && Dfs(x + 1,sum + 1)) return 1;
for (int i = last[p[x]]; i; i = from[i])
{
--cnt[Num[i]];
if (!cnt[Num[i]]) ++res[c[Num[i]]];
}
bool flag = 0; --tp; bo[c[p[x]]] = 0;
if (res[c[p[x]]]) flag = Dfs(x + 1,sum);
++res[c[p[x]]]; return flag;
}
void Clear()
{
for (int i = 0; i < tp; i++)
{
Point pn = Get_Point(stk[i]);
printf("%c %d %d %d\n",c[stk[i]] + 'a',pn.x,pn.y,pn.z);
}
for (int i = 0; i < tot; i++) cnt[i] = 0,v[i].clear(),last[i] = 0;
for (int i = 0; i < 26; i++)
for (int j = 0; j < 26; j++) G[i][j].clear();
for (int i = 0; i < 26; i++) bo[i] = siz[i] = 0;
Need = tp = Cnt = 0; puts("");
}
int main()
{
#ifdef DMC
freopen("DMC.txt","r",stdin);
#endif
T = getint();
while (T--)
{
n = getint(); m = getint(); k = getint();
tot = n * m * k; Build_Graph(); Dfs_Pre();
for (int i = 0; i < tot; i++) p[i] = i;
sort(p,p + tot,cmp);
for (int i = 0; i < tot; i++) pos[p[i]] = i;
for (int i = 0; i < tot; i++)
for (int j = 0; j < v[i].size(); j++)
if (pos[v[i][j]] > pos[i]) Add(i,v[i][j]);
for (int i = 0; i < 26; i++) res[i] = siz[i],bo[i] = 0;
Dfs(0,0); Clear();
}
return 0;
}
eg:数的划分
参考题解:
#include<bits/stdc++.h>
using namespace std;
int n,k;
int toal;
void dfs(int num,int sum,int start) {
if(num==k-1) {
toal++;
return ;
}
for(int i=start; i<=(n-sum)/(k-num); i++) {
dfs(num+1,sum+i,i);
}
return ;
}
int main() {
cin>>n>>k;
dfs(0,0,1);
cout<<toal;
return 0;
}
如果理解这些例题,还可以上洛谷搜哦!
暑假愉快,bye。