結果

問題 No.622 点と三角柱の内外判定
コンテスト
ユーザー しらっ亭
提出日時 2017-12-22 00:39:01
言語 C++14
(gcc 13.3.0 + boost 1.87.0)
結果
AC  
実行時間 2 ms / 1,500 ms
コード長 6,986 bytes
コンパイル時間 1,173 ms
コンパイル使用メモリ 118,348 KB
実行使用メモリ 6,820 KB
最終ジャッジ日時 2024-12-17 23:03:30
合計ジャッジ時間 2,075 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge3
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
other AC * 32
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include <iostream>
#include <algorithm>
#include <bitset>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#include <array>
#include <unordered_map>
#include <complex>
#include <deque>
#include <cassert>
#include <cmath>
#include <functional>
#include <iomanip>
#include <chrono>
#include <random>
#include <numeric>
#include <tuple>
#include <cstring>
using namespace std;

#define forr(x,arr) for(auto&& x:arr)
#define _overload3(_1,_2,_3,name,...) name
#define _rep2(i,n) _rep3(i,0,n)
#define _rep3(i,a,b) for(int i=int(a);i<int(b);++i)
#define rep(...) _overload3(__VA_ARGS__,_rep3,_rep2,)(__VA_ARGS__)
#define _rrep2(i,n) _rrep3(i,0,n)
#define _rrep3(i,a,b) for(int i=int(b)-1;i>=int(a);i--)
#define rrep(...) _overload3(__VA_ARGS__,_rrep3,_rrep2,)(__VA_ARGS__)
#define all(x) (x).begin(),(x).end()
#define bit(n) (1LL<<(n))
#define sz(x) ((int)(x).size())
#define TEN(n) ((ll)(1e##n))
#define fst first
#define snd second

string DBG_DLM(int &i){return(i++==0?"":", ");}
#define DBG_B(exp){int i=0;os<<"{";{exp;}os<<"}";return os;}
template<class T>ostream&operator<<(ostream&os,vector<T>v);
template<class T>ostream&operator<<(ostream&os,set<T>v);
template<class T>ostream&operator<<(ostream&os,queue<T>q);
template<class T>ostream&operator<<(ostream&os,priority_queue<T>q);
template<class T,class K>ostream&operator<<(ostream&os,pair<T,K>p);
template<class T,class K>ostream&operator<<(ostream&os,map<T,K>mp);
template<class T,class K>ostream&operator<<(ostream&os,unordered_map<T,K>mp);
template<int I,class TPL>void DBG(ostream&os,TPL t){}
template<int I,class TPL,class H,class...Ts>void DBG(ostream&os,TPL t){os<<(I==0?"":", ")<<get<I>(t);DBG<I+1,TPL,Ts...>(os,t);}
template<class T,class K>void DBG(ostream&os,pair<T,K>p,string delim){os<<"("<<p.first<<delim<<p.second<<")";}
template<class...Ts>ostream&operator<<(ostream&os,tuple<Ts...>t){os<<"(";DBG<0,tuple<Ts...>,Ts...>(os,t);os<<")";return os;}
template<class T,class K>ostream&operator<<(ostream&os,pair<T,K>p){DBG(os,p,", ");return os;}
template<class T>ostream&operator<<(ostream&os,vector<T>v){DBG_B(forr(t,v){os<<DBG_DLM(i)<<t;});}
template<class T>ostream&operator<<(ostream&os,set<T>s){DBG_B(forr(t,s){os<<DBG_DLM(i)<<t;});}
template<class T>ostream&operator<<(ostream&os,queue<T>q){DBG_B(for(;q.size();q.pop()){os<<DBG_DLM(i)<<q.front();});}
template<class T>ostream&operator<<(ostream&os,priority_queue<T>q){DBG_B(for(;q.size();q.pop()){os<<DBG_DLM(i)<<q.top();});}
template<class T,class K>ostream&operator<<(ostream&os,map<T,K>m){DBG_B(forr(p,m){os<<DBG_DLM(i);DBG(os,p,"->");});}
template<class T,class K>ostream&operator<<(ostream&os,unordered_map<T,K>m){DBG_B(forr(p,m){os<<DBG_DLM(i);DBG(os,p,"->");});}
#define DBG_OVERLOAD(_1,_2,_3,_4,_5,_6,macro_name,...)macro_name
#define DBG_LINE(){char s[99];sprintf(s,"line:%3d | ",__LINE__);cerr<<s;}
#define DBG_OUTPUT(v){cerr<<(#v)<<"="<<(v);}
#define DBG1(v,...){DBG_OUTPUT(v);}
#define DBG2(v,...){DBG_OUTPUT(v);cerr<<", ";DBG1(__VA_ARGS__);}
#define DBG3(v,...){DBG_OUTPUT(v);cerr<<", ";DBG2(__VA_ARGS__);}
#define DBG4(v,...){DBG_OUTPUT(v);cerr<<", ";DBG3(__VA_ARGS__);}
#define DBG5(v,...){DBG_OUTPUT(v);cerr<<", ";DBG4(__VA_ARGS__);}
#define DBG6(v,...){DBG_OUTPUT(v);cerr<<", ";DBG5(__VA_ARGS__);}
#define DEBUG0(){DBG_LINE();cerr<<endl;}
#ifdef LOCAL
#define out(...){DBG_LINE();DBG_OVERLOAD(__VA_ARGS__,DBG6,DBG5,DBG4,DBG3,DBG2,DBG1)(__VA_ARGS__);cerr<<endl;}
#else
#define out(...)
#endif

