算法进阶指南：基本算法0x01位运算

1.最短Hamilton路径

91. 最短Hamilton路径 - AcWing题库

#include <iostream>
#include <cstdio>
#include <cstring>
#include <string>
#include <cstdlib>
#include <cmath>
#include <stack>
#include <queue>
#include <vector>
#include <map>
#include <set>
#include<bitset>
#include<list> 
#include <algorithm>
#define pii pair<int,int>
#define pll pair<LL,LL>
#define pil pair<int,LL>
#define pli pair<LL,int>
#define pdd pair<db,db>
#define se second 
#define fi first
#define endl '\n'
#define rep(i,a,b) for (register int i=a;i<b;++i)
#define per(i,a,b) for (register int i=a;i>b;--i)
#define MEM(a,x) memset(a,x,sizeof(a))
#define M(x) ((x)%MOD)
#define db double
#define eps 1e-9
typedef long long LL;
typedef unsigned long long ULL;
using namespace std;
const LL MOD=9901;
const int N=25;
int a[N][N],f[1<<20][N];
void solve()
{
	int n;
	cin>>n;
	rep(i,0,n) rep(j,0,n) cin>>a[i][j];
	MEM(f,0x3f);
	f[1][0]=0;
	rep(i,0,1<<n) rep(j,0,n) if(i>>j&1) rep(k,0,n) if(i>>k&1) f[i][j]=min(f[i][j],f[i^1<<j][k]+a[k][j]);
	cout<<f[(1<<n)-1][n-1];
}
int main()
{
//	#ifndef ONLINE_JUDGE
//    freopen("title.in","r",stdin);
//    freopen("title.out","w",stdout);
//    #endif
	ios::sync_with_stdio(0),cin.tie(0),cout.tie(0);
	int _=1;
	//cin>>_;
	while(_--){
		solve();
	}
//	rep(i,1,_+1){
//		printf("Case %d: ",i);
//		solve();
//	}
	return 0;
}

2.起床困难综合症

[NOI2014] 起床困难综合症 - 洛谷

#include <iostream>
#include <cstdio>
#include <cstring>
#include <string>
#include <cstdlib>
#include <cmath>
#include <stack>
#include <queue>
#include <vector>
#include <map>
#include <set>
#include<bitset>
#include<list> 
#include <algorithm>
#define pii pair<int,int>
#define pll pair<LL,LL>
#define pil pair<int,LL>
#define pli pair<LL,int>
#define pdd pair<db,db>
#define psi pair<string,int>
#define se second 
#define fi first
#define endl '\n'
#define rep(i,a,b) for (register int i=a;i<b;++i)
#define per(i,a,b) for (register int i=a;i>b;--i)
#define MEM(a,x) memset(a,x,sizeof(a))
#define M(x) ((x)%MOD)
#define db double
#define eps 1e-9
typedef long long LL;
typedef unsigned long long ULL;
using namespace std;
const LL MOD=9901;
const int N=1e5+10;
int n,m;
psi p[N];
int cal(int u,int nw)
{
	rep(i,0,n){
		int x=p[i].se>>u&1;
		if(p[i].fi=="AND") nw&=x;
		else if(p[i].fi=="OR") nw|=x;
		else nw^=x;
	}
	return nw;
}
void solve()
{
	cin>>n>>m;
	rep(i,0,n) cin>>p[i].fi>>p[i].se;
	int ans=0,val=0;
	per(i,29,-1){
		int res0=cal(i,0),res1=cal(i,1);
		if(val+(1<<i)<=m&&res1>res0) val+=1<<i,ans+=res1<<i;
		else ans+=res0<<i;
	}
	cout<<ans;
}
int main()
{
//	#ifndef ONLINE_JUDGE
//    freopen("title.in","r",stdin);
//    freopen("title.out","w",stdout);
//    #endif
	ios::sync_with_stdio(0),cin.tie(0),cout.tie(0);
	int _=1;
	//cin>>_;
	while(_--){
		solve();
	}
//	rep(i,1,_+1){
//		printf("Case %d: ",i);
//		solve();
//	}
	return 0;
}