CT49044

Last routes of Curator

MediumL5 · Recursion RenegadeAcceptance: 0.0%XP: 60

The harbor bell rings at the mining town of Ironvein; Curator weighs the day's routes 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 <= 2768; 0 <= m <= 2768.

Example 1:

Input: 1340 2541 256 488 1327 1080 2 887 379 823 452 938 779 691 202 336 703 222 331 271 281 844 121 930 400 477 990 961 339 1285 869 224 1112 625 1315 436 1063 176 824 761 270 974 671 1144 169 752 957 963 237 40 489 830 243 1292 143 86 35 621 1228 458 823 86 994 401 527 1182 247 12 251 1192 305 771 973 169 1297 540 1195 1003 912 574 49 950 1294 265 1174 362 154 235 389 909 772 274 781 1021 472 911 858 1029 569 336 153 825 55 920 296 503 834 712 332 145 112 1252 277 449 588 508 300 160 506 1340 544 1033 29 72 606 399 18 367 1269 326 712 1314 251 1203 721 522 124 408 395 862 259 1151 1308 1046 672 686 315 13 84 561 661 414 381 30 835 324 678 801 1199 854 420 651 687 1168 1194 354 229 539 745 688 241 231 221 930 814 143 222 707 630 246 747 1093 362 435 179 118 463 1047 536 761 726 265 176 134 846 1…
Output: YES

Example 2:

Input: 46 448 43 30 27 13 18 2 24 5 36 30 3 7 24 32 11 10 33 35 19 35 20 42 30 37 7 40 19 42 33 41 4 7 9 19 4 34 6 34 37 41 18 17 16 4 34 45 31 38 14 21 18 29 1 23 34 1 40 37 12 27 17 46 14 6 9 22 33 8 32 22 23 8 43 41 2 20 14 31 5 3 44 12 20 24 20 35 25 5 41 28 44 14 24 35 18 8 46 9 3 25 5 26 42 22 19 20 32 40 2 10 25 42 8 6 16 37 32 19 7 17 28 32 1 10 33 24 14 10 18 7 18 28 1 9 5 41 39 29 26 6 18 31 7 2 16 1 29 25 34 3 9 46 19 40 6 12 25 46 41 18 20 19 41 19 33 31 33 14 35 6 15 32 28 34 29 13 32 36 3 28 40 16 5 21 1 31 3 21 44 26 20 37 36 8 18 12 22 32 27 30 14 19 19 13 27 40 17 14 5 9 27 24 25 37 41 5 5 24 13 41 30 44 33 2 16 21 25 40 3 15 25 28 25 7 1 18 32 33 29 40 30 38 38 20 12 23 10 15 3 38 24 16 42 29 41 43 21 1 32 18 42 20 3 37 46 5 42 12 38 32 35 33 46 13 21 23 21 46 13 1 13 30 8 18 5 …
Output: YES

Example 3:

Input: 1694 301 1329 341 574 528 935 687 591 446 1556 1590 395 1666 1616 539 103 50 1656 342 100 198 137 291 511 688 649 335 22 641 1141 1042 126 951 1175 1238 1191 1126 1517 752 1571 373 167 442 1167 961 1509 153 779 1499 757 1561 730 919 1208 1594 1395 490 1511 1398 925 929 1092 919 1209 1146 642 1150 1101 271 435 1421 437 743 1055 1005 805 1525 976 30 1468 1248 894 972 37 1262 799 1128 384 1186 73 755 1274 788 68 482 1235 89 979 1341 106 936 1010 1128 1462 1035 1538 1513 1385 665 1196 709 598 846 1439 1550 1266 660 205 1011 678 1330 381 1383 534 1661 567 245 707 288 786 93 14 764 204 385 1340 1226 781 929 1428 481 33 605 1069 604 1481 861 379 1079 115 730 1028 885 795 824 78 1344 718 649 815 127 1628 434 270 392 680 589 508 1267 974 817 1407 1412 592 1118 1258 1442 857 889 791 1557 230 615 165…
Output: NO

Constraints:

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

Loading...
Test Cases:No test cases
No test cases available.