Submission #8530267

---

Source Code Expand

#include <bits/stdc++.h>
#define fi first
#define se second
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define drep(i,n) for(int i = (n)-1; i >= 0; --i)
#define srep(i,s,t) for (int i = s; i < t; ++i)
#define rng(a) a.begin(),a.end()
#define sz(x) (int)(x).size()
#define uni(x) x.erase(unique(rng(x)),x.end())
#define show(x) cout<<#x<<" = "<<x<<endl;
#define PQ(T) priority_queue<T,v(T),greater<T> >
#define newline puts("")
#define v(T) vector<T>
#define vv(T) v(v(T))
using namespace std;
typedef long long int ll;
typedef pair<int,int> P;
typedef set<int> S;
typedef queue<int> Q;
typedef queue<P> QP;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<ll> vl;
typedef vector<P> vp;
const ll LINF = 1001002003004005006ll;
const int INF = 1001001001;
const int MOD = 1000000007;
  
int main() {
  int x,y;
  cin >> x >> y;
  int N;
  cin >> N;
  vp xy(N);
  rep(i,N) {
    int a,b;
    cin >> a >> b;
    xy[i] = P(a,b);
  }
  double ans = INF;
  rep(i,N) {
    int x1 = xy[i].first;
    int x2 = xy[(i+1)%N].first;
    int y1 = xy[i].second;
    int y2 = xy[(i+1)%N].second;
    double dis;
    if(y1 > y2) {
      swap(x1,x2);
      swap(y1,y2);
    }
    if(x1-x2 == 0) {
      if(y1 <= y && y <= y2) {
        dis = 1.0 * abs(x-x1);
      } else if(y < y1) {
        dis = 1.0 * sqrt((x-x1)*(x-x1)+(y-y1)*(y-y1));
      } else if(y > y2) {
        dis = 1.0 * sqrt((x-x1)*(x-x1)+(y-y2)*(y-y2));
      }
    } else {
      double a = (double)(y2-y1)/(double)(x2-x1);
      double b = -1;
      double c = -1.0 * a * x1 + y1;
      dis = 1.0 * abs(a * x + b * y + c) / sqrt(a*a+b*b);
    }
    ans = min(ans,dis);
  }
  cout << setprecision(16) << ans << endl;
  return 0;
}

Submission Info

Judge Result