def getSlope(x1, y1, x2, y2): if x1 == x2: return None else: return (y2 - y1, x2- x1) # by = ax + c def getCo(x1, y1, x2, y2): a = y2 - y1 b = x2 - x1 c = (x2-x1)*y1 - (y2-y1)*x1 return (a, b, c) def biggerSlope(a, b): if a[1] < 0: a = [x *-1 for x in a] if b[1] < 0: b = [x*-1 for x in b] if a[0]*b[1] < b[0]*a[1]: return b else: return a def smallerSlope(a, b): if a[1] < 0: a = [x *-1 for x in a] if b[1] < 0: b = [x*-1 for x in b] if a[0]*b[1] >= b[0]*a[1]: return b else: return a def isSlopeASmaller(a, b): if a[1] < 0: a = [x *-1 for x in a] if b[1] < 0: b = [x*-1 for x in b] return a[0]*b[1] < b[0]*a[1] def isBelowLine(co, x, y): if co[1] == 0: return co[1] * y > co[0] * x + co[2] return co[1] * y < co[0] * x + co[2] def isOnline(co, x, y): return co[1] * y == co[0] * x + co[2] def solve(): a,b,c,d = map(int, input().split()) q,w,e,r = map(int, input().split()) if a < c: A = (a,b) B = (c,d) else: B = (a,b) A = (c,d) if q < e: C = (q,w) D = (e,r) else: D = (q,w) C = (e,r) slope1 = getSlope(*A, *B) slope2 = getSlope(*C, *D) slopeCA= getSlope(*A, *C) slopeCB = getSlope(*C, *B) coef1 = getCo(*A, *B) coef2 = getCo(*C, *D) areInDifferentSide = None isSlopeWithinRange = None if B[0] < C[0] or D[0] < A[0]: return False if max(A[1], B[1]) < min(C[1], D[1]) or min(A[1], B[1]) > max(C[1], D[1]): return False if slope1 == slope2: if slope1 == None: return True if slopeCA == None: return False if slopeCA[0] <0: slopeCA = [x * -1 for x in slopeCA] if slope1[0] <0: slope1 = [x * -1 for x in slope1] return slopeCA[0]*slope1[1] == slope1[0]*slopeCA[1] if slope1 != None and isOnline(coef1, *C) and A[0] <= C[0] <= B[0]: return True if slope1 != None and isOnline(coef1, *D) and A[0] <= D[0] <= B[0]: return True if slope2 != None and isOnline(coef2, *A) and C[0] <= A[0] <= D[0]: return True if slope2 != None and isOnline(coef2, *B) and C[0] <= B[0] <= D[0]: return True if slope1 != None and slope2 != None: areInDifferentSide = isBelowLine(coef1, *C) ^ isBelowLine(coef1, *D) if slopeCB!= None and slopeCA!= None: isSlopeWithinRange = (isSlopeASmaller(smallerSlope(slopeCA, slopeCB), slope2) and isSlopeASmaller (slope2, biggerSlope(slopeCA, slopeCB))) if C[1] < min(A[1], B[1]) or C[1] > max(A[1], B[1]) and A[0] <= C[0] <= D[0]: isSlopeWithinRange = not isSlopeWithinRange elif slopeCB != None and slopeCA == None: if isBelowLine(coef1, *C): isSlopeWithinRange = isSlopeASmaller(slopeCB, slope2) else: isSlopeWithinRange= isSlopeASmaller(slope2, slopeCB) elif slopeCB == None and slopeCA != None: if isBelowLine(coef1, *C): isSlopeWithinRange = isSlopeASmaller(slope2, slopeCA) else: isSlopeWithinRange = isSlopeASmaller(slopeCA, slope2) else: isSlopeWithinRange = True elif slope1 == None: areInDifferentSide = isBelowLine(coef1, *C) ^ isBelowLine(coef1, *D) if isBelowLine(coef1, *C): smallSlope = smallerSlope(slopeCA, slopeCB) bigSlope = biggerSlope(slopeCA, slopeCB) left = isSlopeASmaller(smallSlope, slope2) right = isSlopeASmaller(slope2, bigSlope) isSlopeWithinRange = left and right else: isSlopeWithinRange = C[0] == A[0] else: areInDifferentSide = isBelowLine(coef1, *C) ^ isBelowLine(coef1, *D) isSlopeWithinRange = areInDifferentSide return isSlopeWithinRange and areInDifferentSide if solve(): print(1) else: print(0)

제출 #108365

제출 정보

제출 결과

제출 코드

찾은 반례

입력:

오답 출력:

정답 출력:

입력:

오답 출력:

정답 출력:

입력:

오답 출력:

정답 출력: