CF8C Looking for Order

CF8C Looking for Order
明显状压dp
朴素做法tle 发现先后到达某个点并不会影响答案，所以一旦从当前状态成功转移，那么就跳出当前状态

#include <bits/stdc++.h>
#define ll long long
using namespace std;
struct node{
    int x,y;
};
struct fairyland{
    int fir,sec,num;
};
int road(node i,node j){
    return (i.x-j.x)*(i.x-j.x)+(i.y-j.y)*(i.y-j.y);
}
int main(){
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);

    int sx,sy;
    cin>>sx>>sy;
    int n;
    cin>>n;
    vector<node> a(n+1);
    a[0]={sx,sy};
    for (int i=1;i<=n;i++){
        cin>>a[i].x>>a[i].y;
    }

    vector<int> dp(1<<n,1e9);
    vector<fairyland> pre(1<<n);
    dp[0]=0;
    for (int k=0;k<(1<<n);k++){
        if (dp[k]==1e9) continue;
        for (int i=1;i<=n;i++){
            if (k&(1<<(i-1))) continue;
            if (dp[k|(1<<(i-1))]>dp[k]+2*road(a[0],a[i])){
                dp[k|(1<<(i-1))]=dp[k]+2*road(a[0],a[i]);
                pre[k|(1<<(i-1))]={i,-1,k};
            }

            for (int j=i+1;j<=n;j++){
                if (k&(1<<(j-1))) continue;
                int now=(k|(1<<(i-1)))|(1<<(j-1));
                if (dp[now]>dp[k]+road(a[0],a[i])+road(a[i],a[j])+road(a[j],a[0])){
                    dp[now]=dp[k]+road(a[0],a[i])+road(a[i],a[j])+road(a[j],a[0]);
                    pre[now]={i,j,k};
                }
            }
            break;//！！！核心优化
        }
    }

    
    int now=(1<<n)-1;
    cout<<dp[now]<<"\n";
    cout<<"0 ";
    while (now){
        cout<<pre[now].fir<<" ";
        if (pre[now].sec!=-1){
            cout<<pre[now].sec<<" ";
        }
        cout<<"0 ";
        now=pre[now].num;
    }
    return 0;
}