题目描述:
QAQ…
题目分析:
拆点 N^2 枚举建边 跑个最大费用流就好了…
题目链接:
Ac 代码:
#include <cstdio>
#include <iostream>
#include <cstring>
#include <queue>
#include <cmath>
const int inf=0x7fffffff;
const int maxm=2e6+100;
int head[maxm],to[maxm<<1],net[maxm<<1],cost[maxm<<1],cap[maxm<<1];
int cnt=1;
int val[maxm],id[maxm],l,r;
int gcd(int a,int b)
{
return !b?a:gcd(b,a%b);
}
inline void add(int u,int v,int c1,int c2){cnt++;to[cnt]=v,cap[cnt]=c1,cost[cnt]=c2,net[cnt]=head[u],head[u]=cnt;}
inline void addedge(int u,int v,int c1,int c2){add(u,v,c1,c2),add(v,u,0,-c2);}
namespace MCMF{
int flow[maxm],pre[maxm],id[maxm],dis[maxm],maxflow,mincost;
bool vis[maxm];
std::queue<int> dl;
inline bool SPFA(int s,int t)
{
while(!dl.empty()) dl.pop();
memset(dis,127/3,sizeof(dis)),memset(pre,-1,sizeof(pre));
dl.push(s),dis[s]=0,pre[s]=0,vis[s]=1,flow[s]=inf;
while(!dl.empty())
{
int now=dl.front();
dl.pop();
vis[now]=0;
for(int i=head[now];i;i=net[i])
if(cap[i]&&dis[to[i]]>dis[now]+cost[i])
{
dis[to[i]]=dis[now]+cost[i];
pre[to[i]]=now;
id[to[i]]=i;
flow[to[i]]=std::min(cap[i],flow[now]);
if(!vis[to[i]]) vis[to[i]]=1,dl.push(to[i]);
}
}
return pre[t]!=-1;
}
inline void change_cap(int s,int t,int x)
{
int now=t;
while(now!=s)
{
cap[id[now]]-=x,cap[id[now]^1]+=x;
now=pre[now];
}
}
inline int mcmf(int s,int t)
{
maxflow=0,mincost=0;
while(SPFA(s,t))
{
maxflow+=flow[t],mincost+=flow[t]*dis[t];
change_cap(s,t,flow[t]);
}
return mincost;
}
}
int main()
{
int tot=0;
scanf("%d%d",&l,&r);
for(int i=l;i<=r;i++) id[i]=++tot;
int s=0,t=2*tot+10;
for(int i=l;i<=r;i++) addedge(s,i,1,0),addedge(i+tot,t,1,0);
for(int i=l;i<=r;i++)
for(int j=l;j<i;j++)
{
int z=i*i-j*j;
double x=z;
if(std::sqrt(x)==std::floor(sqrt(x)))
if(gcd(j,(int)std::floor(sqrt(x)))==1) addedge(i,j+tot,1,-i-j),addedge(j,i+tot,1,-i-j);
}
MCMF::mcmf(s,t);
printf("%d %d\n",MCMF::maxflow/2,-(MCMF::mincost/2));
return 0;
}