Submission #2525860

---

Source Code Expand

#include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <utility>
#include <cmath>
#include <iomanip>
#include <queue>
#include <map>
#include <set>
#include <random>
#include <sstream>
#include <stack>
#include <deque>

using namespace std;

#define REP(i,a,b) for(int i=a;i<b;i++)
#define rep(i,n) REP(i,0,n)

typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<ll> vl;

int x, y;
int N;
int px[10], py[10];
double ans = 1000000000;

int main() {
    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});
    }
    printf("%.10f\n", ans);
    return 0;
}

Submission Info

Judge Result