Submission #8527388

---

Source Code Expand

#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
#define USE_LLONG_AS_INT
#ifdef USE_LLONG_AS_INT
#define int long long
#define inf (1ll<<60)
#else
#define inf (1<<30)
#endif
#define rep(i,n) for(int i=0;i<(n);i++)
#define Rep(i,a,b) for(int i=(a);i<(b);i++)
#define REP(i,a,b) for(int i=(a);i<=(b);i++)
#define rev(i,n) for(int i=(n)-1;i>=0;i--)
#define vi vector<int>
#define vvi vector<vi>
#define pb push_back
#define eb emplace_back
#define pi pair<int,int>
#define vp vector<pair<int,int>>
#define mp make_pair
#define all(v) (v).begin(),(v).end()
#define fi first
#define se second
#define MEMSET(a) memset(a,0,sizeof(a))
#define Yes(f) cout<<(f?"Yes":"No")<<endl
#define yes(f) cout<<(f?"yes":"no")<<endl
#define YES(f) cout<<(f?"YES":"NO")<<endl
#define SORT(v) sort(all(v))
#define RSORT(v) sort(all(v), greater<int>())

using namespace std;

const int mod=1e9+7;
const string sp=" ";

void run();

void init() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout<<fixed<<setprecision(12);
}

signed main(){
    init();
    run();
    return 0;
}

bool visited[100];
vvi g;

bool dfs(int v,int p=-1){
    if(visited[v])return false;
    visited[v]=true;
    bool res=true;
    for(int u:g[v]){
        if(u==p)continue;
        res&=dfs(u,v);
    }
    return res;
}

void run(){
    double x,y;
    cin>>x>>y;
    complex<double> p(x,y);
    int n;
    cin>>n;
    vector<complex<double>> a(n);
    rep(i,n){
        double x,y;
        cin>>x>>y;
        a[i]=complex<double>(x,y);
    }
    double ans=inf;
    rep(i,n){
        complex<double> pp=p-a[i];
        complex<double> b=a[(i+1)%n]-a[i];
        pp/=b;
        pp*=abs(b);
        ans=min(ans,abs(pp.imag()));
    }
    cout<<ans<<endl;
}

Submission Info

Judge Result