QOJ.ac
QOJ
| ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
|---|---|---|---|---|---|---|---|---|---|
| #327227 | #6715. Масив i ще кiлька масивiв | GuanYunchang | 0 | 1ms | 3832kb | C++20 | 2.2kb | 2024-02-14 20:43:42 | 2024-02-14 20:43:43 |
Due to the privacy settings of the submitter, you are not allowed to view this code.
详细
Subtask #1:
score: 0
Wrong Answer
Test #1:
score: 0
Wrong Answer
time: 1ms
memory: 3556kb
input:
1386 1 1386 469 323 431 584 1155 1198 288 253 696 1317 905 1037 1173 1267 116 736 810 417 332 802 293 171 489 1271 60 359 1360 591 572 243 224 705 1167 843 258 514 673 437 710 553 869 1119 1169 1326 771 1101 821 232 934 871 735 1113 902 1257 410 1077 45 685 769 560 1263 957 586 1126 429 975 1314 136...
output:
No
result:
wrong answer Jury has better answer than participant
Subtask #2:
score: 0
Wrong Answer
Test #29:
score: 0
Wrong Answer
time: 1ms
memory: 3644kb
input:
3049 4 733 1903 1904 1905 1906 1907 1908 1909 1910 1911 1912 1913 1914 1915 1916 1917 1918 1919 1920 1921 1922 1923 1924 1925 1926 1927 1928 1929 1930 1931 1932 1933 1934 1935 1936 1937 1938 1939 1940 1941 1942 1943 1944 1945 1946 1947 1948 1949 1950 1951 1952 1953 1954 1955 1956 1957 1958 1959 1960...
output:
Yes -587 -578 107 414
result:
wrong answer Participant returned incorrect sequence
Subtask #3:
score: 0
Skipped
Dependency #1:
0%
Subtask #4:
score: 0
Wrong Answer
Test #86:
score: 0
Wrong Answer
time: 1ms
memory: 3620kb
input:
3772 3 1254 223 2897 775 861 899 1603 1491 1689 3529 3586 3560 2938 2621 2687 1075 3386 895 2982 2521 2265 2366 1861 20 3078 381 2794 2235 1849 3040 2978 3171 2072 2479 767 1437 1850 3044 725 3051 490 289 1728 248 1320 3107 3093 484 875 2658 1441 3438 2160 1945 803 2763 1245 3267 1581 1031 397 3437 ...
output:
No
result:
wrong answer Jury has better answer than participant
Subtask #5:
score: 0
Wrong Answer
Test #115:
score: 0
Wrong Answer
time: 0ms
memory: 3584kb
input:
8968 5 580 961 963 965 967 969 971 973 975 977 979 981 983 985 987 989 991 993 995 997 999 1001 1003 1005 1007 1009 1011 1013 1015 1017 1019 1021 1023 1025 1027 1029 1031 1033 1035 1037 1039 1041 1043 1045 1047 1049 1051 1053 1055 1057 1059 1061 1063 1065 1067 1069 1071 1073 1075 1077 1079 1081 1083...
output:
Yes -38 -930 6634 3534 1922
result:
wrong answer Participant returned incorrect sequence
Subtask #6:
score: 0
Wrong Answer
Test #143:
score: 0
Wrong Answer
time: 1ms
memory: 3832kb
input:
3742 2 1894 1017 1390 2132 19 883 2503 942 3623 42 1099 1444 120 1109 692 2036 2442 3737 3037 582 118 1307 2904 737 2996 2591 2451 1252 1415 2954 862 914 2757 918 2090 190 1971 894 2207 1600 1272 1765 2704 1615 3625 804 1081 2039 651 3496 3475 496 2321 1169 547 1502 535 1256 3101 3069 2404 3399 239 ...
output:
No
result:
wrong answer Jury has better answer than participant
Subtask #7:
score: 0
Wrong Answer
Test #172:
score: 0
Wrong Answer
time: 0ms
memory: 3624kb
input:
27 5 4 21 14 3 27 3 27 6 24 8 5 20 6 8 14 7 11 13 5 5 14 20 19 11 7 14 20 23 9 15 26 18
output:
No
result:
wrong answer Jury has better answer than participant
Subtask #8:
score: 0
Skipped
Dependency #1:
0%