美文网首页
201809-2 买菜(Python实现)

201809-2 买菜(Python实现)

作者: tmax | 来源:发表于2019-11-20 18:10 被阅读0次
    • 62ms
    n =  int(input())
    H = []
    W = []
    
    for i in range(n):
        H.append( list( map(int, input().split()) )  )
    
    for i in range(n):
        W.append( list( map(int, input().split()) )  )
    
    totalTime = 0
    
    def calculateTime(T1, T2):
        if T1[0] <= T2[0] and T1[1] >= T2[0] and T1[1] <=T2[1]:
            return T1[1] - T2[0]
        elif T1[0] >= T2[0] and T2[1] >= T1[0] and T2[1] <= T1[1]:
            return T2[1] - T1[0]
        elif T1[0] <= T2[0] and T1[1] >= T2[1]:
            return T2[1] - T2[0]
        elif T1[0] >= T2[0] and T1[1] <= T2[1]:
            return T1[1] - T1[0]
        else:
            return 0
    i = 0
    j = 0
    while True:
        time = calculateTime(H[i], W[j])
        totalTime += time
        if H[i][1] < W[j][1]:
            i += 1
        else:
            j += 1
    
        if i>=n or j>=n:
            break
    print(totalTime)
    
    

    相关文章

      网友评论

          本文标题:201809-2 买菜(Python实现)

          本文链接:https://www.haomeiwen.com/subject/leqaictx.html