Submission #2529956

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;

typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll,ll> P;
typedef vector<ll> Vec;
typedef vector<Vec> DVec;
typedef vector<DVec> TVec;
typedef priority_queue<P, vector<P>, greater<P>> PQ;

#define fi                first
#define se                second
#define pb                push_back
#define INF               LLONG_MAX/3
#define MOD               1000000007
#define bcnt              __builtin_popcount
#define all(x)            (x).begin(),(x).end()
#define srt(x)            sort(all(x))
#define rvs(x)            reverse(all(x))
#define uni(x)            x.erase(unique(all(x)),x.end())
#define ub(x,y)           (upper_bound(all(x),y)-x.begin())
#define lb(x,y)           (lower_bound(all(x),y)-x.begin())
#define rep(i,n)          repl(i,0,n-1)
#define mkp(x,y)          make_pair(x,y)
#define mmax(x,y)         (x>y?x:y)
#define mmin(x,y)         (x<y?x:y)
#define maxch(x,y)        x=mmax(x,y)
#define minch(x,y)        x=mmin(x,y)
#define exist(x,y)        (find(all(x),y)!=x.end())
#define each(itr,v)       for(auto itr:v)
#define repl(i,a,b)       for(ll i=(ll)(a);i<=(ll)(b);i++)
#define dvec(n1,n2,i)     DVec(n1,Vec(n2,i))
#define tvec(n1,n2,n3,i)  TVec(n1,dvec(n2,n3,i))
ll x, y;
ll N;
Vec px(10), py(10);
double ans = 1000000000;

int main() {
  cin.sync_with_stdio(false);
  cin >> x >> y;
  cin >> N;
  rep(i,N) cin >> px[i] >> py[i];
  rep(i,N) {
    double l1 = sqrt(pow(x-px[i],2) + pow(y-py[i],2));
    double l2 = sqrt(pow(x-px[(i+1)%N],2) + pow(y-py[(i+1)%N],2));
    double l3 = sqrt(pow(px[i]-px[(i+1)%N],2) + pow(py[i]-py[(i+1)%N],2));
    double s = (l1 + l2 + l3) / 2;
    double S = sqrt(s*(s-l1)*(s-l2)*(s-l3));
    double v = S * 2 / l3;
    ans = min({ans, l1, l2, v});
  }
  cout << setprecision(10) << ans << endl;
  return 0;
}

Submission Info

Judge Result