182782025-10-17 06:13:48birozsLeghosszabb béke (75 pont)python3Time limit exceeded 6/75300ms3892 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
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 beke == 0:
    print(-1)
else:
    print(beke,kezdet)
SubtaskSumTestVerdictTimeMemory
base6/75
1Accepted0/016ms3320 KiB
2Time limit exceeded0/0275ms3884 KiB
3Accepted3/316ms3108 KiB
4Accepted3/316ms2992 KiB
5Wrong answer0/314ms3124 KiB
6Wrong answer0/314ms3116 KiB
7Wrong answer0/316ms3056 KiB
8Wrong answer0/416ms3124 KiB
9Wrong answer0/419ms3112 KiB
10Wrong answer0/464ms3124 KiB
11Time limit exceeded0/4291ms3124 KiB
12Time limit exceeded0/4300ms3252 KiB
13Time limit exceeded0/4287ms3124 KiB
14Time limit exceeded0/4284ms3124 KiB
15Time limit exceeded0/4282ms3184 KiB
16Time limit exceeded0/4300ms3312 KiB
17Time limit exceeded0/4289ms3380 KiB
18Time limit exceeded0/4280ms3380 KiB
19Time limit exceeded0/4280ms3892 KiB
20Time limit exceeded0/4300ms3636 KiB
21Time limit exceeded0/4300ms3892 KiB
22Time limit exceeded0/4277ms3892 KiB