using ll=long long;
using pii=pair<int,int>;using pll=pair<ll,ll>;using pil=pair<int,ll>;using pli=pair<ll,int>;
using vs=vector<string>;using vvs=vector<vs>;using vvvs=vector<vvs>;
using vb=vector<bool>;using vvb=vector<vb>;using vvvb=vector<vvb>;
using vi=vector<int>;using vvi=vector<vi>;using vvvi=vector<vvi>;
using vl=vector<ll>;using vvl=vector<vl>;using vvvl=vector<vvl>;
using vd=vector<double>;using vvd=vector<vd>;using vvvd=vector<vvd>;
using vpii=vector<pii>;using vvpii=vector<vpii>;using vvvpii=vector<vvpii>;
template<class A,class B>bool amax(A&a,const B&b){return b>a?a=b,1:0;}
template<class A,class B>bool amin(A&a,const B&b){return b<a?a=b,1:0;}
ll ri(){ll l;cin>>l;return l;} string rs(){string s;cin>>s;return s;}

namespace geom3d {
  using T = double;

  struct P3D {
    T x, y, z;
    P3D() : x(0), y(0), z(0) {};
    P3D(T x, T y, T z) : x(x), y(y), z(z) {};

    P3D operator+(const P3D &b) const {
      const P3D &a = *this;
      P3D ret(a.x + b.x, a.y + b.y, a.z + b.z);
      return ret;
    }

    P3D operator-(const P3D &b) const {
      const P3D &a = *this;
      P3D ret(a.x - b.x, a.y - b.y, a.z - b.z);
      return ret;
    }

    P3D operator-() const {
      const P3D &a = *this;
      P3D ret(-a.x, -a.y, -a.z);
      return ret;
    }

    P3D operator*(const T &d) const {
      const P3D &a = *this;
      const P3D ret(a.x * d, a.y * d, a.z * d);
      return ret;
    }

    P3D operator/(const T &d) const {
      const P3D &a = *this;
      const P3D ret(a.x / d, a.y / d, a.z / d);
      return ret;
    }

    /**
     * 内積
     */
    T operator*(const P3D &b) const {
      const P3D &a = *this;
      return a.x * b.x + a.y * b.y + a.z * b.z;
    }

    /**
     * 外積
     */
    P3D operator^(const P3D &b) const {
      const P3D &a = *this;
      P3D ret(a.y * b.z - a.z * b.y, a.z * b.x - a.x * b.z, a.x * b.y - a.y * b.x);
      return ret;
    }
  };

  struct Plane {
    P3D h;
    T d;
    Plane(const P3D &i, const P3D &j, const P3D &k) {
      P3D ij = i - j;
      P3D ik = i - k;
      h = ij ^ ik;
      d = -h.x * i.x - h.y * i.y - h.z * i.z;
    }
  };

  /**
   * 平面との距離
   */
  T distanceP(const P3D &p, const Plane &pl) {
    const P3D &h = pl.h;
    T si = fabs(h.x * p.x + h.y * p.y + h.z * p.z + pl.d);
    T bo = sqrt(h.x * h.x + h.y * h.y + h.z * h.z);
    return si / bo;
  }

  /**
   * 平面との距離
   */
  T distanceP(const P3D &p, const P3D &a, const P3D &b, const P3D &c) {
    return distanceP(p, Plane(a, b, c));
  }
}

using namespace geom3d;

bool sol(P3D a, P3D b, P3D c, P3D d) {

	Plane plane(a, b, c);
	double dp = distanceP(d, plane);

	P3D hou = plane.h;

	double hlen = sqrt(hou.x * hou.x + hou.y * hou.y + hou.z * hou.z);
	out(hlen);

	hou.x /= hlen;
	hou.y /= hlen;
	hou.z /= hlen;

	out(hou.x, hou.y, hou.z);

	d.x -= hou.x * dp;
	d.y -= hou.y * dp;
	d.z -= hou.z * dp;

	out(d.x, d.y, d.z);

	P3D ab = b - a;
	P3D bc = c - b;
	P3D ca = a - c;
	P3D ad = d - a;
	P3D bd = d - b;
	P3D cd = d - c;

	P3D abd = ab ^ bd;
	P3D bcd = bc ^ cd;
	P3D cad = ca ^ ad;

	double dot1 = abd * bcd;
	double dot2 = abd * cad;

	return dot1 > 0 && dot2 > 0;
}

void Main() {
	P3D a(ri(), ri(), ri());
	P3D b(ri(), ri(), ri());
	P3D c(ri(), ri(), ri());
	P3D d(ri(), ri(), ri());

	if (sol(a, b, c, d) || sol(a, c, b, d)) {
		cout << "YES" << endl;
	}
	else {
		cout << "NO" << endl;
	}
}

signed main() {
	cin.tie(nullptr);
	ios::sync_with_stdio(false);
	Main();
	return 0;
}
0