某岛

… : "…アッカリ～ン . .. . " .. .
August 22, 2013

UVa 12304. 2D Geometry 110 in 1!


计算几何 6 和 1.

http://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&page=show_problem&problem=3726
http://www.cppblog.com/aswmtjdsj/archive/2011/10/17/158526.html


/** Micro Mezz Macro Flation — Overheated Economy ., Last Update: Aug. 20th 2013 **/ //{
/** Header .. **/ //{
#pragma comment(linker, "/STACK:36777216")
//#pragma GCC optimize ("O2")
#define LOCAL
//#include "testlib.h"
#include <functional>
#include <algorithm>
#include <iostream>
#include <fstream>
#include <sstream>
#include <iomanip>
#include <numeric>
#include <cstring>
#include <climits>
#include <cassert>
#include <complex>
#include <cstdio>
#include <string>
#include <vector>
#include <bitset>
#include <queue>
#include <stack>
#include <cmath>
#include <ctime>
#include <list>
#include <set>
#include <map>
//#include <tr1/unordered_set>
//#include <tr1/unordered_map>
//#include <array>
using namespace std;
#define REP(i, n) for (int i=0;i<int(n);++i)
#define FOR(i, a, b) for (int i=int(a);i<int(b);++i)
#define DWN(i, b, a) for (int i=int(b-1);i>=int(a);–i)
#define REP_1(i, n) for (int i=1;i<=int(n);++i)
#define FOR_1(i, a, b) for (int i=int(a);i<=int(b);++i)
#define DWN_1(i, b, a) for (int i=int(b);i>=int(a);–i)
#define REP_C(i, n) for (int n____=int(n),i=0;i<n____;++i)
#define FOR_C(i, a, b) for (int b____=int(b),i=a;i<b____;++i)
#define DWN_C(i, b, a) for (int a____=int(a),i=b-1;i>=a____;–i)
#define REP_N(i, n) for (i=0;i<int(n);++i)
#define FOR_N(i, a, b) for (i=int(a);i<int(b);++i)
#define DWN_N(i, b, a) for (i=int(b-1);i>=int(a);–i)
#define REP_1_C(i, n) for (int n____=int(n),i=1;i<=n____;++i)
#define FOR_1_C(i, a, b) for (int b____=int(b),i=a;i<=b____;++i)
#define DWN_1_C(i, b, a) for (int a____=int(a),i=b;i>=a____;–i)
#define REP_1_N(i, n) for (i=1;i<=int(n);++i)
#define FOR_1_N(i, a, b) for (i=int(a);i<=int(b);++i)
#define DWN_1_N(i, b, a) for (i=int(b);i>=int(a);–i)
#define REP_C_N(i, n) for (int n____=(i=0,int(n));i<n____;++i)
#define FOR_C_N(i, a, b) for (int b____=(i=0,int(b);i<b____;++i)
#define DWN_C_N(i, b, a) for (int a____=(i=b-1,int(a));i>=a____;–i)
#define REP_1_C_N(i, n) for (int n____=(i=1,int(n));i<=n____;++i)
#define FOR_1_C_N(i, a, b) for (int b____=(i=1,int(b);i<=b____;++i)
#define DWN_1_C_N(i, b, a) for (int a____=(i=b,int(a));i>=a____;–i)
#define ECH(it, A) for (__typeof(A.begin()) it=A.begin(); it != A.end(); ++it)
#define REP_S(i, str) for (char*i=str;*i;++i)
#define REP_L(i, hd, nxt) for (int i=hd;i;i=nxt[i])
#define REP_G(i, u) REP_L(i,hd[u],suc)
#define REP_SS(x, s) for (int x=s;x;x=(x-1)&s)
#define DO(n) for ( int ____n = n; ____n–>0; )
#define REP_2(i, j, n, m) REP(i, n) REP(j, m)
#define REP_2_1(i, j, n, m) REP_1(i, n) REP_1(j, m)
#define REP_3(i, j, k, n, m, l) REP(i, n) REP(j, m) REP(k, l)
#define REP_3_1(i, j, k, n, m, l) REP_1(i, n) REP_1(j, m) REP_1(k, l)
#define REP_4(i, j, k, ii, n, m, l, nn) REP(i, n) REP(j, m) REP(k, l) REP(ii, nn)
#define REP_4_1(i, j, k, ii, n, m, l, nn) REP_1(i, n) REP_1(j, m) REP_1(k, l) REP_1(ii, nn)
#define ALL(A) A.begin(), A.end()
#define LLA(A) A.rbegin(), A.rend()
#define CPY(A, B) memcpy(A, B, sizeof(A))
#define INS(A, P, B) A.insert(A.begin() + P, B)
#define ERS(A, P) A.erase(A.begin() + P)
#define BSC(A, x) (lower_bound(ALL(A), x) – A.begin())
#define CTN(T, x) (T.find(x) != T.end())
#define SZ(A) int((A).size())
#define PB push_back
#define MP(A, B) make_pair(A, B)
#define PTT pair<T, T>
#define rTs return*this
#define fi first
#define se second
#define re real()
#define im imag()
#define Rush for(int ____T=RD(); ____T–;)
#define Display(A, n, m) { \
REP(i, n){ \
REP(j, m-1) cout << A[i][j] << " "; \
cout << A[i][m-1] << endl; \
} \
}
#define Display_1(A, n, m) { \
REP_1(i, n){ \
REP_1(j, m-1) cout << A[i][j] << " "; \
cout << A[i][m] << endl; \
} \
}
string __file__(){
string res = __FILE__;
int r = SZ(res) – 1; while (res[r] != '.') –r;
int l = r – 1; while (res[l] != '\\') –l; ++l;
return res.substr(l, r-l);
}
void Exec(string a, string b, string c){
if (b.empty()) b = __file__();
string cmd = a + ' ' + b + '.' + c;
system(cmd.c_str());
}
void Ruby(string file = ""){Exec("ruby", file, "rb");}
void Python(string file = ""){Exec("python", file, "py");}
void Haskell(string file = ""){Exec("runghc", file, "hs");}
void Pascal(string file = ""){Exec("pascal", file, "pas");}
void Ocaml(string file = ""){Exec("ocaml", file, "ml");}
typedef long long LL;
//typedef long double DB;
typedef double DB;
typedef unsigned UINT;
typedef unsigned long long ULL;
typedef vector<int> VI;
typedef vector<char> VC;
typedef vector<string> VS;
typedef vector<LL> VL;
typedef vector<DB> VF;
typedef set<int> SI;
typedef set<string> SS;
typedef map<int, int> MII;
typedef map<string, int> MSI;
typedef pair<int, int> PII;
typedef pair<LL, LL> PLL;
typedef vector<PII> VII;
typedef vector<VI> VVI;
typedef vector<VII> VVII;
template<class T> inline T& RD(T &);
template<class T> inline void OT(const T &);
//inline int RD(){int x; return RD(x);}
inline LL RD(){LL x; return RD(x);}
inline DB& RF(DB &);
inline DB RF(){DB x; return RF(x);}
inline char* RS(char *s);
inline char& RC(char &c);
inline char RC();
inline char& RC(char &c){scanf(" %c", &c); return c;}
inline char RC(){char c; return RC(c);}
//inline char& RC(char &c){c = getchar(); return c;}
//inline char RC(){return getchar();}
template<class T> inline T& RDD(T &);
inline LL RDD(){LL x; return RDD(x);}
template<class T0, class T1> inline T0& RD(T0 &x0, T1 &x1){RD(x0), RD(x1); return x0;}
template<class T0, class T1, class T2> inline T0& RD(T0 &x0, T1 &x1, T2 &x2){RD(x0), RD(x1), RD(x2); return x0;}
template<class T0, class T1, class T2, class T3> inline T0& RD(T0 &x0, T1 &x1, T2 &x2, T3 &x3){RD(x0), RD(x1), RD(x2), RD(x3); return x0;}
template<class T0, class T1, class T2, class T3, class T4> inline T0& RD(T0 &x0, T1 &x1, T2 &x2, T3 &x3, T4 &x4){RD(x0), RD(x1), RD(x2), RD(x3), RD(x4); return x0;}
template<class T0, class T1, class T2, class T3, class T4, class T5> inline T0& RD(T0 &x0, T1 &x1, T2 &x2, T3 &x3, T4 &x4, T5 &x5){RD(x0), RD(x1), RD(x2), RD(x3), RD(x4), RD(x5); return x0;}
template<class T0, class T1, class T2, class T3, class T4, class T5, class T6> inline T0& RD(T0 &x0, T1 &x1, T2 &x2, T3 &x3, T4 &x4, T5 &x5, T6 &x6){RD(x0), RD(x1), RD(x2), RD(x3), RD(x4), RD(x5), RD(x6); return x0;}
template<class T0, class T1> inline void OT(const T0 &x0, const T1 &x1){OT(x0), OT(x1);}
template<class T0, class T1, class T2> inline void OT(const T0 &x0, const T1 &x1, const T2 &x2){OT(x0), OT(x1), OT(x2);}
template<class T0, class T1, class T2, class T3> inline void OT(const T0 &x0, const T1 &x1, const T2 &x2, const T3 &x3){OT(x0), OT(x1), OT(x2), OT(x3);}
template<class T0, class T1, class T2, class T3, class T4> inline void OT(const T0 &x0, const T1 &x1, const T2 &x2, const T3 &x3, const T4 &x4){OT(x0), OT(x1), OT(x2), OT(x3), OT(x4);}
template<class T0, class T1, class T2, class T3, class T4, class T5> inline void OT(const T0 &x0, const T1 &x1, const T2 &x2, const T3 &x3, const T4 &x4, const T5 &x5){OT(x0), OT(x1), OT(x2), OT(x3), OT(x4), OT(x5);}
template<class T0, class T1, class T2, class T3, class T4, class T5, class T6> inline void OT(const T0 &x0, const T1 &x1, const T2 &x2, const T3 &x3, const T4 &x4, const T5 &x5, const T6 &x6){OT(x0), OT(x1), OT(x2), OT(x3), OT(x4), OT(x5), OT(x6);}
inline char& RC(char &a, char &b){RC(a), RC(b); return a;}
inline char& RC(char &a, char &b, char &c){RC(a), RC(b), RC(c); return a;}
inline char& RC(char &a, char &b, char &c, char &d){RC(a), RC(b), RC(c), RC(d); return a;}
inline char& RC(char &a, char &b, char &c, char &d, char &e){RC(a), RC(b), RC(c), RC(d), RC(e); return a;}
inline char& RC(char &a, char &b, char &c, char &d, char &e, char &f){RC(a), RC(b), RC(c), RC(d), RC(e), RC(f); return a;}
inline char& RC(char &a, char &b, char &c, char &d, char &e, char &f, char &g){RC(a), RC(b), RC(c), RC(d), RC(e), RC(f), RC(g); return a;}
inline DB& RF(DB &a, DB &b){RF(a), RF(b); return a;}
inline DB& RF(DB &a, DB &b, DB &c){RF(a), RF(b), RF(c); return a;}
inline DB& RF(DB &a, DB &b, DB &c, DB &d){RF(a), RF(b), RF(c), RF(d); return a;}
inline DB& RF(DB &a, DB &b, DB &c, DB &d, DB &e){RF(a), RF(b), RF(c), RF(d), RF(e); return a;}
inline DB& RF(DB &a, DB &b, DB &c, DB &d, DB &e, DB &f){RF(a), RF(b), RF(c), RF(d), RF(e), RF(f); return a;}
inline DB& RF(DB &a, DB &b, DB &c, DB &d, DB &e, DB &f, DB &g){RF(a), RF(b), RF(c), RF(d), RF(e), RF(f), RF(g); return a;}
inline void RS(char *s1, char *s2){RS(s1), RS(s2);}
inline void RS(char *s1, char *s2, char *s3){RS(s1), RS(s2), RS(s3);}
template<class T0,class T1>inline void RDD(T0&a, T1&b){RDD(a),RDD(b);}
template<class T0,class T1,class T2>inline void RDD(T0&a, T1&b, T2&c){RDD(a),RDD(b),RDD(c);}
template<class T> inline void RST(T &A){memset(A, 0, sizeof(A));}
template<class T> inline void FLC(T &A, int x){memset(A, x, sizeof(A));}
template<class T> inline void CLR(T &A){A.clear();}
template<class T> inline T& SRT(T &A){sort(ALL(A)); return A;}
//}
/** Constant List .. **/ //{
const int MOD = int(1e9) + 7;
//int MOD = 99990001;
const int INF = 0x3f3f3f3f;
const LL INFF = 0x3f3f3f3f3f3f3f3fLL;
const DB EPS = 1e-9;
const DB OO = 1e20;
const DB PI = acos(-1.0); //M_PI;
const int dx[] = {-1, 0, 1, 0};
const int dy[] = {0, 1, 0, -1};
//}
/** Add On .. **/ //{
// <<= '0. Nichi Joo ., //{
template<class T> inline void checkMin(T &a,const T b){if (b<a) a=b;}
template<class T> inline void checkMax(T &a,const T b){if (a<b) a=b;}
template<class T> inline void checkMin(T &a, T &b, const T x){checkMin(a, x), checkMin(b, x);}
template<class T> inline void checkMax(T &a, T &b, const T x){checkMax(a, x), checkMax(b, x);}
template <class T, class C> inline void checkMin(T& a, const T b, C c){if (c(b,a)) a = b;}
template <class T, class C> inline void checkMax(T& a, const T b, C c){if (c(a,b)) a = b;}
template<class T> inline T min(T a, T b, T c){return min(min(a, b), c);}
template<class T> inline T max(T a, T b, T c){return max(max(a, b), c);}
template<class T> inline T min(T a, T b, T c, T d){return min(min(a, b), min(c, d));}
template<class T> inline T max(T a, T b, T c, T d){return max(max(a, b), max(c, d));}
template<class T> inline T sqr(T a){return a*a;}
template<class T> inline T cub(T a){return a*a*a;}
template<class T> inline T ceil(T x, T y){return (x – 1) / y + 1;}
inline int sgn(DB x){return x < -EPS ? -1 : x > EPS;}
inline int sgn(DB x, DB y){return sgn(x – y);}
inline DB cos(DB a, DB b, DB c){return (sqr(a)+sqr(b)-sqr(c))/(2*a*b);}
inline DB cot(DB x){return 1./tan(x);};
inline DB sec(DB x){return 1./cos(x);};
inline DB csc(DB x){return 1./sin(x);};
//}
// <<= '1. Bitwise Operation ., //{
namespace BO{
inline bool _1(int x, int i){return bool(x&1<<i);}
inline bool _1(LL x, int i){return bool(x&1LL<<i);}
inline LL _1(int i){return 1LL<<i;}
inline LL _U(int i){return _1(i) – 1;};
inline int reverse_bits(int x){
x = ((x >> 1) & 0x55555555) | ((x << 1) & 0xaaaaaaaa);
x = ((x >> 2) & 0x33333333) | ((x << 2) & 0xcccccccc);
x = ((x >> 4) & 0x0f0f0f0f) | ((x << 4) & 0xf0f0f0f0);
x = ((x >> 8) & 0x00ff00ff) | ((x << 8) & 0xff00ff00);
x = ((x >>16) & 0x0000ffff) | ((x <<16) & 0xffff0000);
return x;
}
inline LL reverse_bits(LL x){
x = ((x >> 1) & 0x5555555555555555LL) | ((x << 1) & 0xaaaaaaaaaaaaaaaaLL);
x = ((x >> 2) & 0x3333333333333333LL) | ((x << 2) & 0xccccccccccccccccLL);
x = ((x >> 4) & 0x0f0f0f0f0f0f0f0fLL) | ((x << 4) & 0xf0f0f0f0f0f0f0f0LL);
x = ((x >> 8) & 0x00ff00ff00ff00ffLL) | ((x << 8) & 0xff00ff00ff00ff00LL);
x = ((x >>16) & 0x0000ffff0000ffffLL) | ((x <<16) & 0xffff0000ffff0000LL);
x = ((x >>32) & 0x00000000ffffffffLL) | ((x <<32) & 0xffffffff00000000LL);
return x;
}
template<class T> inline bool odd(T x){return x&1;}
template<class T> inline bool even(T x){return !odd(x);}
template<class T> inline T low_bit(T x) {return x & -x;}
template<class T> inline T high_bit(T x) {T p = low_bit(x);while (p != x) x -= p, p = low_bit(x);return p;}
template<class T> inline T cover_bit(T x){T p = 1; while (p < x) p <<= 1;return p;}
template<class T> inline int cover_idx(T x){int p = 0; while (_1(p) < x ) ++p; return p;}
inline int clz(int x){return __builtin_clz(x);}
inline int clz(LL x){return __builtin_clzll(x);}
inline int ctz(int x){return __builtin_ctz(x);}
inline int ctz(LL x){return __builtin_ctzll(x);}
inline int lg2(int x){return !x ? -1 : 31 – clz(x);}
inline int lg2(LL x){return !x ? -1 : 63 – clz(x);}
inline int low_idx(int x){return !x ? -1 : ctz(x);}
inline int low_idx(LL x){return !x ? -1 : ctz(x);}
inline int high_idx(int x){return lg2(x);}
inline int high_idx(LL x){return lg2(x);}
inline int parity(int x){return __builtin_parity(x);}
inline int parity(LL x){return __builtin_parityll(x);}
inline int count_bits(int x){return __builtin_popcount(x);}
inline int count_bits(LL x){return __builtin_popcountll(x);}
} using namespace BO;//}
// <<= '9. Comutational Geometry .,//{
namespace CG{
struct Po; struct Line; struct Seg;
typedef const Po&cPo; typedef const Line&cLine; typedef const Seg&cSeg;
typedef vector<Po> VP;
struct Po{
DB x,y;Po(DB x=0,DB y=0):x(x),y(y){}
void in(){RF(x,y);}void out(){printf("(%.2f,%.2f)",x,y);}
inline friend istream&operator>>(istream&i,Po&p){return i>>p.x>>p.y;}
inline friend ostream&operator<<(ostream&o,Po p){return o<<"("<<p.x<<", "<<p.y<< ")";}
Po operator-()const{return Po(-x,-y);}
Po&operator+=(cPo p){x+=p.x,y+=p.y;rTs;}Po&operator-=(cPo p){x-=p.x,y-=p.y;rTs;}
Po&operator*=(DB k){x*=k,y*=k;rTs;}Po&operator/=(DB k){x/=k,y/=k;rTs;}
Po operator+(cPo p)const{return Po(x+p.x,y+p.y);}Po operator-(cPo p)const{return Po(x-p.x,y-p.y);}
Po operator*(DB k)const{return Po(x*k,y*k);}Po operator/(DB k)const{return Po(x/k,y/k);}
Po operator*(cPo p)const{return Po(x*p.x-y*p.y,y*p.x+x*p.y);}Po operator/(cPo p)const{return Po(x*p.x+y*p.y,y*p.x-x*p.y)/p.len2();}
bool operator==(cPo p)const{return!sgn(x,p.x)&&!sgn(y,p.y);};bool operator!=(cPo p)const{return sgn(x,p.x)||sgn(y,p.y);}
bool operator<(cPo p)const{return sgn(x,p.x)<0||!sgn(x,p.x)&&sgn(y,p.y)<0;}bool operator<=(cPo p)const{return sgn(x,p.x)<0||!sgn(x,p.x)&&sgn(y,p.y)<=0;}
bool operator>(cPo p)const{return!(*this<=p);}bool operator >=(cPo p)const{return!(*this<p);}
DB len2()const{return sqr(x)+sqr(y);}DB len()const{return sqrt(len2());}DB arg()const{return atan2(y,x);}
Po&_1(){rTs/=len();}Po&conj(){y=-y;rTs;}Po&lt(){swap(x,y),x=-x;rTs;}Po&rt(){swap(x,y),y=-y;rTs;}
Po&rot(DB a,cPo o=Po()){x-=o.x,y-=o.y;rTs=Po(x*cos(a)-y*sin(a),y*cos(a)+x*sin(a))+o;}
};
inline DB dot(const DB &x1, const DB &y1, const DB &x2, const DB &y2){return x1 * x2 + y1 * y2;}
inline DB dot(const Po &a, const Po &b){return dot(a.x, a.y, b.x, b.y);}
inline DB dot(const Po &p0, const Po &p1, const Po &p2){return dot(p1 – p0, p2 – p0);}
inline DB det(const DB &x1, const DB &y1, const DB &x2, const DB &y2){return x1 * y2 – x2 * y1;}
inline DB det(const Po &a, const Po &b){return det(a.x, a.y, b.x, b.y);}
inline DB det(const Po &p0, const Po &p1, const Po &p2){return det(p1 – p0, p2 – p0);}
inline DB ang(cPo p0,cPo p1){return acos(dot(p0,p1)/p0.len()/p1.len());}
inline DB ang(cPo p0,cPo p1,cPo p2){return ang(p1-p0,p2-p0);}
inline DB ang(cPo p0,cPo p1,cPo p2,cPo p3){return ang(p1-p0,p3-p2);}
inline DB dist2(const DB &x, const DB &y){return sqr(x) + sqr(y);}
inline DB dist2(const DB &x, const DB &y, const DB &z){return sqr(x) + sqr(y) + sqr(z);}
inline DB dist2(const Po &a, const Po &b){return dist2(a.x – b.x, a.y – b.y);}
template<class T1, class T2> inline int dett(const T1 &x, const T2 &y){return sgn(det(x, y));}
template<class T1, class T2, class T3> inline int dett(const T1 &x, const T2 &y, const T3 &z){return sgn(det(x, y, z));}
template<class T1, class T2, class T3, class T4> inline int dett(const T1 &x, const T2 &y, const T3 &z, const T4 &w){return sgn(det(x, y, z, w));}
template<class T1, class T2> inline int dott(const T1 &x, const T2 &y){return sgn(dot(x, y));}
template<class T1, class T2, class T3> inline int dott(const T1 &x, const T2 &y, const T3 &z){return sgn(dot(x, y, z));}
template<class T1, class T2, class T3, class T4> inline int dott(const T1 &x, const T2 &y, const T3 &z, const T4 &w){return sgn(dot(x, y, z, w));}
template<class T1, class T2> inline DB arg(const T1 &x, const T2 &y){DB a=ang(x,y);return~dett(x,y)?a:2*PI-a;}
template<class T1, class T2, class T3> inline DB arg(const T1 &x, const T2 &y, const T3 &z){DB a=ang(x,y,z);return~dett(x,y,z)?a:2*PI-a;}
template<class T1, class T2, class T3, class T4> inline DB arg(const T1 &x, const T2 &y, const T3 &z, const T4 &w){DB a=ang(x,y,z,w);return~dett(x,y,z,w)?a:2*PI-a;}
template<class T1, class T2> inline DB dist(const T1 &x, const T2 &y){return sqrt(dist2(x, y));}
template<class T1, class T2, class T3> inline DB dist(const T1 &x, const T2 &y, const T3 &z){return sqrt(dist2(x, y, z));}
inline Po _1(Po p){return p._1();}inline Po conj(Po p){return p.conj();}
inline Po lt(Po p){return p.lt();}inline Po rt(Po p){return p.rt();}
inline Po rot(Po p,DB a,cPo o=Po()){return p.rot(a,o);}
inline Po operator *(DB k,cPo p){return p*k;}
inline Po operator /(DB k,cPo p){return conj(p)*k/p.len2();}
struct Line{
Po a,b;Line(cPo a=Po(),cPo b=Po()):a(a),b(b){}
Line(DB x0,DB y0,DB x1,DB y1):a(Po(x0,y0)),b(Po(x1,y1)){}
Line(cLine l):a(l.a),b(l.b){}
//Ax+By+C=0
Line(DB A,DB B,DB C){
C=-C;if(!::sgn(A))a=Po(0,C/B),b=Po(1,C/B);
else if(!::sgn(B))a=Po(C/A,0),b=Po(C/A,1);
else a=Po(0,C/B),b=Po(1,(C-A)/B);
}
void in(){a.in(),b.in();}
inline friend istream&operator>>(istream&i,Line& p){return i>>p.a>>p.b;}
inline friend ostream&operator<<(ostream&o,Line p){return o<<p.a<<"-"<< p.b;}
Line operator+(cPo x)const{return Line(a+x,b+x);}
Line operator-(cPo x)const{return Line(a-x,b-x);}
Line operator*(DB k)const{return Line(a*k,b*k);}
Line operator/(DB k)const{return Line(a/k,b/k);}
Po operator*(cLine)const;
Po d()const{return b-a;}DB len2()const{return d().len2();}DB len()const{return d().len();}DB arg()const{return d().arg();}
int sgn(cPo p)const{return dett(a, b, p);}
int sgn(cLine)const;
bool sameSgn(cPo p1,cPo p2)const{return sgn(p1)==sgn(p2);}
void getEquation(DB&K,DB&B)const{
K = ::sgn(a.x, b.x) ? (b.y-a.y)/(b.x-a.x) : OO;
B = a.y – K*a.x;
}
void getEquation(DB&A,DB&B,DB&C)const{A=a.y-b.y,B=b.x-a.x,C=det(a, b);}
Line&push(DB r){ // 正数右手螺旋向里
Po v=d()._1().lt()*r;a+=v,b+=v; rTs;
}
};
inline DB dot(cLine l1,cLine l2){return dot(l1.d(),l2.d());}
inline DB dot(cLine l,cPo p){return dot(l.a,l.b,p);}
inline DB dot(cPo p,cLine l){return dot(p,l.a,l.b);}
inline DB det(cLine l1,cLine l2){return det(l1.d(),l2.d());}
inline DB det(cLine l,cPo p){return det(l.a,l.b,p);}
inline DB det(cPo p,cLine l){return det(p,l.a,l.b);}
inline DB ang(cLine l0,cLine l1){return ang(l0.d(),l1.d());}
inline DB ang(cLine l,cPo p){return ang(l.a,l.b,p);}
inline DB ang(cPo p,cLine l){return ang(p,l.a,l.b);}
inline int Line::sgn(cLine l)const{return dett(*this, l);}
inline Po Line::operator*(cLine l)const{return a+d()*det(a,l)/det(*this,l);}
inline Po operator&(cPo p,cLine l){return l*Line(p,p+l.d().lt());}
inline Po operator%(cPo p,cLine l){return p&l*2-p;}
inline Line push(Line l, DB r){return l.push(r);}
struct Seg: public Line{
Seg(cPo a=Po(),cPo b=Po()):Line(a,b){}
Seg(DB x0,DB y0,DB x1,DB y1):Line(x0,y0,x1,y1){}
Seg(cLine l):Line(l){}
Seg(const Po &a,DB alpha):Line(a,alpha){}
Seg(DB A,DB B,DB C):Line(A,B,C){}
inline int sgn(cPo p)const;
inline bool qrt(cSeg l)const;
inline int sgn(cSeg l)const;
};
// quick_rejection_test
inline bool Seg::qrt(cSeg l)const{
return min(a.x,b.x)<=max(l.a.x,l.b.x)&&min(l.a.x,l.b.x)<=max(a.x,b.x)&&
min(a.y,b.y)<=max(l.a.y,l.b.y)&&min(l.a.y,l.b.y)<=max(a.y,b.y);
}
// -1不相交 0相交（不规范） 1相交（规范）
inline int Seg::sgn(cSeg l)const{
if (!qrt(l)) return -1;
/*return
(dett(a,b,l.a)*dett(a,b,l.b)<=0 &&
dett(l.a,l.b,a)*dett(l.a,l.b,b)<=0)?1:-1;*/
int d1=dett(a,b,l.a),d2=dett(a,b,l.b),d3=dett(l.a,l.b,a),d4=dett(l.a,l.b,b);
if ((d1^d2)==-2&&(d3^d4)==-2)return 1;
return ((!d1&&dott(l.a-a,l.a-b)<=0)||(!d2&&dott(l.b-a,l.b-b)<=0)||
(!d3&&dott(a-l.a,a-l.b)<=0)||(!d4&&dott(b-l.a,b-l.b)<=0))?0:-1;
}
inline int Seg::sgn(cPo p)const{return -dott(p,a,b);}
inline DB dist2(cLine l,cPo p){return sqr(fabs(det(l.d(), p-l.a)))/l.len2();}
inline DB dist2(cLine l1,cLine l2){return dett(l1,l2)?0:dist2(l1,l2.a);}
inline DB dist2(cSeg l,cPo p){
Po v0 = l.b – l.a, v1 = p – l.a, v2 = p – l.b;
if (sgn(dot(v0, v1)) * sgn(dot(v0, v2)) <= 0) return dist2(Line(l),p);
else return min(v1.len2(), v2.len2());
}
inline DB dist2(cSeg l1,cLine l2){
Po v0 = l2.b-l2.a, v1=l1.a-l2.a,v2=l1.b-l2.a;DB c1=det(v0,v1),c2=det(v0,v2);
return sgn(c1)!=sgn(c2) ? 0 : sqr(min(fabs(c1), fabs(c2)))/v0.len2();
}
inline DB dist2(cSeg l1,cSeg l2){
if (l1.sgn(l2)) return 0;
else return min(dist2(l2,l1.a), dist2(l2,l1.b), dist2(l1,l2.a), dist2(l1,l2.b));
}
struct Triangle; struct Circle;
typedef const Triangle&cTriangle; typedef const Circle&cCircle;
const int Disjoint = -2, Exscribe = -1, Cross = 0, Inscribe = 1, Contain = 2;
Po getX3(cPo a, cPo b, cPo c){ // 外接圆圆心
Po v0=b-a,v1=c-a;DB l0=v0.len2(),l1=v1.len2(),d=2*det(a,b,c);
return Po(l0*v1.y-l1*v0.y,l1*v0.x-l0*v1.x)/d+a;
//Po v0 = b-a, v1 = c-a, m0 = (a+b)/2, m1 = (a+c)/2;
//return Line(m0,m0+v0.lt())*Line(m1,m1+v1.lt());
}
Po getX4(cPo a, cPo b, cPo c){ // 垂心
return Line(a,a&Line(b,c))*Line(b,b&Line(a,c));
}
struct Circle{
Po o; DB r; Circle(cPo o=Po(),DB r=0):o(o),r(r){}
// 外接圆
Circle(cPo a,cPo b){
o = (a+b)/2, r = dist(a,b)/2;
}
Circle(cPo a,cPo b,cPo c){
o = getX3(a,b,c), r = dist(o,a);
}
void in(){RF(o.x, o.y, r);}
void out(){
printf("%.2f %.2f %.2f\n", o.x, o.y, r);
}
bool operator <(cCircle c)const{return r<c.r;}
//-1相离 0圆上 1包含
inline int sgn(cPo p)const{return ::sgn(r*r, dist2(o, p));}
//-1相离 0相切 1包含
inline int sgn(cLine l)const{return ::sgn(r*r, dist2(l, o));}
// -2外离 -1外切 0相交 1内切 2包含
inline int sgn(cCircle c)const{
DB d=dist2(o,c.o);
if (::sgn(sqr(r+c.r),d)<0) return Disjoint;
if (!::sgn(sqr(r+c.r), d)) return Exscribe;
if (!::sgn(sqr(r-c.r), d)) return Inscribe;
if (::sgn(sqr(r-c.r), d)>0) return Contain;
return Cross;
}
inline DB s(){return PI*sqr(r);}
inline DB p(){return 2*PI*r;}
inline Po operator^(cCircle c)const{return Po(det(Po(o.x,r),Po(c.o.x,c.r)),det(Po(o.y,r),Po(c.o.y,c.r)))/(c.r-r);}
inline void getIntersect(cLine l,Po&p0,Po&p1)const{
Po m = o&l, d = (l.b-l.a)._1() * sqrt(sqr(r)-dist2(l, o));
p0 = m + d, p1 = m – d;
}
inline void getIntersect(cCircle c,Po&p0,Po&p1)const{
Po v=(c.o-o)._1()*r;DB a=acos(cos(r,dist(o,c.o),c.r));
p0=o+rot(v,a),p1=o+rot(v,-a);
}
inline void getTangency(cPo p,Po&p0,Po&p1)const{
DB d=dist(o,p),a=acos(r/d);Po v=(p-o)._1()*r;
p0=o+rot(v,a),p1=o+rot(v,-a);
}
};
struct Triangle{
Po A,B,C; DB a,b,c; DB alpha,beta,theta;
DB r,R; DB S,P; Po I,G,O,H;
void init(){
S=fabs(det(A,B,C))/2,a=dist(B,C),b=dist(A,C),c=dist(A,B);
alpha=acos(cos(b,c,a)),beta=acos(cos(a,c,b)),theta=acos(cos(a,b,c));
P=a+b+c,R=(a*b*c)/(4*S),r=2*S/P;
I=Po(a*A.x+b*B.x+c*C.x,a*A.y+b*B.y+c*C.y)/P;
G=(A+B+C)/3,O=getX3(A,B,C),H=getX4(A,B,C);
//DB s=P/2; assert(!sgn(S, sqrt(s*(s-a)*(s-b)*(s-c)))); // 海伦公式
//assert(!sgn(dist(I,O), sqrt(R*(R-2*r))));
//assert(!sgn(dist(H,G), dist(O,H)*2/3));
}
void in(){
A.in(),B.in(),C.in();init();
}
};
Po getPo(){Po p;p.in();return p;}
Line getLine(){Line l;l.in();return l;}
DB getArea(const VP& P){DB z=0;FOR(i,1,SZ(P))z+=det(P[i-1],P[i]);return z;}
DB getPeri(const VP& P){DB z=0;FOR(i,1,SZ(P))z+=dist(P[i-1],P[i]);return z;}
VP getConvexHull(VP& P){ //逆时针，无共线
int n=SZ(P);if(n<=3)return P.PB(P[0]),P;
SRT(P); VP C; C.resize(n+9); int nn = -1; REP(i, n){ //#
while (nn > 0 && dett(C[nn-1], C[nn], P[i]) <= 0) –nn; //#
C[++nn] = P[i];
}
int _nn = nn; DWN(i, n-1, 0){
while (nn > _nn && dett(C[nn-1], C[nn], P[i]) <= 0) –nn; //#
C[++nn] = P[i];
}
C.resize(nn+1);
return C;
}
// …
} using namespace CG;//}
//}
/** I/O Accelerator Interface .. **/ //{
#define g (c=getchar())
#define d isdigit(g)
#define p x=x*10+c-'0'
#define n x=x*10+'0'-c
#define pp l/=10,p
#define nn l/=10,n
template<class T> inline T& RD(T &x){
char c;while(!d);x=c-'0';while(d)p;
return x;
}
template<class T> inline T& RDD(T &x){
char c;while(g,c!='-'&&!isdigit(c));
if (c=='-'){x='0'-g;while(d)n;}
else{x=c-'0';while(d)p;}
return x;
}
inline DB& RF(DB &x){
//scanf("%lf", &x);
char c;while(g,c!='-'&&c!='.'&&!isdigit(c));
if(c=='-')if(g=='.'){x=0;DB l=1;while(d)nn;x*=l;}
else{x='0'-c;while(d)n;if(c=='.'){DB l=1;while(d)nn;x*=l;}}
else if(c=='.'){x=0;DB l=1;while(d)pp;x*=l;}
else{x=c-'0';while(d)p;if(c=='.'){DB l=1;while(d)pp;x*=l;}}
return x;
}
#undef nn
#undef pp
#undef n
#undef p
#undef d
#undef g
inline char* RS(char *s){
//gets(s);
scanf("%s", s);
return s;
}
LL last_ans; int Case; template<class T> inline void OT(const T &x){
printf("Case %d: ", ++Case);
//printf("%lld\n", x);
printf("%.2f\n", x/PI * 180);
//printf("%d\n", x);
//cout << x << endl;
//last_ans = x;
}
//}
//}/* …………………………………………………………………………………………………………………. */
char cmd[1009];
DB toD(DB x){
if (x<0) x += PI;
return x/PI*180;
}
int main()
{
#ifndef ONLINE_JUDGE
freopen("in.txt", "r", stdin);
//freopen("out.txt", "w", stdout);
#endif
while(~scanf("%s", cmd)){
if(!strcmp(cmd, "CircumscribedCircle")){
Triangle T; T.in();
printf("(%.6f,%.6f,%.6f)\n", T.O.x,T.O.y,T.R);
}
else if(!strcmp(cmd, "InscribedCircle")){
Triangle T; T.in();
printf("(%.6f,%.6f,%.6f)\n", T.I.x,T.I.y,T.r);
}
else if(!strcmp(cmd, "TangentLineThroughPoint")){
Circle c; c.in(); Po p; p.in();
int t = c.sgn(p);
if (t>0) puts("[]");
else if (!t){
Po v = p – c.o; v.lt();
printf("[%.6f]\n", toD(v.arg()));
}
else{
Po p0, p1; c.getTangency(p, p0, p1);
Po v0 = p0 – c.o, v1 = p1 – c.o; v0.lt(), v1.lt();
DB d0 = toD(v0.arg()), d1 = toD(v1.arg()); if (d0 > d1) swap(d0, d1);
printf("[%.6f,%.6f]\n", d0, d1);
}
}
else if(!strcmp(cmd, "CircleThroughAPointAndTangentToALineWithRadius")){
Po p; Line l; p.in(), l.in(); DB r; RF(r); DB d = dist(l, p);
if (sgn(d, 2*r) > 0) puts("[]");
else if (!sgn(d, 2*r)){
Po p0 = (p+(p&l))/2;
printf("[(%.6f,%.6f)]\n",p0.x,p0.y);
}
else{
Circle c(p, r);
//l.push(r); if (!sgn(d+r, dist(l, p))) l.push(-2*r);
if (!dett(l, p)) l = Line(p, p+l.d().lt());
else l.push(~dett(l, p)?r:-r);
Po p0, p1; c.getIntersect(l, p0, p1); if (p0 > p1) swap(p0, p1);
printf("[(%.6f,%.6f),(%.6f,%.6f)]\n", p0.x, p0.y, p1.x,p1.y);
}
}
else if(!strcmp(cmd, "CircleTangentToTwoLinesWithRadius")){
Line l0, l1; l0.in(), l1.in(); DB r; RF(r);
Line l00 = push(l0, r), l01 = push(l0, -r);
Line l10 = push(l1, r), l11 = push(l1, -r);
VP P; P.PB(l00*l10), P.PB(l00*l11), P.PB(l01*l10), P.PB(l01*l11);
SRT(P); putchar('['); REP(i, 4){
printf("(%.6f,%.6f)",P[i].x,P[i].y);
if (i == 3) puts("]"); else putchar(',');
}
}
else if(!strcmp(cmd, "CircleTangentToTwoDisjointCirclesWithRadius")){
Circle c0, c1; c0.in(), c1.in(); DB r; RF(r);
c0.r += r, c1.r += r; int t = c0.sgn(c1);
if (t == -2) puts("[]");
else if (t == -1){
Po p0; c0.getIntersect(c1, p0, p0);
printf("[(%.6f,%.6f)]\n",p0.x,p0.y);
}
else {
Po p0, p1; c0.getIntersect(c1, p0, p1); if (p0 > p1) swap(p0, p1);
printf("[(%.6f,%.6f),(%.6f,%.6f)]\n", p0.x, p0.y, p1.x,p1.y);
}
}
}
}

view raw

12304.cpp

hosted with ❤ by GitHub

Posted by xiaodao
Category: UVa

« | »

  • Archives

    open all | close all