145952025-01-19 17:42:37farkasrekaLeghosszabb béke (75 pont)python3Time limit exceeded 59/75300ms19160 KiB
from sys import stdin

N, M = [int(x) for x in stdin.readline().split()]
a = []
for i in range(M):
	k, v = [int(x) for x in stdin.readline().split()]
	a.append([k,v])
a.sort()
b = [a[0]]
for i in range(1,M):
	elozo = b[-1]
	most = a[i]
	if elozo[1] >= most[0]:
		b[-1][-1] = max(most[1],b[-1][-1])
	else:
		b.append(most)
eleje = 1
max_hossz = b[0][0]-1
for j in range(1,len(b)):
	hossz = b[j][0]-b[j-1][1]-1
	if hossz > max_hossz:
		max_hossz = hossz
		eleje = b[j-1][1]+1
hossz = N-b[-1][1]
if hossz > max_hossz:
	max_hossz = hossz
	eleje = b[-1][1]+1
if max_hossz == 0:
	print(-1)
else:
	print(max_hossz, eleje)
SubtaskSumTestVerdictTimeMemory
base59/75
1Accepted0/016ms3124 KiB
2Time limit exceeded0/0286ms19160 KiB
3Accepted3/316ms3180 KiB
4Accepted3/316ms3128 KiB
5Accepted3/316ms3108 KiB
6Accepted3/314ms3140 KiB
7Accepted3/316ms3044 KiB
8Accepted4/416ms3124 KiB
9Accepted4/416ms3328 KiB
10Accepted4/417ms3124 KiB
11Accepted4/432ms3980 KiB
12Accepted4/439ms4388 KiB
13Accepted4/429ms3892 KiB
14Accepted4/432ms3892 KiB
15Accepted4/441ms4404 KiB
16Accepted4/439ms4232 KiB
17Accepted4/439ms4224 KiB
18Accepted4/443ms4404 KiB
19Time limit exceeded0/4300ms17660 KiB
20Time limit exceeded0/4291ms18428 KiB
21Time limit exceeded0/4300ms16588 KiB
22Time limit exceeded0/4284ms18296 KiB