結果

問題 No.2173 Nightcord
ユーザー chineristACchineristAC
提出日時 2022-12-25 02:35:35
言語 PyPy3
(7.3.15)
結果
RE  
実行時間 -
コード長 3,340 bytes
コンパイル時間 156 ms
コンパイル使用メモリ 82,360 KB
実行使用メモリ 84,172 KB
最終ジャッジ日時 2024-11-18 09:46:08
合計ジャッジ時間 18,341 ms
ジャッジサーバーID
（参考情報） 		judge5 / judge1
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 42 ms
56,852 KB
testcase_01 AC 42 ms
57,272 KB
testcase_02 AC 43 ms
57,216 KB
testcase_03 AC 1,213 ms
81,584 KB
testcase_04 RE -
testcase_05 RE -
testcase_06 RE -
testcase_07 RE -
testcase_08 RE -
testcase_09 RE -
testcase_10 AC 71 ms
77,388 KB
testcase_11 RE -
testcase_12 AC 78 ms
77,948 KB
testcase_13 RE -
testcase_14 RE -
testcase_15 AC 90 ms
77,944 KB
testcase_16 RE -
testcase_17 RE -
testcase_18 AC 75 ms
77,692 KB
testcase_19 RE -
testcase_20 AC 71 ms
77,480 KB
testcase_21 RE -
testcase_22 RE -
testcase_23 AC 81 ms
77,628 KB
testcase_24 RE -
testcase_25 AC 76 ms
77,576 KB
testcase_26 RE -
testcase_27 RE -
testcase_28 AC 85 ms
77,688 KB
testcase_29 RE -
testcase_30 AC 83 ms
77,416 KB
testcase_31 RE -
testcase_32 AC 624 ms
79,540 KB
testcase_33 AC 1,076 ms
81,200 KB
testcase_34 AC 1,156 ms
84,172 KB
testcase_35 AC 614 ms
79,592 KB
testcase_36 AC 716 ms
80,020 KB
testcase_37 AC 1,043 ms
82,432 KB
testcase_38 AC 228 ms
77,808 KB
testcase_39 AC 595 ms
79,836 KB
testcase_40 AC 1,126 ms
83,188 KB
testcase_41 AC 739 ms
79,312 KB
testcase_42 AC 740 ms
80,084 KB
testcase_43 AC 152 ms
77,140 KB
testcase_44 AC 46 ms
58,464 KB
testcase_45 AC 332 ms
77,872 KB
testcase_46 AC 456 ms
78,532 KB
testcase_47 AC 448 ms
78,304 KB
testcase_48 AC 246 ms
77,708 KB
testcase_49 AC 69 ms
73,532 KB
testcase_50 AC 130 ms
77,188 KB
testcase_51 AC 481 ms
78,464 KB
testcase_52 AC 62 ms
72,340 KB
testcase_53 AC 532 ms
78,832 KB
testcase_54 AC 708 ms
79,156 KB
testcase_55 AC 199 ms
77,060 KB
testcase_56 AC 352 ms
77,952 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

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):

    star[0].sort()
    star[1].sort()

    ch = [convex_hull(star[p]) for p in range(2)]
    for p in range(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"
    
    assert False


N,K = mi()
star = [[] for p in range(2)]
for _ in range(N):
    x,y,c = mi()
    star[c-1].append((x,y))

if K == 3:
    print(solve_3(N,K,star))
else:
    print(solve_4(N,K,star))
0