182582025-10-16 17:06:03birozsLeghosszabb béke (75 pont)python3Wrong answer 0/75300ms3920 KiB
N,M = map(int,input().split())
T = [0] * (N + 1)
for i in range(M):
    A,B = map(int,input().split())
    for i in range(A,B+1):
        T[i] += 1
print(T)
beke = 0
hossz = 0
for i in range(1,N):
    if T[i] == 0:
        hossz += 1
    else:
        if hossz > beke:
            beke = hossz
            kezdet = i - hossz
            hossz = 0
if hossz > beke:
    beke = hossz
    kezdet = N -hossz
if hossz == 0:
    print(-1)
else:
    print(beke,kezdet)
SubtaskSumTestVerdictTimeMemory
base0/75
1Wrong answer0/016ms3124 KiB
2Time limit exceeded0/0272ms3888 KiB
3Wrong answer0/316ms3112 KiB
4Wrong answer0/316ms3124 KiB
5Wrong answer0/316ms3324 KiB
6Wrong answer0/317ms3124 KiB
7Wrong answer0/317ms3120 KiB
8Wrong answer0/416ms3124 KiB
9Wrong answer0/420ms3156 KiB
10Wrong answer0/463ms3252 KiB
11Time limit exceeded0/4284ms3208 KiB
12Time limit exceeded0/4300ms3276 KiB
13Time limit exceeded0/4300ms3280 KiB
14Time limit exceeded0/4273ms3124 KiB
15Time limit exceeded0/4282ms3124 KiB
16Time limit exceeded0/4300ms3124 KiB
17Time limit exceeded0/4280ms3380 KiB
18Time limit exceeded0/4282ms3380 KiB
19Time limit exceeded0/4284ms3920 KiB
20Time limit exceeded0/4300ms3892 KiB
21Time limit exceeded0/4300ms3892 KiB
22Time limit exceeded0/4280ms3716 KiB