Submission #1068861

---

Source Code Expand

#include <algorithm>
#include <cassert>
#include <cfloat>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <deque>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <tuple>
#include <vector>

#define FOR(i,k,n) for (int (i)=(k); (i)<(n); ++(i))
#define rep(i,n) FOR(i,0,n)
#define pb push_back
#define all(v) begin(v), end(v)
#define debug(x) cerr<< #x <<": "<<x<<endl
#define debug2(x,y) cerr<< #x <<": "<< x <<", "<< #y <<": "<< y <<endl

using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<vector<int> > vvi;
typedef vector<ll> vll;
typedef vector<vector<ll> > vvll;
template<class T> using vv=vector<vector< T > >;

int main() {
  ll x, y;
  scanf("%lld %lld", &x, &y);
  int n;
  scanf("%d", &n);
  vll x_(n), y_(n);
  rep (i, n) {
    scanf("%lld %lld", &x_[i], &y_[i]);
  }
  double ans = 1000;
  rep (i, n) {
    ll x0 = x_[i];
    ll y0 = y_[i];
    ll x1 = x_[(i+1)%n];
    ll y1 = y_[(i+1)%n];

    ll la2 = (x - x0) * (x - x0) + (y - y0) * (y - y0);
    ll lb2 = (x - x1) * (x - x1) + (y - y1) * (y - y1);
    ll lc2 = (x0 - x1) * (x0 - x1) + (y0 - y1) * (y0 - y1);

    if (la2 + lc2 - lb2 < 0 || lb2 + lc2 - la2 < 0) {
      ans = min(ans, sqrt(la2));
      ans = min(ans, sqrt(lb2));
    }

    double a = y1 - y0;
    double b = x0 - x1;
    double c = x0 * (y0 - y1) + y0 * (x1 - x0);

    ans = min(ans, abs(a * x + b * y + c) / sqrt(a*a + b*b));
  }
  printf("%.9f\n", ans);

  return 0;
}

Submission Info

Judge Result