洛谷P4068 [SDOI2016]数字配对
思路:
二分图,将偶数个质因子和奇数个质因子分成二分图,跑费用流即可。
代码:
#include<bits/stdc++.h>
#define pii pair<int,int>
#define int long long
#define cl(x,y) memset(x,y,sizeof(x))
#define loop(x,y,z) for(x=y;x<=z;x++)
#define reve(x,y,z) for(x=y;x>=z;x--)
#define ct cerr<<"Time elapsed:"<<1.0*clock()/CLOCKS_PER_SEC<<"s.\n";
#define mp make_pair
#define pb push_back
#define fi first
#define se second
#define all(x) x.begin(),x.end()
#define lson x<<1,l,mid
#define rson x<<1|1,mid+1,r
#define INF 1e18
const int N=1e4+10;
const int M=1e6+10;
const int mod=1e9+7;
const int inf=0x3f3f3f3f3f3f3f3f;
const double eps=1e-8;
const double pi=acos(-1);
using namespace std;
struct edge
{
int u,v,f,w;
}e[M];
int head[N],len=1,dis[N],vis[N];
int maxflow,mincost;
int pre[N],path[N];
void add(int u,int v,int f,int w)
{
e[++len]={head[u],v,f,w};
head[u]=len;
}
void inc(int u,int v,int f,int w)
{
add(u,v,f,w);
add(v,u,0,-w);
}
int spfa(int s,int t)
{
cl(dis,inf);
cl(vis,0);
cl(pre,-1);
dis[s]=0;
vis[s]=1;
queue<int>q;
q.push(s);
while(!q.empty())
{
int u=q.front(),i;
q.pop();
vis[u]=0;
for(i=head[u];i;i=e[i].u)
{
int v=e[i].v,w=e[i].w;
if(e[i].f && dis[v]>dis[u]+w)
{
dis[v]=dis[u]+w;
pre[v]=u;
path[v]=i;
if(!vis[v])
{
q.push(v);
vis[v]=1;
}
}
}
}
return pre[t]!=-1;
}
void ek(int s,int t)
{
while(spfa(s,t))
{
int mi=inf,i;
for(i=t;i!=s;i=pre[i])
mi=min(mi,e[path[i]].f);
for(i=t;i!=s;i=pre[i])
{
e[path[i]].f-=mi;
e[path[i]^1].f+=mi;
}
if(mincost+dis[t]*mi>0)
{
int v=mincost/(-dis[t]);
maxflow+=v;
return;
}
maxflow+=mi;
mincost+=dis[t]*mi;
}
}
int a[N],b[N],c[N],cnt[N];
signed main()
{
ios::sync_with_stdio(false);
cin.tie(0);cout.tie(0);
int n,i,j;
cin>>n;
for(i=1;i<=n;i++)
cin>>a[i];
for(i=1;i<=n;i++)
cin>>b[i];
for(i=1;i<=n;i++)
cin>>c[i];
int s=0,t=n+1;
for(i=1;i<=n;i++)
{
int x=a[i];
for(j=2;j*j<=x;j++)
while(x%j==0)
{
x/=j;
cnt[i]++;
}
if(x>1)
cnt[i]++;
}
for(i=1;i<=n;i++)
{
if(cnt[i]&1)
inc(s,i,b[i],0);
else
inc(i,t,b[i],0);
for(j=1;j<=n;j++)
{
if(i==j)
continue;
if(a[i]%a[j]==0)
{
int w=a[i]/a[j],k,f=1;
for(k=2;k*k<=w;k++)
if(w%k==0)
{
f=0;
break;
}
if(f)
{
if(cnt[i]&1)
inc(i,j,inf,-c[i]*c[j]);
else
inc(j,i,inf,-c[i]*c[j]);
}
}
}
}
ek(s,t);
cout<<maxflow<<endl;
return 0;
}