結果

問題 No.635 自然門松列
コンテスト
ユーザー ei1333333
提出日時 2018-01-19 23:06:42
言語 C++17
(gcc 13.3.0 + boost 1.87.0)
結果
WA  
実行時間 -
コード長 3,552 bytes
コンパイル時間 2,260 ms
コンパイル使用メモリ 198,644 KB
最終ジャッジ日時 2025-01-05 07:43:21
ジャッジサーバーID
（参考情報） 		judge3 / judge5
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 1
other AC * 5 WA * 18
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include <bits/stdc++.h>

using namespace std;

using int64 = long long;
const int64 INF = 1LL << 62;

int main()
{
  int N;
  cin >> N;
  while(N--) {
    double x[3], y[3];
    cin >> x[0] >> x[1] >> x[2];
    cin >> y[0] >> y[1] >> y[2];

    if(x[0] != x[2] || y[0] != y[2]) {
      bool flag = false;
      flag |= y[2] < y[1] && y[0] < y[1] && x[1] <= x[2] && x[0] * (y[1] - y[2]) <= x[2] * (y[1] - y[0]) + x[1] * (y[0] - y[2]);
      flag |= y[2] < y[1] && y[0] < y[1] && x[1] <= x[2] && x[0] * (y[1] - y[2]) > x[2] * (y[1] - y[0]) + x[1] * (y[0] - y[2]);
      flag |= y[2] < y[1] && y[0] < y[1] && x[1] > x[2] && x[0] >= x[1];
      flag |= y[2] < y[1] && y[0] == y[1] && x[1] <= x[2] && x[0] < x[1];
      flag |= y[2] < y[1] && y[0] == y[1] && x[1] > x[2] && x[0] < x[1];
      flag |= y[2] < y[1] && y[0] > y[1] && x[1] <= x[2] && x[0] * (y[1] - y[2]) < x[2] * (y[1] - y[0]) + x[1] * (y[0] - y[2]);
      flag |= y[2] < y[1] && y[0] > y[1] && x[1] > x[2] && x[0] < x[1];
      flag |= y[1] == y[2] && y[0] < y[1] && x[1] > x[2] && x[0] < x[1];
      flag |= y[1] == y[2] && y[0] < y[1] && x[1] > x[2] && x[0] >= x[1];
      flag |= y[1] == y[2] && y[0] == y[1] && x[1] > x[2] && x[0] < x[1];
      flag |= y[1] == y[2] && y[0] > y[1] && x[1] > x[2] && x[0] < x[1];
      flag |= y[2] > y[1] && y[0] < y[1] && x[1] > x[2] && x[0] < x[1];
      flag |= y[2] > y[1] && y[0] < y[1] && x[1] > x[2] && x[1] <= x[0] && x[0] * (y[2] - y[1]) < -x[1] * y[0] + x[2] * y[0] - x[2] * y[1] + x[1] * y[2];
      flag |= y[2] > y[1] && y[0] == y[1] && x[1] > x[2] && x[0] < x[1];
      flag |= y[2] > y[1] && y[0] > y[1] && x[1] > x[2] && x[0] * (y[1] - y[2]) <= x[2] * (y[1] - y[0]) + x[1] * (y[0] - y[2]);
      flag |= y[2] > y[1] && y[0] > y[1] && x[1] > x[2] && -x[1] * y[0] + x[2] * y[0] - x[2] * y[1] + x[1] * y[2] < x[0] * (y[2] - y[1]) && x[0] < x[1];

      if(flag) {
        puts("YES");
        continue;
      }

      flag |= y[2] < y[1] && y[0] < y[1] && x[1] < x[2] && x[1] < x[0] && x[0] * (y[2] - y[1]) < -x[1] * y[0] + x[2] * y[0] - x[2] * y[1] + x[1] * y[2];
      flag |= y[2] < y[1] && y[0] < y[1] && x[1] < x[2] && x[0] * (y[1] - y[2]) >= x[2] * (y[1] - y[0]) + x[1] * (y[0] - y[2]);
      flag |= y[2] < y[1] && y[0] == y[1] && x[1] < x[2] && x[0] > x[1];
      flag |= y[2] < y[1] && x[1] < x[2] && -x[1] * y[0] + x[2] * y[0] - x[2] * y[1] + x[1] * y[2] < x[0] * (y[2] - y[1]) && x[0] <= x[1];
      flag |= y[2] < y[1] && y[0] > y[1] && x[1] < x[2] && x[0] > x[1];
      flag |= y[1] == y[2] && y[0] < y[1] && x[1] < x[2] && x[0] > x[1];
      flag |= y[1] == y[2] && y[0] == y[1] && x[1] < x[2] && x[0] > x[1];
      flag |= y[1] == y[2] && y[0] > y[1] && x[1] < x[2] && x[0] <= x[1];
      flag |= y[1] == y[2] && y[0] > y[1] && x[1] < x[2] && x[0] > x[1];
      flag |= y[2] > y[1] && y[0] < y[1] && x[1] < x[2] && x[0] > x[1];
      flag |= y[2] > y[1] && y[0] < y[1] && x[1] >= x[2] && x[0] * (y[1] - y[2]) > x[2] * (y[1] - y[0]) + x[1] * (y[0] - y[2]);
      flag |= y[2] > y[1] && y[0] == y[1] && x[1] < x[2] && x[0] > x[1];
      flag |= y[2] > y[1] && y[0] == y[1] && x[1] >= x[2] && x[0] > x[1];
      flag |= y[2] > y[1] && y[0] > y[1] && x[1] < x[2] && x[0] <= x[1];
      flag |= y[2] > y[1] && y[0] > y[1] && x[1] >= x[2] && x[0] * (y[1] - y[2]) < x[2] * (y[1] - y[0]) + x[1] * (y[0] - y[2]);
      flag |= y[2] > y[1] && y[0] > y[1] && x[1] >= x[2] && x[0] * (y[1] - y[2]) >= x[2] * (y[1] - y[0]) + x[1] * (y[0] - y[2]);

      if(flag) {
        puts("YES");
        continue;
      }
    }
    puts("NO");
  }

}
0