Social Distancing

수직선 위 M개의 서로 겹치지 않는 잔디 구간에 소 N마리를 정수 위치에 배치해 가장 가까운 두 소 사이 거리를 최대로 만들고, 그 값을 출력한다.

어려움8이분 탐색그리디구간정렬아직 제출이 없습니다시간 제한1초메모리 제한512 MB

문제

Farmer John is worried for the health of his cows after an outbreak of the highly contagious bovine disease COWVID-19.

In order to limit transmission of the disease, Farmer John's NN cows (2N1052 \leq N \leq 10^5) have decided to practice "social distancing" and spread themselves out across the farm. The farm is shaped like a 1D number line, with MM mutually-disjoint intervals (1M1051 \leq M \leq 10^5) in which there is grass for grazing. The cows want to locate themselves at distinct integer points, each covered in grass, so as to maximize the value of DD, where DD represents the distance between the closest pair of cows. Please help the cows determine the largest possible value of DD.

입력

The first line of input contains NN and MM. The next MM lines each describe an interval in terms of two integers aa and bb, where 0ab10180 \leq a \leq b \leq 10^{18}. No two intervals overlap or touch at their endpoints. A cow standing on the endpoint of an interval counts as standing on grass.

출력

Print the largest possible value of DD such that all pairs of cows are DD units apart. A solution with D>0D>0 is guaranteed to exist.

힌트

One way to achieve D=2D=2 is to have cows at positions 00, 22, 44, 66 and 99.