SCAU培训 C 平面最佳坐标点(模拟退火)

SCAU培训 C 平面最佳坐标点

#include<iostream>
#include<string>
#include<algorithm>
#include<cstdio>
#include<cstring>
#include<cmath>
#include<map>
#include <queue>
#include<sstream>
#include <stack>
#include <set>
#include <bitset>
#include<vector>
#include<ctime>
#define FAST ios::sync_with_stdio(false)
#define abs(a) ((a)>=0?(a):-(a))
#define sz(x) ((int)(x).size())
#define all(x) (x).begin(),(x).end()
#define mem(a,b) memset(a,b,sizeof(a))
#define max(a,b) ((a)>(b)?(a):(b))
#define min(a,b) ((a)<(b)?(a):(b))
#define rep(i,a,n) for(int i=a;i<=n;++i)
#define per(i,n,a) for(int i=n;i>=a;--i)
#define endl '\n'
#define pb push_back
#define mp make_pair
#define fi first
#define se second
using namespace std;
typedef long long ll;
const int maxn = 5e5+200;
const int inf=0x3f3f3f3f;
const double eps = 1e-7;
const double pi=acos(-1.0);
const int mod = 1e9+7;
inline int lowbit(int x){return x&(-x);}
ll gcd(ll a,ll b){return b?gcd(b,a%b):a;}
void ex_gcd(ll a,ll b,ll &d,ll &x,ll &y){if(!b){d=a,x=1,y=0;}else{ex_gcd(b,a%b,d,y,x);y-=x*(a/b);}}//x=(x%(b/d)+(b/d))%(b/d);
inline ll qpow(ll a,ll b,ll MOD=mod){ll res=1;a%=MOD;while(b>0){if(b&1)res=res*a%MOD;a=a*a%MOD;b>>=1;}return res;}
inline ll inv(ll x,ll p){return qpow(x,p-2,p);}
inline ll Jos(ll n,ll k,ll s=1){ll res=0;rep(i,1,n+1) res=(res+k)%i;return (res+s)%n;}
inline ll read(){ ll f = 1; ll x = 0;char ch = getchar();while(ch>'9'||ch<'0') {if(ch=='-') f=-1; ch = getchar();}while(ch>='0'&&ch<='9') x = (x<<3) + (x<<1) + ch - '0',  ch = getchar();return x*f; }
int dir[4][2] = { {1,0}, {-1,0},{0,1},{0,-1} };

struct wa
{
    int x,y;
}a[2000];

int n;
double ansx,ansy,answ;

double dis(double x1,double y1,double x2,double y2)
{
    double a=(x1-x2)>0?(x1-x2):(x2-x1);
    double b=(y1-y2)>0?(y1-y2):(y2-y1);
    return a*a*a+b*b*b+a*b;
}

double energy(double x,double y)
{
    double res=0;
    for(int i=1;i<=n;i++)
    {
        res+=dis(x,y,a[i].x,a[i].y);
    }
    return res;
}

void sa()
{
    double t=10000;
    while(t>1e-15)
    {
        double ex=ansx+(rand()*2-RAND_MAX)*t;
        double ey=ansy+(rand()*2-RAND_MAX)*t;
        double ew=energy(ex,ey);
        //cout<<ex<<' '<<ey<<endl;
        double de=ew-answ;
        if(de<0)
        {
            answ=ew;
            ansx=ex;
            ansy=ey;
            //cout<<ansx<<' '<<ansy<<' '<<answ<<endl;
        }
        else if(exp(-de/t)*RAND_MAX>rand())
        {
            ansx=ex;
            ansy=ey;
        }
        t*=0.996;
    }
}

int main()
{
    n=read();
    for(int i=1;i<=n;i++)
    {
        a[i].x=read();
        a[i].y=read();
        ansx+=a[i].x;
        ansy+=a[i].y;
    }
    ansx/=n;
    ansy/=n;
    answ=energy(ansx,ansy);
    //cout<<ansx<<' '<<ansy<<' '<<answ<<endl;
    int ci=20;
    while(ci--)
    {
        sa();
    }
    //while(clock()/CLOCKS_PER_SEC<0.9) sa();
    printf("%.3f %.3f",ansx,ansy);
    return 0;
}

使用的时候务必降低精度才能过oj(ci或者t),很可能是样例有问题。

评论 2
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值