Run ID 作者 问题 语言 测评结果 Time Memory 代码长度 提交时间
85549 丁俊杰 校门外的树 Python3 Accepted 84 MS 3848 KB 327 2024-07-17 20:56:05

Tests(10/10):


Code:

L,M=map(int,input().split()) results=[] for _ in range(M): a,b=map(int,input().split()) results.append((a,b)) trees=[False]*(L+1) for start , end in results: for i in range(start,end+1): trees[i]=True count=0 for i in range(L+1): if not trees[i]: count+=1 print(count)