Cod sursa(job #3339202)

Utilizator Dia3141Costea Diana Stefania Dia3141 Data 6 februarie 2026 18:48:14
Problema Bibel Scor 5
Compilator cpp-64 Status done
Runda Arhiva de probleme Marime 1.2 kb
#include <fstream>
#define inf 1e9
using namespace std;
ifstream cin("bibel.in");
ofstream cout("bibel.out");
int dp[(1<<17)][20],x,y,t,n,m,c[20][20];
struct punct{
    int x,y;
}v[20];
int dist(punct i,punct j){
    return (i.x-j.x)*(i.x-j.x)+(i.y-j.y)*(i.y-j.y);
}
int solve(){
    for(int i=0;i<n;i++)
        for(int j=0;j<n;j++)
            c[i][j]=inf;
    for(int i=0;i<(1<<n);i++)
        for(int j=0;j<n;j++)
            dp[i][j]=inf;
    for(int i=0;i<n;i++)
        for(int j=0;j<n;j++)
            if(i!=j)
                c[i][j]=dist(v[i],v[j]);
    dp[1][0]=0;
    for(int i=1;i<(1<<n);i++)
        for(int j=0;j<n;j++)
            if((i>>j)&1)
                for(int k=0;k<n;k++)
                    if(j!=k&&((i>>k)&1)&&c[j][k]!=inf&&dp[i-(1<<k)][j]!=inf)
                        dp[i][k]=min(dp[i][k],dp[i-(1<<k)][j]+c[j][k]);
    int ans=inf;
    for(int i=0;i<n;i++)
        ans=min(ans,dp[(1<<n)-1][i]);
    return ans;
}
signed main()
{
    n=1;
    while(cin>>m){
        if(m==1){
            cout<<solve()<<'\n';
        }else if(m==2)
            break;
        else{
            cin>>v[n].x>>v[n].y;
            n++;
        }
    }
    return 0;
}