182792025-10-17 06:24:37birozsLeghosszabb béke (75 pont)python3Wrong answer 0/75300ms3896 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
print(T)
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
base0/75
1Wrong answer0/017ms3124 KiB
2Time limit exceeded0/0282ms3892 KiB
3Wrong answer0/317ms2900 KiB
4Wrong answer0/316ms3144 KiB
5Wrong answer0/316ms3112 KiB
6Wrong answer0/316ms2988 KiB
7Wrong answer0/316ms2996 KiB
8Wrong answer0/416ms3116 KiB
9Wrong answer0/421ms3088 KiB
10Wrong answer0/461ms3196 KiB
11Time limit exceeded0/4300ms3124 KiB
12Time limit exceeded0/4300ms3108 KiB
13Time limit exceeded0/4287ms3124 KiB
14Time limit exceeded0/4284ms3248 KiB
15Time limit exceeded0/4284ms3124 KiB
16Time limit exceeded0/4300ms3124 KiB
17Time limit exceeded0/4279ms3380 KiB
18Time limit exceeded0/4279ms3272 KiB
19Time limit exceeded0/4284ms3896 KiB
20Time limit exceeded0/4300ms3868 KiB
21Time limit exceeded0/4289ms3892 KiB
22Time limit exceeded0/4282ms3892 KiB