182802025-10-17 06:25:18birozsLeghosszabb béke (75 pont)python3Time limit exceeded 17/75300ms4076 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+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
base17/75
1Accepted0/016ms3312 KiB
2Time limit exceeded0/0277ms4076 KiB
3Accepted3/316ms3124 KiB
4Accepted3/316ms3124 KiB
5Accepted3/317ms3056 KiB
6Wrong answer0/316ms3060 KiB
7Wrong answer0/316ms3124 KiB
8Wrong answer0/416ms3012 KiB
9Accepted4/420ms2952 KiB
10Accepted4/464ms3064 KiB
11Time limit exceeded0/4275ms3124 KiB
12Time limit exceeded0/4300ms3264 KiB
13Time limit exceeded0/4284ms3124 KiB
14Time limit exceeded0/4287ms3124 KiB
15Time limit exceeded0/4282ms3128 KiB
16Time limit exceeded0/4300ms3124 KiB
17Time limit exceeded0/4284ms3380 KiB
18Time limit exceeded0/4273ms3380 KiB
19Time limit exceeded0/4282ms3892 KiB
20Time limit exceeded0/4300ms3892 KiB
21Time limit exceeded0/4300ms3892 KiB
22Time limit exceeded0/4277ms3636 KiB