Cod sursa(job #2607681)

Utilizator armigheGheorghe Liviu Armand armighe Data 30 aprilie 2020 00:12:59
Problema Adapost Scor 30
Compilator cpp-64 Status done
Runda Arhiva de probleme Marime 4.57 kb
#include<fstream>
#include<algorithm>
#include<vector>
#include<queue>
#include<cmath>
#include<iomanip>
#define INF 2000000000
using namespace std;
ifstream f("adapost.in");
ofstream g("adapost.out");
struct nod
{
    int x,poz;
};
vector<nod>a[805];
nod tata[805];
int n,s,d,flux,r[322002],mij;
long double dist[805],dist2[805],realdist[805],sol;
long double z[322002],Zs[160002];
pair<long double,long double>v[805];
bool inq[805];
queue<int>q;
struct elem
{
    int x;
    long double dist;
    inline bool operator < (const elem &a) const
    {
        return dist>a.dist;
    }
};
priority_queue<elem>pq;

inline bool dijkstra()
{
    int i,l;
    long double Z;
    elem p;
    for(i=1;i<=n;i++)
        dist[i]=INF,tata[i]={0,0};
    pq.push({s,0});
    dist[s]=0;
    dist2[s]=0;
    while(!pq.empty())
    {
        p=pq.top();
        pq.pop();
        if(p.dist==dist[p.x])
        {
            l=a[p.x].size();
            for(i=0;i<l;i++)
            {
                Z=realdist[p.x]-realdist[a[p.x][i].x]+z[a[p.x][i].poz];
                if(r[a[p.x][i].poz]>0)
                if(z[a[p.x][i].poz]<=Zs[mij]&&z[a[p.x][i].poz]>=-Zs[mij])
                if(dist[a[p.x][i].x]>dist[p.x]+Z)
                {
                    dist[a[p.x][i].x]=dist[p.x]+Z;
                    dist2[a[p.x][i].x]=dist2[p.x]+z[a[p.x][i].poz];
                    tata[a[p.x][i].x].x=p.x;
                    tata[a[p.x][i].x].poz=a[p.x][i].poz;
                    pq.push({a[p.x][i].x,dist[a[p.x][i].x]});
                }
            }
        }
    }
    for(i=1;i<=n;i++)
        realdist[i]=dist2[i];
    return dist[d]!=INF;
}

inline void bellman_ford()
{
    int i,l,p;
    for(i=1;i<=n;i++)
        realdist[i]=INF,inq[i]=0;
    realdist[s]=0;
    q.push(s);
    inq[s]=1;
    if(mij==25)
        mij++,mij--;
    while(!q.empty())
    {
        p=q.front();
        q.pop();
        inq[p]=0;
        l=a[p].size();
        for(i=0;i<l;i++)
        if(r[a[p][i].poz]>0)
        if(z[a[p][i].poz]<=Zs[mij]&&z[a[p][i].poz]>=-Zs[mij])
        if(realdist[a[p][i].x]>realdist[p]+z[a[p][i].poz])
        {
            realdist[a[p][i].x]=realdist[p]+z[a[p][i].poz];
            if(inq[a[p][i].x]==0)
            {
                q.push(a[p][i].x);
                inq[a[p][i].x]=1;
            }
        }
    }
}

inline void fmcm()
{
    int i,flow;
    long double cost;
    bellman_ford();
    while(dijkstra()!=0)
    {
        flow=INF;
        for(i=d;i!=s;i=tata[i].x)
        {
            flow=min(flow,r[tata[i].poz]);
            if(flow==0)
                break;
        }
        if(flow!=0&&flow!=INF)
        {
            cost=0;
            for(i=d;i!=s;i=tata[i].x)
            {
                r[tata[i].poz]-=flow;
                r[tata[i].poz^1]+=flow;
                cost+=z[tata[i].poz];
            }
            flux+=flow;
            sol+=flow*cost;
        }
        if(mij==19)
        mij++,mij--;
    }
}

long double calc_dist(int x,int y)
{
    long double sol;
    sol=(v[x].first-v[y].first)*(v[x].first-v[y].first)+(v[x].second-v[y].second)*(v[x].second-v[y].second);
    sol=sqrtl(sol);
    return sol;
}

int main()
{
    int i,k=0,j,st,dr,poz,nn;
    long double zz,SOL;
    f>>n;
    for(i=1;i<=2*n;i++)
        f>>v[i].first>>v[i].second;
    for(i=1;i<=n;i++)
    for(j=1;j<=n;j++)
    {
        zz=calc_dist(i,j+n);
        Zs[(i-1)*n+j]=zz;
        r[k]=1;
        z[k]=zz;
        a[i].push_back({j+n,k});
        k++;
        r[k]=0;
        z[k]=-zz;
        a[j+n].push_back({i,k});
        k++;
    }
    s=2*n+1;
    d=2*n+2;
    for(i=1;i<=n;i++)
    {
        r[k]=1;
        z[k]=0;
        a[s].push_back({i,k});
        k++;
        r[k]=0;
        z[k]=0;
        a[i].push_back({s,k});
        k++;
        r[k]=1;
        z[k]=0;
        a[i+n].push_back({d,k});
        k++;
        r[k]=0;
        z[k]=0;
        a[d].push_back({i+n,k});
        k++;
    }
    sort(Zs+1,Zs+n*n+1);
    st=1;
    dr=n*n;
    nn=n;
    n=n*2+2;
    while(st<=dr)
    {
        mij=(st+dr)/2;
        flux=0;
        sol=0;
        for(i=0;i<=k;i+=2)
            r[i]=1;
        for(i=1;i<=k;i+=2)
            r[i]=0;
        if(mij==19)
            mij++,mij--;
        fmcm();
        if(flux==nn)
        {
            poz=mij;
            SOL=sol;
            dr=mij-1;
        }
        else
            st=mij+1;
    }
    g<<fixed<<setprecision(5)<<Zs[poz]<<" "<<fixed<<setprecision(5)<<SOL;
    return 0;
}