#include<iostream>
#include<algorithm>
#include<cstdio>
#include<cstring>
using namespace std;
#define inf 0x3f3f3f3f
#define N 5009
int link[N][N];
int a[N],visit[N],head[N],nxt[N],to[N];
int n,s,len,ls,rs,m,tot=0,beg=0,ans=inf;
void dfs(int x,int des,int res)
{
if (ans<=res) return;
for (int i=head[x];i;i=nxt[i])
{
int y=to[i];
if (!visit[y])
{
visit[y]=1;
if (link[y][(x>n?x-n:x)]) dfs(y+n,des,res+a[y]);
else dfs(y,des,res+a[y]);
visit[y]=0;
}
else
if (y==beg)
{
if (link[des][(x>n?x-n:x)]) ans=min(ans,res);
return;
}
}
}
void add_edge(int x,int y){to[++tot]=y;nxt[tot]=head[x];head[x]=tot;}
int main()
{
scanf("%d",&n);
for (int i=1;i<=n;i++)
{
int temp;
scanf("%d%d%d%d",&s,&len,&ls,&rs);a[s]=len;
for (int j=1;j<=ls;j++) scanf("%d",&temp),add_edge(s,temp),link[s][temp]=1;
for (int j=1;j<=rs;j++) scanf("%d",&temp),add_edge(s+n,temp),link[s+n][temp]=1;
}
for (int i=1;i<=n;i++)
{
memset(visit,0,sizeof(visit));visit[i]=1;beg=i;
dfs(i,i+n,a[i]);
}
printf("%d\n",ans);
return 0;
}
【USACO4-1-2】篱笆回路 dfs
最新推荐文章于 2021-01-29 21:43:13 发布