qq_44866969的博客

#include<bits/stdc++.h>#define x first #define y secondusing namespace std;typedef pair<double,double> pdd;const int N=40010;const double pi=acos(-1);int n,cnt;pdd q[N];int stk[N],top;bool used[N];pdd rotate(pdd a,double b){ retu.

#include<bits/stdc++.h>#define x first #define y secondusing namespace std;typedef pair<double,double> pdd;const int N=10010;int n;pdd q[N];int stk[N];bool used[N];double get_dist(pdd a,pdd b){ double dx=a.x-b.x; double dy=a.y-b..

#include<bits/stdc++.h>#define x first#define y secondusing namespace std;typedef pair<double,double> pdd;const int N=210;const double eps=1e-8;int n;pdd q[N],a[N],b[N];int sign(double x){ if(fabs(x)<eps) return 0; if(x<0) ret.

#include<bits/stdc++.h>#define ll long long#define x first #define y secondusing namespace std;typedef pair<ll,ll> pll;const int N=5010;int n,m;pll a[N],b[N];int ans[N];ll cross(ll x1,ll y1,ll x2,ll y2){ return x1*y2-x2*y1;}ll are.

#define ll long longstruct Point{ int x,y;}p[N];Point ch[N];bool cmp(Point x,Point y){ return x.x<y.x||(x.x==y.x&&x.y<y.y);//x从小到大排序，如果x相同则y从小到大排序}int Cross(Point x,Point y,Point z){ ll x1=x.x-y.x; ll y1=x.y-y.y; ll x2.