레이팅 미적용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 120 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 \(n\) messages to the SWERC Discord server. The \(i-th\) message was sent \(a_{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 1440 minutes, and a walk is considered to happen today if it starts at a minute \(s \ge 0\) and ends right before a minute \(e \le 1440\). In that case, it must hold that \(e - s = 120\) and, for every \(i = 1\), 2 . . . , \(n\), either \(a_{i} \le s\) or \(a_{i} \ge e\).
Each test contains multiple test cases. The first line contains an integer \(t\) (\(1 \le t \le 100\)) — the number of test cases. The descriptions of the \(t\) test cases follow. The first line of each test case contains an integer \(n\) (\(1 \le n \le 100\)) — the number of messages sent by the judge. The second line of each test case contains \(n\) integers \(a_{1}\), \(a_{2}\), . . . , \(a_{n}\) (\(0 \le a_{1} < a_{2}\) < · · · < \(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. Problem A: Walking Boy SWERC \(2022-2023\)
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