CT37613

The Circular Route Beneath Saprun

MediumL5 · Recursion RenegadeAcceptance: 0.0%XP: 60

Librarian runs the exchange at the maple sugarbush of Saprun. Today the books show a list of corridors, and the numbers must be worked out before sundown. Task: Print YES if the directed graph contains a cycle, otherwise NO. Input format: First line: n and m. Next m lines: u v (directed). Output format: Print YES or NO. Constraints: 1 <= n <= 2053; 0 <= m <= 2053.

Example 1:

Input: 138 1936 67 134 3 75 76 12 70 91 53 7 124 81 56 103 61 75 3 6 6 136 93 2 80 10 13 53 55 5 3 36 29 71 70 84 101 14 91 1 82 96 36 48 100 13 90 55 65 123 136 131 22 60 38 94 73 25 60 19 108 67 78 5 83 68 61 45 118 112 79 111 39 122 33 12 62 125 87 115 13 39 137 36 85 48 107 82 8 84 113 106 61 53 3 73 46 67 41 89 131 81 114 133 71 8 40 94 31 134 47 28 75 48 125 126 111 67 135 32 85 15 77 68 99 138 44 87 87 117 70 97 28 7 32 58 31 49 63 95 117 130 78 36 104 72 43 34 59 3 91 92 129 84 74 84 92 68 49 41 112 71 2 41 66 1 46 106 57 40 98 25 27 100 44 116 23 84 41 111 5 92 80 83 22 4 127 67 137 126 13 64 115 83 32 52 22 135 19 25 97 76 6 124 31 115 91 77 51 32 70 46 40 89 118 94 39 50 128 78 16 128 122 97 65 118 107 105 17 49 23 57 19 114 27 85 28 70 118 62 49 135 128 79 42 31 38 61 19 64 9 8 41 82 …
Output: YES

Example 2:

Input: 31 616 4 21 26 5 13 16 2 3 12 8 14 5 7 31 4 6 11 30 25 13 9 31 25 29 18 19 31 15 25 11 29 24 3 26 17 5 27 5 10 29 9 10 27 13 11 5 31 3 30 17 15 11 28 24 9 19 23 16 6 5 25 6 8 20 7 5 12 7 11 24 11 1 28 18 1 2 23 30 25 28 23 1 8 2 15 9 6 13 1 30 21 26 12 2 6 28 14 17 15 6 11 16 6 11 18 12 18 31 21 2 4 22 6 9 9 8 15 12 20 26 18 28 29 6 21 30 19 25 25 5 17 4 2 31 10 25 30 2 5 18 31 12 29 2 1 20 22 23 4 24 31 18 24 20 19 13 20 11 10 13 19 31 13 9 23 31 16 4 2 27 20 14 30 11 8 18 20 27 25 30 16 20 13 7 29 31 6 14 5 26 19 17 15 31 24 22 22 27 23 10 11 19 10 8 31 21 5 27 2 13 18 2 20 15 5 30 21 13 29 8 7 13 23 28 23 26 6 7 3 18 27 6 16 10 1 8 14 2 30 9 22 19 10 27 9 24 17 12 8 11 27 2 10 21 5 2 21 8 9 20 29 28 11 20 31 8 29 25 2 12 21 16 29 7 9 23 29 18 18 27 3 30 27 18 6 24 29 23 11 28 7 10 15 26…
Output: YES

Example 3:

Input: 891 1931 546 789 851 232 706 804 641 515 739 71 83 44 687 478 601 78 804 456 731 596 752 348 132 756 128 200 592 312 106 324 459 854 329 297 354 105 118 735 506 86 37 88 310 838 289 345 60 731 484 714 296 366 613 664 14 257 39 495 465 532 450 872 489 593 702 671 402 697 453 130 720 745 418 560 580 827 303 785 198 307 758 428 66 360 97 145 237 185 822 415 156 208 885 80 514 380 406 317 665 495 12 279 137 378 213 432 473 861 270 584 523 301 772 608 65 536 551 768 548 576 397 644 633 401 229 513 878 6 326 722 510 203 53 683 734 481 247 274 804 702 298 619 716 762 613 122 287 777 87 139 331 341 331 724 842 433 413 575 83 709 724 59 523 441 200 310 570 335 153 133 858 718 395 465 166 620 506 364 315 742 177 217 820 155 350 302 110 774 577 708 476 891 108 501 420 116 148 647 343 546 329 793 47 6…
Output: YES

Constraints:

1 <= n <= 2053; 0 <= m <= 2053.

Loading...
Test Cases:No test cases
No test cases available.
The Circular Route Beneath Saprun - MEDIUM Coding Problem | CodeTikki