Submission #454600

---

Source Code Expand

#include <bits/stdc++.h>

typedef long long ll;
typedef unsigned long long ull;

#define FOR(i,a,b) for(int (i)=(a);i<(b);i++)
#define REP(i,n) FOR(i,0,n)
#define RANGE(vec) (vec).begin(),(vec).end()

using namespace std;

template<typename T>
struct Pt {
    T x, y;
    Pt(T x0, T y0) : x(x0), y(y0) {}
    Pt() :x(0),y(0) {}

    const Pt operator-(const Pt &other) const { return Pt(other.x-x, other.y-y); }
    double norm(void) const { return hypot(x, y); }

    // class method
    static double cross(const Pt &a, const Pt &b) { return ((double)a.y*b.x - (double)a.x*b.y); }
};
class B {
public:
    void solve(void) {
            int x,y;
            cin>>x>>y;
            int N;
            cin>>N;
            vector<Pt<double>> points;
            double ans=(1<<30);
            REP(i,N)
            {
                int x0,y0;
                cin>>x0>>y0;
                points.emplace_back(x0,y0);
                ans = min(ans, hypot(x-x0,y-y0));
            }
            REP(i,N)
            {
                double dist = (points[i]-points[(i+1)%N]).norm();
                double area = abs(Pt<double>::cross(points[(i+1)%N]-points[i], Pt<double>(x,y)-points[i]));
                ans = min(ans, area/dist);
            }
            cout<<setprecision(20)<<ans<<endl;
    }
};

#if 1
int main(int argc, char *argv[])
{
        ios::sync_with_stdio(false);
        auto obj = new B();
        obj->solve();
        delete obj;
        return 0;
}
#endif

Submission Info

Judge Result