아직 만들고 있는 페이지입니다.

이 페이지는 아직 만드는 중입니다. 보이는 내용은 바뀔 수 있습니다.

Walking Boy

면접 대비

시간 제한2초메모리 제한1024 MB

요약
심판이 메시지를 보낸 시각들이 주어질 때, 하루 1440분 안에서 겹치지 않는 120분 산책 두 번이 가능한지 판정한다.
난이도

보통10점 중 4점

유형
그리디, 구현, 구간, 정렬
정답자
아직 제출이 없습니다

문제

One of the SWERC judges has a dog named Boy. Besides being a good competitive programmer, Boy loves fresh air, so she wants to be walked at least twice a day. Walking Boy requires 120120 consecutive minutes. Two walks cannot overlap, but one can start as soon as the previous one has finished.

Boy before and after getting ACCEPTED on this problem.

Today, the judge sent nn messages to the SWERC Discord server. The ii-th message was sent a_ia\_i minutes after midnight. You know that, when walking Boy, the judge does not send any messages, but he can send a message right before or right after a walk. Is it possible that the judge walked Boy at least twice today?

Note that a day has 14401440 minutes, and a walk is considered to happen today if it starts at a minute s≥0s ≥ 0 and ends right before a minute e≤1440e ≤ 1440. In that case, it must hold that e−s=120e - s = 120 and, for every i=1,2,…,ni = 1, 2, \dots , n, either a_i≤a\_i ≤ s or a_i≥ea\_i ≥ e.

입력

Each test contains multiple test cases. The first line contains an integer tt (1≤t≤1001 ≤ t ≤ 100) — the number of test cases. The descriptions of the tt test cases follow.

The first line of each test case contains an integer nn (1≤n≤1001 ≤ n ≤ 100) — the number of messages sent by the judge.

The second line of each test case contains nn integers a1_,a_2,…,a_na1\_, a\_2, \dots , a\_n (0≤a_1<a_2<⋯<a_n<14400 ≤ a\_1 < a\_2 < \cdots < a\_n < 1440) — the times at which the messages have been sent (in minutes elapsed from midnight).

출력

For each test case, output one line containing YES if it is possible that Boy has been walked at least twice, and NO otherwise.

힌트

In the first test case, the judge has sent a message at each time multiple of 100100 (excluding 00). It is impossible that he has walked Boy even once.

In the second test case, the times are the same as above, but 500500 and 10001000 are missing. The judge could have walked Boy, for instance, during the time intervals \[440,560]\[440, 560] and \[980,1100]\[980, 1100]. The situation is illustrated in the picture below, where the walks are represented by green intervals.

In the third test case, the times are the same as in the first test case, but 10001000 is missing. The judge could have walked Boy at most once.

In the fourth test case, Boy could have been walked during the time intervals \[739,859]\[739, 859] and \[859,979]\[859, 979].

예제1

  1. 예제 1

    입력
    6
    14
    100 200 300 400 500 600 700 800 900 1000 1100 1200 1300 1400
    12
    100 200 300 400 600 700 800 900 1100 1200 1300 1400
    13
    100 200 300 400 500 600 700 800 900 1100 1200 1300 1400
    13
    101 189 272 356 463 563 659 739 979 1071 1170 1274 1358
    1
    42
    5
    0 1 2 3 4
    
    예상 출력
    NO
    YES
    NO
    YES
    YES
    YES