182812025-10-17 11:09:01birozsLeghosszabb béke (75 pont)python3Time limit exceeded 27/75300ms4088 KiB
N,M = map(int,input().split())
T = [0] * (N + 1)
for _ 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+1):
    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 + 1
if beke == 0:
    print(-1)
else:
    print(beke,kezdet)
SubtaskSumTestVerdictTimeMemory
base27/75
1Accepted0/016ms3312 KiB
2Time limit exceeded0/0282ms4076 KiB
3Accepted3/316ms2888 KiB
4Accepted3/316ms3096 KiB
5Accepted3/316ms3124 KiB
6Accepted3/316ms3324 KiB
7Accepted3/316ms3140 KiB
8Accepted4/416ms3112 KiB
9Accepted4/419ms3080 KiB
10Accepted4/465ms3168 KiB
11Time limit exceeded0/4282ms3124 KiB
12Time limit exceeded0/4300ms3256 KiB
13Time limit exceeded0/4287ms3124 KiB
14Time limit exceeded0/4282ms3124 KiB
15Time limit exceeded0/4280ms3124 KiB
16Time limit exceeded0/4300ms3252 KiB
17Time limit exceeded0/4300ms3380 KiB
18Time limit exceeded0/4289ms3380 KiB
19Time limit exceeded0/4277ms3888 KiB
20Time limit exceeded0/4300ms4088 KiB
21Time limit exceeded0/4300ms3892 KiB
22Time limit exceeded0/4287ms3892 KiB