結果
問題 | No.2173 Nightcord |
ユーザー | chineristAC |
提出日時 | 2022-12-25 02:50:38 |
言語 | PyPy3 (7.3.15) |
結果 |
RE
|
実行時間 | - |
コード長 | 3,486 bytes |
コンパイル時間 | 162 ms |
コンパイル使用メモリ | 82,688 KB |
実行使用メモリ | 78,592 KB |
最終ジャッジ日時 | 2024-04-29 08:23:28 |
合計ジャッジ時間 | 5,433 ms |
ジャッジサーバーID (参考情報) |
judge1 / judge3 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | RE | - |
testcase_01 | AC | 41 ms
56,448 KB |
testcase_02 | RE | - |
testcase_03 | RE | - |
testcase_04 | RE | - |
testcase_05 | RE | - |
testcase_06 | RE | - |
testcase_07 | RE | - |
testcase_08 | RE | - |
testcase_09 | RE | - |
testcase_10 | RE | - |
testcase_11 | RE | - |
testcase_12 | RE | - |
testcase_13 | RE | - |
testcase_14 | RE | - |
testcase_15 | RE | - |
testcase_16 | WA | - |
testcase_17 | RE | - |
testcase_18 | RE | - |
testcase_19 | RE | - |
testcase_20 | RE | - |
testcase_21 | RE | - |
testcase_22 | RE | - |
testcase_23 | RE | - |
testcase_24 | RE | - |
testcase_25 | RE | - |
testcase_26 | RE | - |
testcase_27 | RE | - |
testcase_28 | RE | - |
testcase_29 | RE | - |
testcase_30 | RE | - |
testcase_31 | RE | - |
testcase_32 | RE | - |
testcase_33 | RE | - |
testcase_34 | RE | - |
testcase_35 | RE | - |
testcase_36 | RE | - |
testcase_37 | RE | - |
testcase_38 | RE | - |
testcase_39 | RE | - |
testcase_40 | RE | - |
testcase_41 | RE | - |
testcase_42 | RE | - |
testcase_43 | RE | - |
testcase_44 | RE | - |
testcase_45 | RE | - |
testcase_46 | RE | - |
testcase_47 | RE | - |
testcase_48 | RE | - |
testcase_49 | RE | - |
testcase_50 | RE | - |
testcase_51 | RE | - |
testcase_52 | RE | - |
testcase_53 | RE | - |
testcase_54 | RE | - |
testcase_55 | RE | - |
testcase_56 | RE | - |
ソースコード
import sys,random,bisect from collections import deque,defaultdict,Counter from heapq import heapify,heappop,heappush from itertools import cycle, permutations from math import log,gcd input = lambda :sys.stdin.readline().rstrip() mi = lambda :map(int,input().split()) li = lambda :list(mi()) def cross3(a, b, c): return (b[0]-a[0])*(c[1]-a[1]) - (b[1]-a[1])*(c[0]-a[0]) # ps = [(x, y), ...]: ソートされた座標list def convex_hull(ps): qs = [] N = len(ps) for p in ps: # 一直線上で高々2点にする場合は ">=" にする while len(qs) > 1 and cross3(qs[-1], qs[-2], p) > 0: qs.pop() qs.append(p) t = len(qs) for i in range(N-2, -1, -1): p = ps[i] while len(qs) > t and cross3(qs[-1], qs[-2], p) > 0: qs.pop() qs.append(p) return qs # O(N) def inside_convex_polygon0(p0, qs): L = len(qs) D = [cross3(qs[i-1], p0, qs[i]) for i in range(L)] return all(e >= 0 for e in D) or all(e <= 0 for e in D) # O(log N) def inside_convex_polygon(p0, qs): L = len(qs) left = 1; right = L q0 = qs[0] while left+1 < right: mid = (left + right) >> 1 if cross3(q0, p0, qs[mid]) <= 0: left = mid else: right = mid if left == L-1: left -= 1 qi = qs[left]; qj = qs[left+1] v0 = cross3(q0, qi, qj) v1 = cross3(q0, p0, qj) v2 = cross3(q0, qi, p0) if v0 < 0: v1 = -v1; v2 = -v2 return 0 <= v1 and 0 <= v2 and v1 + v2 <= v0 # 線分同士の交点判定 def dot3(O, A, B): ox, oy = O; ax, ay = A; bx, by = B return (ax - ox) * (bx - ox) + (ay - oy) * (by - oy) def cross3(O, A, B): ox, oy = O; ax, ay = A; bx, by = B return (ax - ox) * (by - oy) - (bx - ox) * (ay - oy) def dist2(A, B): ax, ay = A; bx, by = B return (ax - bx) ** 2 + (ay - by) ** 2 def is_intersection(P0, P1, Q0, Q1): C0 = cross3(P0, P1, Q0) C1 = cross3(P0, P1, Q1) D0 = cross3(Q0, Q1, P0) D1 = cross3(Q0, Q1, P1) if C0 == C1 == 0: E0 = dot3(P0, P1, Q0) E1 = dot3(P0, P1, Q1) if not E0 < E1: E0, E1 = E1, E0 return E0 <= dist2(P0, P1) and 0 <= E1 return C0 * C1 <= 0 and D0 * D1 <= 0 def solve_3(N,K,star): for p in range(2): for x,y in star[p]: S = set() for xx,yy in star[p^1]: xx,yy = xx-x,yy-y g = gcd(xx,yy) xx,yy = xx//g,yy//g if (-xx,-yy) in S: return "Yes" S.add((xx,yy)) return "No" def solve_4(N,K,star): if solve_3(N,K,star) == "Yes": return "Yes" star[0].sort() star[1].sort() ch = [convex_hull(star[p]) for p in range(2)] for p in range(2): if len(star[p^1]) > 2: for i in range(len(ch[p])-1): x,y = ch[p][i] if inside_convex_polygon((x,y),ch[p^1]): return "Yes" if len(star[p]) == 2: a,b = star[p][0],star[p][1] for i in range(len(ch[p^1])-1): c,d = ch[p^1][i],ch[p^1][i+1] if is_intersection(a,b,c,d): return "Yes" return "No" N,K = mi() star = [[] for p in range(2)] for _ in range(N): x,y,c = mi() star[c-1].append((x,y)) assert len(star[0])==1 or len(star[1])==1 if K == 3: print(solve_3(N,K,star)) else: print(solve_4(N,K,star))