13003：LED

「已注销」

于 2024-08-20 08:22:29 发布

阅读量323

点赞数 4

文章标签：算法

本文链接：https://blog.csdn.net/HRC122449/article/details/141340274

版权

#include<cmath>
#include<ctime>
#include<cstdio>
#include<cstring>
#include<cstdlib>
#include<iostream>
#include<algorithm>
#include<iomanip>
#include<vector>
#include<string>
#include<bitset>
#include<queue>
#include<map>
#include<set>
using namespace std;
 
inline int read()
{
	int x=0,f=1;char ch=getchar();
	while(ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=getchar();}
	while(ch<='9'&&ch>='0'){x=(x<<1)+(x<<3)+ch-'0';ch=getchar();}
	return x*f;
}
void print(int x)
{if(x<0)putchar('-'),x=-x;if(x>=10)print(x/10);putchar(x%10+'0');}
 
const int N=20010,inf=0X3f3f3f3f;
 
int a[N];
 
int q[N],f[N],pos[N],c[N],g[1<<22];
 
int main()
{
	int T=read();
	while(T--)
	{
		int n=read(),K=read(),L=read();
		for(int i=1;i<=K;++i)a[i]=read();
		sort(a+1,a+1+K);
		int cnt=1;
		for(int i=2;i<=K;++i)if(a[i]!=a[i-1])a[++cnt]=a[i];
		K=cnt;
		a[K+1]=n+2;
		a[0]=-1;
		cnt=0;
		for(int i=1;i<=K;++i)if(a[i]!=a[i-1]+1)pos[cnt++]=a[i];
		for(int i=1;i<=K;++i)if(a[i]!=a[i+1]-1)pos[cnt++]=a[i]+1;
		sort(pos,pos+cnt);
		for(int i=1;i<=n;++i)f[i]=inf;
		for(int i=1;i<=L;++i)c[i]=read();
		int head=0,tail=0;
		for(int i=1;i<=L;++i)
		{
			f[c[i]]=min(f[c[i]],1);
			q[tail++]=c[i];
		}
		while(head<tail)
		{
			int u=q[head++];
			for(int i=1;i<=L;++i)
			{
				if(u+c[i]<=n&&f[u+c[i]]==inf)
				{
					f[u+c[i]]=f[u]+1;
					q[tail++]=u+c[i];
				}
				if(u-c[i]>=1&&f[u-c[i]]==inf)
				{
					f[u-c[i]]=f[u]+1;
					q[tail++]=u-c[i];
				}
			}
		}
		for(int i=1;i<(1<<cnt);++i)
		{
			int u=0;
			g[i]=inf;
			for(int j=0;j<cnt;++j)
				if(i&(1<<j))
				{u=j;break;}
			for(int j=u+1;j<cnt;++j)
				if(i&(1<<j))
					g[i]=min(g[i],g[i^(1<<j)^(1<<u)]+f[pos[j]-pos[u]]);
		}
		printf("%d\n",g[(1<<cnt)-1]==inf?-1:g[(1<<cnt)-1]);
	}
	return 0;
}