CT35946

Vigo's Golden canals

MediumL5 · Recursion RenegadeAcceptance: 0.0%XP: 60

The harbor bell rings at the heron rookery of Longlegs; Vigo weighs the day's canals manifests and starts the calculations. 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 <= 1562; 0 <= m <= 1562.

Example 1:

Input: 129 1375 50 56 111 76 60 77 11 110 107 11 1 112 112 24 89 80 29 83 43 33 126 16 54 55 42 41 34 121 64 5 124 34 93 41 62 102 68 90 99 20 85 9 112 121 54 46 86 88 124 77 121 109 82 86 40 29 75 49 45 39 50 124 91 14 12 38 62 95 90 71 46 26 84 41 116 16 77 122 7 96 120 111 53 127 28 54 36 20 106 14 65 67 5 81 101 71 115 77 103 94 82 119 41 58 76 31 64 100 18 78 45 25 55 17 97 37 46 33 11 58 111 16 62 15 99 7 9 69 105 42 38 119 100 95 50 15 114 83 62 7 51 91 63 67 110 118 113 10 72 98 4 72 82 8 72 85 31 75 76 73 116 107 60 41 39 123 102 89 119 37 61 34 53 78 78 77 82 128 38 74 113 23 62 46 110 24 115 120 99 61 78 43 74 53 75 99 85 107 64 21 54 28 74 43 52 125 41 2 95 82 86 129 120 90 101 38 113 12 69 110 84 107 1 68 51 96 46 50 19 59 40 111 40 52 28 89 7 38 84 25 37 123 17 75 65 11 121 47 105 8…
Output: YES

Example 2:

Input: 69 638 37 24 21 54 16 65 53 51 12 34 28 16 66 65 50 27 30 44 51 47 13 38 2 49 57 8 26 8 27 34 14 2 63 46 10 22 60 47 40 59 64 28 9 15 41 17 56 52 67 11 55 9 17 34 47 61 1 7 47 58 53 63 19 68 49 51 16 37 53 40 26 18 40 5 34 45 42 8 20 46 37 58 25 44 61 11 50 39 26 25 45 24 55 49 11 52 14 65 69 60 38 33 52 65 52 50 41 40 39 26 23 57 54 24 40 4 6 60 69 32 23 22 31 67 18 57 23 4 60 46 43 54 14 61 54 49 34 30 25 57 39 20 60 54 15 63 24 46 51 16 16 21 64 11 38 1 39 9 33 67 40 44 43 29 19 67 61 30 7 68 20 1 13 24 13 60 5 24 12 2 18 68 59 49 23 3 22 12 6 42 49 52 45 64 53 1 17 44 51 56 20 56 50 29 63 65 57 18 61 29 34 18 4 11 13 2 32 68 60 61 27 3 2 4 27 68 16 12 31 48 24 57 23 35 25 8 35 39 52 54 53 50 61 8 57 66 58 19 34 17 6 30 59 57 60 6 62 29 21 45 61 57 68 21 2 37 33 24 61 27 52 42 4 52 54 6…
Output: YES

Example 3:

Input: 1053 241 336 985 302 413 440 161 216 69 774 668 184 633 893 585 706 197 210 145 300 166 668 83 319 440 464 665 550 569 242 65 782 267 159 658 526 444 1012 408 898 471 716 260 329 39 142 512 47 943 483 700 27 7 192 207 490 383 567 66 391 823 278 335 502 114 225 339 29 570 147 582 967 264 981 877 732 1036 27 969 375 279 1038 401 67 35 415 630 621 743 946 26 16 697 719 576 508 981 1023 618 797 455 986 267 777 179 983 966 486 705 1020 966 433 245 42 372 830 529 17 909 508 477 874 1035 626 452 639 945 888 236 595 501 334 772 769 107 937 86 842 502 447 85 668 844 618 39 396 227 126 932 465 548 755 300 833 340 428 497 131 604 388 725 597 878 498 1014 507 260 823 649 702 906 1023 525 252 388 305 719 1027 173 118 957 792 699 574 454 896 558 295 78 14 903 1033 911 579 3 501 234 183 843 757 764 788 3…
Output: NO

Constraints:

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

Loading...
Test Cases:No test cases
No test cases available.
Vigo's Golden canals - MEDIUM Coding Problem | CodeTikki