182292025-10-15 06:32:39birozsÁruszállítás (75 pont)python3Time limit exceeded 35/75400ms3484 KiB
N,M = map(int,input().split())
T = []
for _ in range(M):
    A,B = map(int,input().split())
    kozos = False
    for i in range(len(T)):
        if (A <= T[i][0] and B >= T[i][0]) or  (A <= T[i][1] and B >= T[i][1]):
            T[i][0] = min(A,T[i][0])
            T[i][1] = max(B,T[i][1])
            kozos = True
            break
        elif A >= T[i][0] and B <= T[i][1]:
            kozos = True
            break
    if not kozos:
        T.append([A,B])
vegpont = []
for szakasz in T:
    vegpont.append(szakasz[0])
    vegpont.append(szakasz[1])
vegpont.sort()
szakasz = vegpont[0] - 1
for i in range(2,len(vegpont),2):
    szakasz += vegpont[i] - vegpont[i-1]
szakasz += N - vegpont[-1]
print(szakasz)
SubtaskSumTestVerdictTimeMemory
base35/75
1Accepted0/016ms3144 KiB
2Time limit exceeded0/0375ms3376 KiB
3Accepted3/317ms3124 KiB
4Accepted3/317ms3124 KiB
5Accepted3/317ms3124 KiB
6Accepted3/316ms3124 KiB
7Accepted3/316ms2972 KiB
8Accepted4/417ms3124 KiB
9Wrong answer0/417ms3056 KiB
10Wrong answer0/417ms3124 KiB
11Accepted4/417ms3124 KiB
12Wrong answer0/446ms3124 KiB
13Time limit exceeded0/4384ms3296 KiB
14Time limit exceeded0/4386ms3380 KiB
15Time limit exceeded0/4384ms3380 KiB
16Accepted4/443ms3124 KiB
17Accepted4/443ms3136 KiB
18Accepted4/446ms3124 KiB
19Time limit exceeded0/4400ms3380 KiB
20Time limit exceeded0/4384ms3244 KiB
21Time limit exceeded0/4400ms3380 KiB
22Time limit exceeded0/4400ms3484 KiB