CT45154

The canals at Alabast

MediumL5 · Recursion RenegadeAcceptance: 0.0%XP: 60

Caravans arrive at the ivory gates of Alabast with crates of canals, and Lara the paymaster must account for every last one. 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 <= 1929; 0 <= m <= 1929.

Example 1:

Input: 1855 948 1811 100 1066 1321 1373 267 845 899 3 144 45 59 1416 1326 1049 924 651 916 1725 523 497 115 1286 89 1395 803 222 370 1687 354 1492 1484 9 211 613 625 1032 614 1020 759 1365 20 190 256 266 688 956 1059 1412 22 1552 1724 1676 52 736 1470 1 558 54 180 1457 968 117 876 1020 1064 561 724 1812 1315 154 1083 434 1363 1645 172 351 1319 352 858 1217 1189 1770 436 457 1651 1066 1681 114 59 661 318 1604 1688 1602 1207 1609 86 397 302 843 1824 443 1482 646 1781 367 671 1055 1685 326 614 153 1738 1060 202 1770 441 140 722 1187 118 457 1721 779 1070 1263 275 1125 1354 444 1504 977 1753 918 5 340 1044 1691 419 1541 1263 855 1252 1561 1415 274 1385 527 125 702 788 1022 1431 1171 475 493 1109 855 313 543 876 1313 1493 1849 519 215 1825 1476 1309 475 824 54 1834 476 1458 317 643 1025 321 1758 1542 …
Output: YES

Example 2:

Input: 1034 1439 805 599 553 495 931 933 1 166 985 117 187 11 339 883 189 876 638 815 483 495 243 155 397 13 684 993 665 905 136 44 892 950 798 161 52 826 416 239 171 499 842 427 541 4 65 867 959 481 326 505 589 242 383 989 121 701 836 230 904 365 230 142 1034 915 746 790 447 170 379 874 719 950 921 969 636 4 21 1025 234 852 768 460 675 53 719 739 939 190 360 616 551 441 233 493 414 311 750 510 556 487 303 156 709 546 733 151 765 149 603 928 789 84 323 829 955 823 717 283 797 56 33 449 918 800 295 366 843 620 386 636 715 469 727 726 267 404 105 132 544 378 854 43 1033 887 138 634 43 294 921 566 769 68 252 352 433 393 499 259 531 900 207 651 110 428 683 101 761 704 174 488 464 1016 34 1022 761 615 993 1028 364 188 944 281 1031 963 195 912 138 694 113 734 806 520 1030 839 102 904 34 485 919 190 101…
Output: YES

Example 3:

Input: 24 158 24 23 18 22 11 7 12 17 3 2 2 21 3 1 11 6 7 13 8 15 5 11 5 18 5 10 2 14 11 8 24 12 4 1 15 7 4 13 15 2 20 13 21 20 9 4 11 19 20 2 3 18 13 12 13 16 17 6 2 13 3 20 9 21 18 17 4 6 9 13 23 5 20 10 10 3 8 17 10 23 7 22 7 17 19 9 13 14 1 3 11 9 23 20 8 7 12 18 12 21 12 23 9 16 16 2 18 16 18 7 9 11 10 14 7 18 14 1 2 9 1 9 7 15 21 1 2 20 16 20 12 13 4 24 24 5 17 24 16 3 24 17 13 20 18 21 20 1 13 18 15 8 4 15 11 24 19 24 5 15 1 10 14 17 19 1 8 3 19 5 9 15 3 11 3 10 5 1 22 12 3 22 14 3 14 5 6 18 18 2 9 22 10 20 19 13 24 21 17 1 12 5 6 22 13 8 1 6 6 11 15 19 23 12 7 20 20 19 18 24 14 15 14 8 20 3 19 20 15 3 21 6 7 16 13 10 15 17 13 5 16 24 21 7 14 19 18 19 8 4 14 11 14 7 15 12 9 2 16 12 17 20 6 23 13 1 2 1 11 12 12 19 11 22 20 11 18 23 19 4 17 13 9 7 4 18 10 8 20 21 22 8 3 14 9 10 24 9 18 3 16 9…
Output: YES

Constraints:

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

Loading...
Test Cases:No test cases
No test cases available.
The canals at Alabast - MEDIUM Coding Problem | CodeTikki