QOJ.ac
QOJ
| ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
|---|---|---|---|---|---|---|---|---|---|
| #562951 | #9262. Yandex Museum | ucup-team1005# | AC ✓ | 435ms | 94632kb | C++20 | 4.8kb | 2024-09-13 23:27:09 | 2024-09-13 23:27:10 |
Due to the privacy settings of the submitter, you are not allowed to view this code.
详细
Test #1:
score: 100
Accepted
time: 0ms
memory: 3664kb
input:
5 0 0 0 2 1 0 0 0 2 0 0 1 0 0 0 2 2 0 2 0 0 1 0 2 0 2 1 0 2 0
output:
nice
result:
ok Both jury and participant think that everything is covered properly
Test #2:
score: 0
Accepted
time: 0ms
memory: 3984kb
input:
5 0 0 1 0 0 1 1 0 2 0 1 1 0 0 0 2 2 0 0 1 0 2 1 1 0 0 2 0 0 2
output:
not nice 0.500000000 0.999999950
result:
ok Both jury and participant found uncovered points, participant point is (0.500000000, 0.999999950) with cover count 2
Test #3:
score: 0
Accepted
time: 0ms
memory: 4068kb
input:
5 0 0 5 0 5 5 0 0 0 5 5 5 0 5 5 5 5 0 0 5 0 0 5 0 5 0 2 1 3 4
output:
not nice 2.500000000 4.999999950
result:
ok Both jury and participant found uncovered points, participant point is (2.500000000, 4.999999950) with cover count 2
Test #4:
score: 0
Accepted
time: 0ms
memory: 3996kb
input:
7 0 0 5 0 5 5 0 0 0 5 5 5 0 5 5 5 5 0 0 5 0 0 5 0 4 3 1 2 4 5 2 0 0 1 0 0 5 3 3 0 2 1
output:
not nice 2.500000000 4.999999950
result:
ok Both jury and participant found uncovered points, participant point is (2.500000000, 4.999999950) with cover count 2
Test #5:
score: 0
Accepted
time: 0ms
memory: 3972kb
input:
9 0 0 10 0 10 10 0 0 0 10 10 10 0 10 10 10 10 0 0 10 0 0 10 0 7 0 10 1 2 4 10 3 4 9 7 8 8 7 10 4 5 8 2 10 10 6 0 6 8 2 10 5 4 8
output:
not nice 5.000000000 9.999999950
result:
ok Both jury and participant found uncovered points, participant point is (5.000000000, 9.999999950) with cover count 2
Test #6:
score: 0
Accepted
time: 1ms
memory: 4072kb
input:
104 0 0 100 0 100 100 0 0 0 100 100 100 0 100 100 100 100 0 0 100 0 0 100 0 50 59 50 19 46 61 21 48 41 5 84 5 26 23 57 75 35 37 95 56 37 8 77 71 2 59 76 88 60 40 78 5 82 25 42 4 79 31 38 3 65 22 44 11 10 8 50 44 80 71 59 48 86 2 60 53 49 73 31 28 42 12 39 69 55 2 69 75 18 96 44 81 69 62 55 33 59 36 ...
output:
not nice 50.000000000 99.999999950
result:
ok Both jury and participant found uncovered points, participant point is (50.000000000, 99.999999950) with cover count 2
Test #7:
score: 0
Accepted
time: 3ms
memory: 4896kb
input:
1004 0 0 10000 0 10000 10000 0 0 0 10000 10000 10000 0 10000 10000 10000 10000 0 0 10000 0 0 10000 0 7215 3458 9430 315 2707 771 209 810 7295 9822 9129 9114 9807 4691 3262 963 2944 704 848 8129 3922 9711 1982 6924 2515 2178 3637 963 464 5175 6761 8563 1735 3315 6756 8377 5663 7161 1711 868 1908 4347...
output:
not nice 5000.000000000 9999.999999950
result:
ok Both jury and participant found uncovered points, participant point is (5000.000000000, 9999.999999950) with cover count 2
Test #8:
score: 0
Accepted
time: 3ms
memory: 4780kb
input:
1004 0 0 10000 0 10000 10000 0 0 0 10000 10000 10000 0 10000 10000 10000 10000 0 0 10000 0 0 10000 0 9705 1071 9061 2468 8878 1783 4138 3562 3857 3565 4965 3646 1380 1893 1360 3568 1580 3180 2659 598 3002 23 3635 1029 3930 6073 3132 5835 3610 6136 4825 3975 4384 2454 4381 2793 3342 4841 4229 4504 37...
output:
not nice 1097.140119385 6499.389081226
result:
ok Both jury and participant found uncovered points, participant point is (1097.140119385, 6499.389081226) with cover count 5
Test #9:
score: 0
Accepted
time: 3ms
memory: 4900kb
input:
1004 0 0 10000 0 10000 10000 0 0 0 10000 10000 10000 0 10000 10000 10000 10000 0 0 10000 0 0 10000 0 9708 5232 9375 6549 9613 5843 6672 5917 6601 5748 5628 4734 3470 7448 3098 6627 3080 7143 4936 3500 5434 2587 5708 2413 1808 705 1330 743 1436 1132 7820 760 7615 1074 8559 425 9359 6375 9275 7444 921...
output:
not nice 5000.000000000 9999.999999950
result:
ok Both jury and participant found uncovered points, participant point is (5000.000000000, 9999.999999950) with cover count 2
Test #10:
score: 0
Accepted
time: 28ms
memory: 12600kb
input:
10004 0 0 10000 0 10000 10000 0 0 0 10000 10000 10000 0 10000 10000 10000 10000 0 0 10000 0 0 10000 0 3364 5713 3408 5357 3276 5359 9032 9719 8601 9497 9009 9897 7441 264 7544 299 7453 122 8092 196 8118 486 8464 599 7644 5977 7207 6112 7445 5886 2347 920 2304 925 2265 1189 3636 1071 4010 982 4201 10...
output:
not nice 1097.140119385 6499.389081226
result:
ok Both jury and participant found uncovered points, participant point is (1097.140119385, 6499.389081226) with cover count 2
Test #11:
score: 0
Accepted
time: 89ms
memory: 27368kb
input:
30012 0 0 10000 0 10000 10000 0 0 0 10000 10000 10000 0 10000 10000 10000 10000 0 0 10000 0 0 10000 0 3364 5713 3408 5357 3276 5359 9032 9719 8601 9497 9009 9897 7441 264 7544 299 7453 122 8092 196 8118 486 8464 599 7644 5977 7207 6112 7445 5886 2347 920 2304 925 2265 1189 3636 1071 4010 982 4201 10...
output:
nice
result:
ok Both jury and participant think that everything is covered properly
Test #12:
score: 0
Accepted
time: 29ms
memory: 12784kb
input:
10004 0 0 10000 0 10000 10000 0 0 0 10000 10000 10000 0 10000 10000 10000 10000 0 0 10000 0 0 10000 0 712 3239 1075 3328 1052 3208 2970 809 3081 567 2952 850 2914 1003 2781 1242 2942 1260 8174 3250 8101 3427 8180 3596 7799 7630 7826 7556 7718 7467 3385 3892 3342 3975 3456 3852 4853 9550 4685 9310 49...
output:
not nice 1097.140119385 6499.389081226
result:
ok Both jury and participant found uncovered points, participant point is (1097.140119385, 6499.389081226) with cover count 4
Test #13:
score: 0
Accepted
time: 381ms
memory: 84308kb
input:
100000 0 0 10000 0 10000 10000 0 0 0 10000 10000 10000 0 10000 10000 10000 10000 0 0 10000 0 0 10000 0 434 7956 493 7927 376 7904 7146 6009 7182 5987 7152 5926 6939 4319 6960 4463 6924 4392 1438 2208 1441 2160 1276 2138 8256 7688 8311 7783 8308 7741 5195 4629 5271 4769 5160 4653 9668 9541 9766 9480 ...
output:
not nice 7734.500000000 9999.999999950
result:
ok Both jury and participant found uncovered points, participant point is (7734.500000000, 9999.999999950) with cover count 2
Test #14:
score: 0
Accepted
time: 380ms
memory: 86692kb
input:
99999 0 0 10000 0 10000 10000 0 0 0 10000 10000 10000 0 10000 10000 10000 10000 0 0 10000 0 0 10000 0 4451 1947 4387 2001 4411 1968 9640 9119 9678 9073 9766 9050 1536 4064 1526 4057 1509 4145 4662 2205 4674 2158 4535 2178 221 6130 248 6207 323 6204 3912 5331 3993 5268 4022 5238 1421 8571 1388 8621 1...
output:
nice
result:
ok Both jury and participant think that everything is covered properly
Test #15:
score: 0
Accepted
time: 415ms
memory: 94632kb
input:
100000 0 0 10000 0 10000 10000 0 0 0 10000 10000 10000 0 10000 10000 10000 10000 0 0 10000 0 0 10000 0 2416 8267 2497 8236 2504 8226 2931 2079 2889 2060 2973 2088 6591 2434 6615 2398 6606 2386 2349 8262 2336 8263 2331 8211 2034 5012 2030 4965 2002 4919 5013 2058 4991 2081 4976 2003 1538 6157 1550 61...
output:
not nice 1097.140119385 6499.389081226
result:
ok Both jury and participant found uncovered points, participant point is (1097.140119385, 6499.389081226) with cover count 4
Test #16:
score: 0
Accepted
time: 3ms
memory: 4820kb
input:
1004 0 0 9999 0 9999 10000 0 0 0 10000 9999 10000 0 10000 9999 10000 9999 0 0 10000 0 0 9999 0 348 8818 3300 9458 9192 3305 7410 7351 3387 6 4246 7999 28 7891 1759 4268 3229 4486 3657 26 3753 8488 2942 310 7018 765 6563 5575 8250 9374 3666 7268 9573 4712 7026 593 5424 5684 6936 3963 8455 2247 5509 5...
output:
not nice 4999.500000000 9999.999999950
result:
ok Both jury and participant found uncovered points, participant point is (4999.500000000, 9999.999999950) with cover count 2
Test #17:
score: 0
Accepted
time: 3ms
memory: 4852kb
input:
1004 0 0 10000 0 10000 10000 0 0 0 10000 10000 10000 0 10000 10000 10000 10000 0 0 10000 0 0 10000 0 9027 7940 8729 7767 8063 8142 2753 2515 2482 3346 2829 2540 2263 2326 3108 2051 2203 2031 2596 5945 1972 6623 2386 7023 215 5833 898 5725 1504 6042 6865 1507 6645 1418 6609 1312 3911 7524 4339 6675 4...
output:
not nice 5000.000000000 9999.999999950
result:
ok Both jury and participant found uncovered points, participant point is (5000.000000000, 9999.999999950) with cover count 2
Test #18:
score: 0
Accepted
time: 3ms
memory: 4904kb
input:
1004 0 0 10000 0 10000 10000 0 0 0 10000 10000 10000 0 10000 10000 10000 10000 0 0 10000 0 0 10000 0 9979 701 9790 884 9078 312 2117 4108 1363 4523 2139 4202 8408 8796 8041 8066 7998 8849 850 5432 949 5193 621 5069 5782 1513 6517 1291 6310 1124 4354 3435 3669 3138 3673 3699 1914 28 2075 362 1140 807...
output:
not nice 1097.140119385 6499.389081226
result:
ok Both jury and participant found uncovered points, participant point is (1097.140119385, 6499.389081226) with cover count 5
Test #19:
score: 0
Accepted
time: 24ms
memory: 12560kb
input:
10004 0 0 10000 0 10000 10000 0 0 0 10000 10000 10000 0 10000 10000 10000 10000 0 0 10000 0 0 10000 0 2551 476 2739 281 2898 55 9394 8638 9307 8725 9382 8797 3432 1164 3102 844 3363 901 7226 2157 6912 2363 7011 2363 7018 6765 7352 6609 7071 6461 361 7529 133 7626 647 7579 1502 3321 1742 3206 1452 37...
output:
not nice 1097.140119385 6499.389081226
result:
ok Both jury and participant found uncovered points, participant point is (1097.140119385, 6499.389081226) with cover count 2
Test #20:
score: 0
Accepted
time: 81ms
memory: 27388kb
input:
30012 0 0 10000 0 10000 10000 0 0 0 10000 10000 10000 0 10000 10000 10000 10000 0 0 10000 0 0 10000 0 2551 476 2739 281 2898 55 9394 8638 9307 8725 9382 8797 3432 1164 3102 844 3363 901 7226 2157 6912 2363 7011 2363 7018 6765 7352 6609 7071 6461 361 7529 133 7626 647 7579 1502 3321 1742 3206 1452 37...
output:
nice
result:
ok Both jury and participant think that everything is covered properly
Test #21:
score: 0
Accepted
time: 22ms
memory: 12756kb
input:
10004 0 0 10000 0 10000 10000 0 0 0 10000 10000 10000 0 10000 10000 10000 10000 0 0 10000 0 0 10000 0 130 7974 157 7975 180 7707 5907 7646 5874 7803 5827 7525 9318 2620 9095 2459 9324 2602 2132 9116 2294 9295 2293 9437 7520 9551 7587 9708 7520 9759 769 9622 726 9807 725 9812 2837 431 2835 321 2980 4...
output:
not nice 1097.140119385 6499.389081226
result:
ok Both jury and participant found uncovered points, participant point is (1097.140119385, 6499.389081226) with cover count 4
Test #22:
score: 0
Accepted
time: 374ms
memory: 84252kb
input:
100000 0 0 10000 0 10000 10000 0 0 0 10000 10000 10000 0 10000 10000 10000 10000 0 0 10000 0 0 10000 0 219 2780 65 2699 238 2746 3832 6230 3759 6277 3828 6183 7162 6236 7253 6137 7164 6192 6180 6787 6240 6777 6261 6818 3019 7051 3141 7149 3127 7124 8725 5526 8741 5653 8754 5550 2281 6021 2360 6028 2...
output:
not nice 9840.000000000 9999.999999950
result:
ok Both jury and participant found uncovered points, participant point is (9840.000000000, 9999.999999950) with cover count 2
Test #23:
score: 0
Accepted
time: 376ms
memory: 86096kb
input:
99999 0 0 10000 0 10000 10000 0 0 0 10000 10000 10000 0 10000 10000 10000 10000 0 0 10000 0 0 10000 0 1697 4933 1625 4895 1664 4825 2713 7971 2761 7966 2751 8028 8320 8283 8276 8180 8291 8260 979 100 935 44 1011 39 5522 7780 5508 7808 5540 7662 5107 2965 5111 2836 5085 2867 6262 2985 6204 3126 6231 ...
output:
nice
result:
ok Both jury and participant think that everything is covered properly
Test #24:
score: 0
Accepted
time: 435ms
memory: 94568kb
input:
100000 0 0 10000 0 10000 10000 0 0 0 10000 10000 10000 0 10000 10000 10000 10000 0 0 10000 0 0 10000 0 7 528 20 518 2 541 9323 3522 9230 3543 9302 3532 6056 8338 6019 8380 6076 8361 3421 4468 3416 4497 3483 4486 5282 4939 5242 4949 5224 4862 9780 8654 9726 8620 9803 8609 6401 128 6381 119 6477 229 9...
output:
not nice 1097.140119385 6499.389081226
result:
ok Both jury and participant found uncovered points, participant point is (1097.140119385, 6499.389081226) with cover count 5
Test #25:
score: 0
Accepted
time: 94ms
memory: 27320kb
input:
31953 0 0 10000 0 10000 10000 0 0 0 10000 10000 10000 0 10000 10000 10000 10000 0 0 10000 0 0 10000 0 4471 4654 4725 4560 4654 4591 836 1575 1507 1970 2683 2646 3659 8274 3786 8003 3808 7953 4244 6687 4427 6148 4213 6795 4587 4486 4656 4447 4136 4699 4932 5962 4894 6135 4899 6131 5762 5805 5647 5831...
output:
not nice 1097.140119385 6499.389081226
result:
ok Both jury and participant found uncovered points, participant point is (1097.140119385, 6499.389081226) with cover count 2
Test #26:
score: 0
Accepted
time: 2ms
memory: 4568kb
input:
961 0 0 30 0 30 60 0 0 0 60 30 60 0 60 30 60 30 0 0 60 0 0 30 0 11 10 16 24 13 14 3 43 3 40 4 50 1 14 2 31 2 29 28 25 29 19 29 23 3 38 2 26 3 40 18 42 18 47 19 16 25 56 24 55 23 51 18 42 17 47 18 47 26 9 21 6 20 6 19 24 19 25 20 34 9 56 9 54 10 55 18 0 24 29 21 14 28 38 27 29 27 27 20 6 26 5 25 5 2 ...
output:
not nice 3.500000000 36.000000050
result:
ok Both jury and participant found uncovered points, participant point is (3.500000000, 36.000000050) with cover count 2
Test #27:
score: 0
Accepted
time: 2ms
memory: 4640kb
input:
955 0 0 60 0 60 30 0 0 0 30 60 30 0 30 60 30 60 0 0 30 0 0 60 0 25 28 30 26 32 25 48 22 47 24 46 27 5 11 2 4 5 10 23 16 20 11 24 18 56 30 51 26 52 29 25 30 19 19 21 23 26 8 25 3 25 6 22 26 15 17 16 17 34 5 34 3 33 6 12 22 11 22 9 20 56 8 52 7 47 6 13 16 17 21 15 18 29 20 29 19 30 19 40 28 39 27 37 2...
output:
not nice 25.500000000 28.000000050
result:
ok Both jury and participant found uncovered points, participant point is (25.500000000, 28.000000050) with cover count 2
Test #28:
score: 0
Accepted
time: 148ms
memory: 43264kb
input:
59999 0 0 3 0 3 10000 0 0 0 10000 3 10000 0 10000 3 10000 3 0 0 10000 0 0 3 0 3 10000 2 7363 2 7364 2 0 3 7892 3 7891 0 0 1 413 1 412 3 10000 2 2687 2 2686 1 10000 0 9490 0 9491 3 10000 2 2556 2 2557 3 10000 2 6890 2 6889 3 10000 2 7177 2 7178 3 10000 2 1232 2 1231 1 236 2 9389 2 9388 2 10000 1 7963...
output:
not nice 1.500000000 235.000000050
result:
ok Both jury and participant found uncovered points, participant point is (1.500000000, 235.000000050) with cover count 2
Test #29:
score: 0
Accepted
time: 174ms
memory: 42776kb
input:
59999 0 0 10000 0 10000 3 0 0 0 3 10000 3 0 3 10000 3 10000 0 0 3 0 0 10000 0 10000 3 4817 2 4818 2 7774 1 3405 0 7775 1 3404 0 5404 1 3403 0 9104 1 6070 0 6071 0 10000 3 8806 2 8805 2 959 1 3816 2 3817 2 5565 2 5566 2 1199 1 3236 0 5258 1 3237 0 8527 0 8526 0 9104 1 10000 0 9203 1 9204 1 5239 1 523...
output:
not nice 600.500000000 1.000000050
result:
ok Both jury and participant found uncovered points, participant point is (600.500000000, 1.000000050) with cover count 2
Test #30:
score: 0
Accepted
time: 175ms
memory: 42896kb
input:
59998 0 0 10000 0 10000 3 0 0 0 3 10000 3 0 3 10000 3 10000 0 0 3 0 0 10000 0 3523 2 5948 3 5947 3 8523 1 6153 0 6152 0 3523 2 7725 3 7726 3 3523 0 6161 1 6160 1 8523 1 5521 0 5522 0 3523 1 5109 2 5110 2 8523 1 4638 0 4637 0 8523 3 7616 2 7615 2 9384 3 8984 2 9385 3 3523 2 7989 3 7988 3 8886 3 8885 ...
output:
not nice 3523.500000000 1.000000050
result:
ok Both jury and participant found uncovered points, participant point is (3523.500000000, 1.000000050) with cover count 2
Test #31:
score: 0
Accepted
time: 165ms
memory: 43300kb
input:
59998 0 0 10000 0 10000 3 0 0 0 3 10000 3 0 3 10000 3 10000 0 0 3 0 0 10000 0 9999 2 2545 1 2546 1 1 1 2876 2 2875 2 1 1 1045 2 1044 2 1 2 2322 3 2323 3 9999 1 1802 0 1801 0 9999 3 7676 2 7677 2 9999 2 774 1 773 1 1 2 7748 3 7749 3 1 1 3104 2 3103 2 1 0 1272 1 1271 1 1 2 9623 3 9622 3 1 0 3770 1 377...
output:
not nice 1.500000000 1.000000050
result:
ok Both jury and participant found uncovered points, participant point is (1.500000000, 1.000000050) with cover count 2
Test #32:
score: 0
Accepted
time: 356ms
memory: 79372kb
input:
99980 0 0 10000 0 10000 10000 0 0 0 10000 10000 10000 0 10000 10000 10000 10000 0 0 10000 0 0 10000 0 3042 1416 2901 1396 3003 1412 9674 3653 9655 3687 9081 4817 8876 8535 8860 8661 8867 8723 8664 7566 8652 7636 8646 7657 5844 8030 5931 8156 6044 8284 3237 3666 3313 3790 3441 3959 9195 496 9149 533 ...
output:
not nice 8210.500000000 3053.000000050
result:
ok Both jury and participant found uncovered points, participant point is (8210.500000000, 3053.000000050) with cover count 2
Test #33:
score: 0
Accepted
time: 375ms
memory: 79492kb
input:
99981 0 0 10000 0 10000 10000 0 0 0 10000 10000 10000 0 10000 10000 10000 10000 0 0 10000 0 0 10000 0 6676 3227 6715 3265 6725 3277 7999 808 7675 1094 7718 1052 2770 502 2654 473 2719 468 9791 1721 9714 1458 9719 1454 3439 7911 2245 2313 3029 5989 4393 3624 4561 4676 4393 3607 6018 8506 6547 8510 67...
output:
not nice 3883.500000000 8497.000000050
result:
ok Both jury and participant found uncovered points, participant point is (3883.500000000, 8497.000000050) with cover count 2
Test #34:
score: 0
Accepted
time: 376ms
memory: 80020kb
input:
99982 0 0 10000 0 10000 10000 0 0 0 10000 10000 10000 0 10000 10000 10000 10000 0 0 10000 0 0 10000 0 8916 7 7145 19 6925 21 8688 728 8642 720 8687 685 9795 2211 9685 2459 9788 2200 8934 1694 8616 1874 8381 2000 7953 1858 6938 2081 7433 1977 2749 6075 2504 5741 2719 6035 1 0 5195 190 3528 130 9224 9...
output:
not nice 1.500000000 1367.000000050
result:
ok Both jury and participant found uncovered points, participant point is (1.500000000, 1367.000000050) with cover count 2
Test #35:
score: 0
Accepted
time: 15ms
memory: 8512kb
input:
9996 0 0 0 1 9996 1 0 0 0 1 1 1 0 0 0 1 1 1 0 0 1 1 9996 1 0 0 1 1 2 1 0 0 2 1 9996 1 0 0 3 1 9996 1 0 0 3 1 4 1 0 0 3 1 4 1 0 0 4 1 9996 1 0 0 4 1 5 1 0 0 5 1 9996 1 0 0 6 1 9996 1 0 0 6 1 7 1 0 0 6 1 7 1 0 0 7 1 9996 1 0 0 7 1 8 1 0 0 8 1 9996 1 0 0 9 1 9996 1 0 0 9 1 10 1 0 0 9 1 10 1 0 0 10 1 99...
output:
nice
result:
ok Both jury and participant think that everything is covered properly
Test #36:
score: 0
Accepted
time: 17ms
memory: 8796kb
input:
9995 0 0 0 1 9995 1 0 0 0 1 1 1 0 0 0 1 1 1 0 0 1 1 9995 1 0 0 1 1 2 1 0 0 2 1 9995 1 0 0 3 1 9995 1 0 0 3 1 4 1 0 0 3 1 4 1 0 0 4 1 9995 1 0 0 4 1 5 1 0 0 5 1 9995 1 0 0 6 1 9995 1 0 0 6 1 7 1 0 0 6 1 7 1 0 0 7 1 9995 1 0 0 7 1 8 1 0 0 8 1 9995 1 0 0 9 1 9995 1 0 0 9 1 10 1 0 0 9 1 10 1 0 0 10 1 99...
output:
not nice 3784.500000000 0.999999950
result:
ok Both jury and participant found uncovered points, participant point is (3784.500000000, 0.999999950) with cover count 3785
Test #37:
score: 0
Accepted
time: 159ms
memory: 43020kb
input:
59999 0 0 10000 0 10000 3 0 0 0 3 10000 3 0 3 10000 3 10000 0 0 3 0 0 10000 0 0 3 3308 2 3307 2 0 1 5408 0 5407 0 0 1 3042 0 3043 0 0 1 7636 0 7637 0 1103 2 5994 1 5993 1 0 1 9098 0 9097 0 0 3 6152 2 6151 2 0 1 4435 0 4434 0 10000 2 6325 3 6324 3 0 1 650 0 651 0 10000 2 8112 3 8113 3 0 1 1912 0 1911...
output:
not nice 1102.500000000 1.999999950
result:
ok Both jury and participant found uncovered points, participant point is (1102.500000000, 1.999999950) with cover count 2
Test #38:
score: 0
Accepted
time: 144ms
memory: 42844kb
input:
60001 0 0 3 0 3 10000 0 0 0 10000 3 10000 0 10000 3 10000 3 0 0 10000 0 0 3 0 1 1881 2 868 1 1882 2 2906 2 2905 1 6137 0 8844 1 5737 0 8843 1 8954 2 9505 1 8953 0 9516 1 6565 1 6564 0 4875 0 4874 1 1965 3 3963 2 5668 2 5669 3 9516 2 8832 2 8831 1 2666 1 2665 2 1427 3 1768 2 4639 2 4640 2 8265 3 5237...
output:
not nice 0.500000000 9516.999999950
result:
ok Both jury and participant found uncovered points, participant point is (0.500000000, 9516.999999950) with cover count 2
Test #39:
score: 0
Accepted
time: 153ms
memory: 43180kb
input:
60000 0 0 3 0 3 10000 0 0 0 10000 3 10000 0 10000 3 10000 3 0 0 10000 0 0 3 0 2 3155 1 4940 1 4939 2 951 1 1814 2 950 0 7441 1 3317 1 3316 3 1970 3 1969 2 2137 1 7441 2 6798 2 6799 2 1261 2 1262 1 1814 0 2441 1 967 1 968 0 7441 1 7722 1 7721 3 2441 2 4874 2 4873 1 2441 0 7393 0 7394 0 919 1 371 0 92...
output:
not nice 0.999999950 2441.500000000
result:
ok Both jury and participant found uncovered points, participant point is (0.999999950, 2441.500000000) with cover count 2
Test #40:
score: 0
Accepted
time: 154ms
memory: 42828kb
input:
59998 0 0 3 0 3 10000 0 0 0 10000 3 10000 0 10000 3 10000 3 0 0 10000 0 0 3 0 3 1 2 4737 2 4738 2 9999 3 78 3 79 2 1 1 8658 1 8657 3 1 2 4262 2 4261 2 1 1 4770 1 4769 1 1 0 7668 0 7669 2 9999 3 4660 3 4661 2 1 1 5646 1 5647 1 1 0 2109 0 2110 2 1 1 1242 1 1243 2 1 1 3924 1 3923 3 1 2 3899 2 3900 2 1 ...
output:
not nice 1.999999950 1.500000000
result:
ok Both jury and participant found uncovered points, participant point is (1.999999950, 1.500000000) with cover count 2
Test #41:
score: 0
Accepted
time: 365ms
memory: 79352kb
input:
99984 0 0 10000 0 10000 10000 0 0 0 10000 10000 10000 0 10000 10000 10000 10000 0 0 10000 0 0 10000 0 7184 2872 7579 2185 7333 2617 8142 9067 8453 9193 8868 9366 3668 7600 3553 7668 3837 7497 3381 9893 2647 9919 3496 9891 6557 3873 6965 3890 6806 3885 1087 8307 1088 8473 1082 8118 3618 1711 3778 176...
output:
not nice 5118.500000000 3590.999999950
result:
ok Both jury and participant found uncovered points, participant point is (5118.500000000, 3590.999999950) with cover count 2
Test #42:
score: 0
Accepted
time: 402ms
memory: 79324kb
input:
99985 0 0 10000 0 10000 10000 0 0 0 10000 10000 10000 0 10000 10000 10000 10000 0 0 10000 0 0 10000 0 6542 2127 6713 2048 6391 2191 8335 3144 8286 3114 8381 3170 2248 8160 2300 8258 2226 8218 5446 1867 4520 2287 4579 2265 3383 3742 4105 3792 2957 3716 990 3325 997 3280 969 3110 7027 4041 6262 3974 7...
output:
not nice 2838.999999950 4262.500000000
result:
ok Both jury and participant found uncovered points, participant point is (2838.999999950, 4262.500000000) with cover count 2
Test #43:
score: 0
Accepted
time: 376ms
memory: 79584kb
input:
99985 0 0 10000 0 10000 10000 0 0 0 10000 10000 10000 0 10000 10000 10000 10000 0 0 10000 0 0 10000 0 7245 3486 7518 3164 7597 3091 4743 3651 4247 4015 4334 3936 1258 6436 303 9199 706 8030 5426 1343 5251 1401 4884 1506 9176 3070 9042 3404 8770 4101 287 7620 262 7691 297 7666 9969 9999 9873 9858 963...
output:
not nice 9969.999999950 1.500000000
result:
ok Both jury and participant found uncovered points, participant point is (9969.999999950, 1.500000000) with cover count 2
Test #44:
score: 0
Accepted
time: 11ms
memory: 8596kb
input:
9996 10000 0 9999 0 9999 9996 10000 0 9999 0 9999 1 10000 0 9999 0 9999 1 10000 0 9999 1 9999 9996 10000 0 9999 1 9999 2 10000 0 9999 2 9999 9996 10000 0 9999 3 9999 9996 10000 0 9999 3 9999 4 10000 0 9999 3 9999 4 10000 0 9999 4 9999 9996 10000 0 9999 4 9999 5 10000 0 9999 5 9999 9996 10000 0 9999 ...
output:
nice
result:
ok Both jury and participant think that everything is covered properly
Test #45:
score: 0
Accepted
time: 0ms
memory: 3964kb
input:
1 0 0 1 0 1 1
output:
not nice 0.500000000 0.000000050
result:
ok Both jury and participant found uncovered points, participant point is (0.500000000, 0.000000050) with cover count 1
Test #46:
score: 0
Accepted
time: 0ms
memory: 3904kb
input:
2 0 0 1 0 1 1 1 0 1 1 0 0
output:
not nice 0.500000000 0.000000050
result:
ok Both jury and participant found uncovered points, participant point is (0.500000000, 0.000000050) with cover count 2
Test #47:
score: 0
Accepted
time: 0ms
memory: 3808kb
input:
3 0 0 0 1 1 1 0 1 1 1 0 0 1 1 0 0 0 1
output:
nice
result:
ok Both jury and participant think that everything is covered properly
Test #48:
score: 0
Accepted
time: 0ms
memory: 3984kb
input:
3 0 0 0 1 1 1 1 1 0 1 0 0 1 0 0 0 1 1
output:
not nice 0.500000000 0.999999950
result:
ok Both jury and participant found uncovered points, participant point is (0.500000000, 0.999999950) with cover count 2
Test #49:
score: 0
Accepted
time: 13ms
memory: 8964kb
input:
9995 10000 0 9999 0 9999 9995 10000 0 9999 0 9999 1 10000 0 9999 0 9999 1 10000 0 9999 1 9999 9995 10000 0 9999 1 9999 2 10000 0 9999 2 9999 9995 10000 0 9999 3 9999 9995 10000 0 9999 3 9999 4 10000 0 9999 3 9999 4 10000 0 9999 4 9999 9995 10000 0 9999 5 9999 9995 10000 0 9999 6 9999 9995 10000 0 99...
output:
not nice 9999.000000050 4.500000000
result:
ok Both jury and participant found uncovered points, participant point is (9999.000000050, 4.500000000) with cover count 5
Test #50:
score: 0
Accepted
time: 142ms
memory: 43284kb
input:
59999 0 0 3 0 3 10000 0 0 0 10000 3 10000 0 10000 3 10000 3 0 0 10000 0 0 3 0 2 3326 1 2038 1 2037 2 10000 1 9098 1 9099 2 10000 1 3792 1 3791 2 0 3 9295 3 9296 2 3326 1 3266 1 3265 3 10000 2 1459 2 1458 1 3327 2 6973 2 6974 3 10000 2 5518 2 5517 2 0 3 1672 3 1671 3 10000 2 4116 2 4117 1 0 2 1229 2 ...
output:
not nice 1.500000000 3326.999999950
result:
ok Both jury and participant found uncovered points, participant point is (1.500000000, 3326.999999950) with cover count 2
Test #51:
score: 0
Accepted
time: 159ms
memory: 42632kb
input:
60001 0 0 10000 0 10000 3 0 0 0 3 10000 3 0 3 10000 3 10000 0 0 3 0 0 10000 0 0 3 1549 2 1550 2 5104 3 5374 2 5375 2 6535 1 6536 1 8083 2 523 3 522 3 3029 2 1037 1 2030 2 1038 1 3021 1 1950 0 3022 1 3823 1 2624 0 2623 0 1866 0 1867 0 2894 1 10000 0 9616 1 9615 1 3029 2 1644 3 1645 3 946 1 1942 2 194...
output:
not nice 5103.500000000 0.999999950
result:
ok Both jury and participant found uncovered points, participant point is (5103.500000000, 0.999999950) with cover count 2
Test #52:
score: 0
Accepted
time: 168ms
memory: 43500kb
input:
60000 0 0 10000 0 10000 3 0 0 0 3 10000 3 0 3 10000 3 10000 0 0 3 0 0 10000 0 5719 1 5460 0 5461 0 10000 0 9614 1 9615 1 950 3 828 2 949 3 719 1 4215 2 4214 2 4370 1 5139 2 4371 1 4161 3 2293 2 4160 3 3893 3 2293 2 3892 3 5719 3 4461 2 4460 2 3529 1 3530 1 4773 2 719 0 5376 1 5375 1 619 3 350 2 618 ...
output:
not nice 5718.500000000 0.999999950
result:
ok Both jury and participant found uncovered points, participant point is (5718.500000000, 0.999999950) with cover count 2
Test #53:
score: 0
Accepted
time: 143ms
memory: 44704kb
input:
59998 0 0 10000 0 10000 3 0 0 0 3 10000 3 0 3 10000 3 10000 0 0 3 0 0 10000 0 1 0 9606 1 9607 1 1 2 8457 3 8458 3 1 0 3854 1 3855 1 9999 3 2865 2 2866 2 1 2 129 3 130 3 1 2 3469 3 3468 3 1 2 2003 3 2002 3 9999 3 9731 2 9730 2 1 2 5134 3 5133 3 9999 2 6320 1 6319 1 1 1 4718 2 4717 2 1 0 9447 1 9448 1...
output:
not nice 9998.500000000 1.999999950
result:
ok Both jury and participant found uncovered points, participant point is (9998.500000000, 1.999999950) with cover count 2
Test #54:
score: 0
Accepted
time: 369ms
memory: 79272kb
input:
99981 0 0 10000 0 10000 10000 0 0 0 10000 10000 10000 0 10000 10000 10000 10000 0 0 10000 0 0 10000 0 4673 9362 2929 9314 3762 9343 6962 1159 6343 1292 7097 1119 7653 8087 4414 5422 6931 7493 1046 5685 1049 5985 1063 7259 6727 6712 7208 7177 6970 6947 1477 2831 1485 2965 1412 2482 2152 5390 2108 514...
output:
not nice 1031.500000000 127.999999950
result:
ok Both jury and participant found uncovered points, participant point is (1031.500000000, 127.999999950) with cover count 2
Test #55:
score: 0
Accepted
time: 381ms
memory: 79332kb
input:
99982 0 0 10000 0 10000 10000 0 0 0 10000 10000 10000 0 10000 10000 10000 10000 0 0 10000 0 0 10000 0 5530 933 5090 898 5462 929 8731 7171 8739 7192 8695 7103 6394 2950 6522 2411 6493 2538 7805 7161 8999 8642 8784 8377 2186 4566 2185 4772 2170 4106 2375 7128 2353 6952 2392 7198 8726 2567 8799 2871 8...
output:
not nice 6819.500000000 1011.999999950
result:
ok Both jury and participant found uncovered points, participant point is (6819.500000000, 1011.999999950) with cover count 2
Test #56:
score: 0
Accepted
time: 361ms
memory: 79232kb
input:
99982 0 0 10000 0 10000 10000 0 0 0 10000 10000 10000 0 10000 10000 10000 10000 0 0 10000 0 0 10000 0 8609 3326 8613 3340 8743 3216 7385 5311 7541 5282 7283 5327 9999 4977 9822 4813 9196 4243 9766 9686 9882 9843 9413 9214 9852 6287 9855 6270 9734 7225 4573 9072 4494 9085 4595 9079 1 0 3544 106 2547 ...
output:
not nice 9998.500000000 4977.999999950
result:
ok Both jury and participant found uncovered points, participant point is (9998.500000000, 4977.999999950) with cover count 2
Test #57:
score: 0
Accepted
time: 15ms
memory: 8512kb
input:
9996 10000 10000 10000 9999 4 9999 10000 10000 10000 9999 9999 9999 10000 10000 10000 9999 9999 9999 10000 10000 9999 9999 4 9999 10000 10000 9999 9999 9998 9999 10000 10000 9998 9999 4 9999 10000 10000 9997 9999 4 9999 10000 10000 9997 9999 9996 9999 10000 10000 9997 9999 9996 9999 10000 10000 9996...
output:
nice
result:
ok Both jury and participant think that everything is covered properly
Test #58:
score: 0
Accepted
time: 18ms
memory: 8888kb
input:
9995 10000 10000 10000 9999 5 9999 10000 10000 10000 9999 9999 9999 10000 10000 10000 9999 9999 9999 10000 10000 9999 9999 5 9999 10000 10000 9999 9999 9998 9999 10000 10000 9998 9999 5 9999 10000 10000 9997 9999 5 9999 10000 10000 9997 9999 9996 9999 10000 10000 9997 9999 9996 9999 10000 10000 9996...
output:
not nice 9747.500000000 9999.000000050
result:
ok Both jury and participant found uncovered points, participant point is (9747.500000000, 9999.000000050) with cover count 254
Test #59:
score: 0
Accepted
time: 155ms
memory: 43248kb
input:
59999 0 0 10000 0 10000 3 0 0 0 3 10000 3 0 3 10000 3 10000 0 0 3 0 0 10000 0 10000 2 7579 3 7580 3 10000 0 2742 1 2743 1 8502 2 9382 1 9383 1 0 2 7319 1 7318 1 8501 1 4054 2 4055 2 10000 0 6006 1 6007 1 10000 2 2466 3 2467 3 0 1 9556 0 9555 0 10000 2 8366 3 8365 3 10000 0 8536 1 8535 1 10000 2 7012...
output:
not nice 8501.500000000 1.000000050
result:
ok Both jury and participant found uncovered points, participant point is (8501.500000000, 1.000000050) with cover count 2
Test #60:
score: 0
Accepted
time: 148ms
memory: 42876kb
input:
60001 0 0 3 0 3 10000 0 0 0 10000 3 10000 0 10000 3 10000 3 0 0 10000 0 0 3 0 1 9425 2 8835 2 8834 2 3029 1 4490 1 4489 2 3917 2 3916 1 5052 1 8617 1 8616 2 7310 2 6865 2 6866 1 7760 3 6186 2 7930 2 7931 1 1625 0 3633 0 3634 3 7517 3 7518 2 7987 1 8460 1 8459 2 7310 2 37 1 62 1 61 2 6970 2 6971 1 77...
output:
not nice 2.500000000 6185.000000050
result:
ok Both jury and participant found uncovered points, participant point is (2.500000000, 6185.000000050) with cover count 2
Test #61:
score: 0
Accepted
time: 166ms
memory: 43308kb
input:
60000 0 0 3 0 3 10000 0 0 0 10000 3 10000 0 10000 3 10000 3 0 0 10000 0 0 3 0 2 1801 1 3278 1 3279 1 4696 2 2641 1 4695 0 8590 0 8589 1 7686 3 7051 2 9340 3 7050 3 7959 2 9340 3 7960 1 8549 1 8550 2 7826 2 6801 3 2431 3 2432 0 7994 0 7993 1 7686 2 3254 1 5104 2 3255 3 0 2 819 2 818 1 4627 2 2418 1 4...
output:
not nice 2.000000050 6800.500000000
result:
ok Both jury and participant found uncovered points, participant point is (2.000000050, 6800.500000000) with cover count 2
Test #62:
score: 0
Accepted
time: 159ms
memory: 44248kb
input:
60000 0 0 3 0 3 10000 0 0 0 10000 3 10000 0 10000 3 10000 3 0 0 10000 0 0 3 0 2 643 2 644 1 7579 0 2480 0 2479 1 1605 1 3811 0 8501 0 8502 3 1 2 9233 2 9232 0 4883 0 4882 1 3126 3 1 2 9554 2 9553 2 9999 3 90 3 89 0 8415 1 3811 0 8416 0 6391 0 6390 1 3126 3 1 2 684 2 683 2 9999 3 4349 3 4348 0 2485 0...
output:
not nice 2.000000050 9998.500000000
result:
ok Both jury and participant found uncovered points, participant point is (2.000000050, 9998.500000000) with cover count 2
Test #63:
score: 0
Accepted
time: 375ms
memory: 79892kb
input:
99980 0 0 10000 0 10000 10000 0 0 0 10000 10000 10000 0 10000 10000 10000 10000 0 0 10000 0 0 10000 0 7182 4964 7096 5060 7137 5025 516 514 187 151 434 425 7177 1716 7382 1606 6458 2102 1365 7853 1370 7787 1363 7742 1474 206 2080 299 1218 166 8442 7844 8411 7929 8681 7476 4701 275 4122 158 4683 266 ...
output:
not nice 8535.500000000 5651.000000050
result:
ok Both jury and participant found uncovered points, participant point is (8535.500000000, 5651.000000050) with cover count 2
Test #64:
score: 0
Accepted
time: 375ms
memory: 79220kb
input:
99981 0 0 10000 0 10000 10000 0 0 0 10000 10000 10000 0 10000 10000 10000 10000 0 0 10000 0 0 10000 0 2540 2533 2285 2434 2469 2503 5378 1171 5174 1199 5459 1176 7546 8988 7546 9001 7637 8880 0 10000 1696 9980 1235 9984 5950 3244 6996 2779 7176 2699 2731 4404 2799 4445 2888 4487 6133 1469 5708 1468 ...
output:
not nice 816.000000050 6440.500000000
result:
ok Both jury and participant found uncovered points, participant point is (816.000000050, 6440.500000000) with cover count 2
Test #65:
score: 0
Accepted
time: 384ms
memory: 79804kb
input:
99982 0 0 10000 0 10000 10000 0 0 0 10000 10000 10000 0 10000 10000 10000 10000 0 0 10000 0 0 10000 0 6514 7229 6730 6717 6635 6933 5608 2324 5197 1988 5470 2211 6761 5577 7375 4678 6314 6231 4075 6205 4074 6208 4039 6540 4364 7354 4303 7583 4292 7630 5857 9976 7524 9950 5931 9974 1906 9171 1697 911...
output:
not nice 3685.000000050 9998.500000000
result:
ok Both jury and participant found uncovered points, participant point is (3685.000000050, 9998.500000000) with cover count 2
Test #66:
score: 0
Accepted
time: 14ms
memory: 8700kb
input:
9996 0 10000 1 10000 1 4 0 10000 1 10000 1 9999 0 10000 1 10000 1 9999 0 10000 1 9999 1 4 0 10000 1 9999 1 9998 0 10000 1 9998 1 4 0 10000 1 9997 1 4 0 10000 1 9997 1 9996 0 10000 1 9997 1 9996 0 10000 1 9996 1 4 0 10000 1 9996 1 9995 0 10000 1 9995 1 4 0 10000 1 9994 1 4 0 10000 1 9994 1 9993 0 100...
output:
nice
result:
ok Both jury and participant think that everything is covered properly
Test #67:
score: 0
Accepted
time: 13ms
memory: 8840kb
input:
9995 0 10000 1 10000 1 5 0 10000 1 10000 1 9999 0 10000 1 10000 1 9999 0 10000 1 9999 1 5 0 10000 1 9999 1 9998 0 10000 1 9998 1 5 0 10000 1 9997 1 5 0 10000 1 9997 1 9996 0 10000 1 9997 1 9996 0 10000 1 9996 1 5 0 10000 1 9996 1 9995 0 10000 1 9995 1 5 0 10000 1 9994 1 5 0 10000 1 9994 1 9993 0 100...
output:
not nice 0.999999950 6515.500000000
result:
ok Both jury and participant found uncovered points, participant point is (0.999999950, 6515.500000000) with cover count 3485
Test #68:
score: 0
Accepted
time: 82ms
memory: 51712kb
input:
100000 0 0 1 0 1 1 0 0 0 1 1 1 0 1 1 1 1 0 0 1 0 0 1 0 0 0 1 0 0 1 1 0 0 0 0 1 0 0 1 1 0 1 0 1 1 1 1 0 1 1 0 1 1 0 0 1 1 0 0 0 1 1 0 1 1 0 1 1 0 1 1 0 0 0 1 0 1 1 1 1 0 1 1 0 1 0 1 1 0 0 0 1 1 1 0 0 1 0 0 0 0 1 0 1 1 0 1 1 1 1 0 1 1 0 1 1 1 0 0 0 0 0 0 1 1 0 1 1 0 1 0 0 0 0 0 1 1 1 0 0 1 1 0 1 1 1 0...
output:
not nice 0.500000000 0.999999950
result:
ok Both jury and participant found uncovered points, participant point is (0.500000000, 0.999999950) with cover count 49976
Test #69:
score: 0
Accepted
time: 81ms
memory: 53140kb
input:
100000 0 0 1 0 1 2 0 0 0 2 1 2 0 2 1 2 1 0 0 2 0 0 1 0 0 2 0 0 1 0 1 0 0 1 0 0 0 1 0 2 1 2 1 1 0 1 0 2 0 0 0 1 1 2 1 1 1 2 0 2 1 1 0 0 0 1 0 1 1 2 0 0 1 1 0 1 1 2 0 2 1 1 0 1 1 0 0 1 1 1 0 0 1 1 0 1 1 0 0 0 0 1 1 1 0 2 0 1 1 1 0 1 1 2 0 0 1 1 0 1 0 1 1 2 1 1 0 2 1 1 1 2 0 1 0 2 1 2 0 1 0 0 1 1 0 1 1...
output:
not nice 0.500000000 1.999999950
result:
ok Both jury and participant found uncovered points, participant point is (0.500000000, 1.999999950) with cover count 22481
Test #70:
score: 0
Accepted
time: 83ms
memory: 50960kb
input:
100000 0 0 2 0 2 1 0 0 0 1 2 1 0 1 2 1 2 0 0 1 0 0 2 0 2 0 2 1 1 1 1 0 2 1 0 1 2 1 1 1 2 0 1 1 2 1 2 0 2 0 1 0 0 1 1 0 0 1 0 0 1 0 0 0 1 1 1 1 1 0 2 1 1 0 2 0 1 1 2 1 0 0 1 1 1 1 0 1 0 0 1 1 0 0 0 1 1 1 2 0 1 0 2 0 1 0 1 1 1 1 0 1 0 0 1 1 0 1 0 0 1 0 1 1 2 1 0 1 1 1 1 0 2 0 1 0 2 1 0 1 0 0 1 0 0 0 1...
output:
not nice 1.500000000 0.999999950
result:
ok Both jury and participant found uncovered points, participant point is (1.500000000, 0.999999950) with cover count 24871
Test #71:
score: 0
Accepted
time: 80ms
memory: 54380kb
input:
100000 0 0 2 0 2 2 0 0 0 2 2 2 0 2 2 2 2 0 0 2 0 0 2 0 0 2 2 2 0 0 1 2 0 0 1 1 1 2 1 0 2 1 1 1 2 2 2 1 1 1 0 1 0 0 1 1 0 0 0 1 0 1 1 1 0 0 2 1 1 1 2 0 1 1 1 2 0 2 0 1 1 2 2 2 1 2 1 1 0 2 0 0 1 0 2 1 2 1 1 2 1 1 0 1 1 1 0 2 1 2 1 1 2 2 0 2 0 1 1 2 2 0 2 1 1 0 2 1 1 0 2 0 0 0 0 1 1 1 0 0 0 1 1 1 0 1 1...
output:
not nice 1.500000000 1.999999950
result:
ok Both jury and participant found uncovered points, participant point is (1.500000000, 1.999999950) with cover count 11329
Test #72:
score: 0
Accepted
time: 105ms
memory: 54292kb
input:
100000 0 0 3 0 3 3 0 0 0 3 3 3 0 3 3 3 3 0 0 3 0 0 3 0 0 0 2 0 2 3 2 0 1 1 2 1 2 3 1 1 0 2 2 2 1 2 1 3 0 2 1 1 1 0 1 2 2 0 3 3 2 0 3 1 2 1 1 0 0 1 2 0 0 0 0 1 1 0 1 3 0 2 0 1 0 2 1 2 0 1 1 0 1 1 0 0 2 1 3 1 3 0 3 1 1 2 2 1 2 3 1 3 1 2 0 0 0 1 1 1 2 1 2 0 3 1 1 3 0 2 2 3 0 2 1 3 0 1 3 3 2 1 2 2 3 1 2...
output:
not nice 2.500000000 2.999999950
result:
ok Both jury and participant found uncovered points, participant point is (2.500000000, 2.999999950) with cover count 6712
Test #73:
score: 0
Accepted
time: 154ms
memory: 53748kb
input:
99999 0 0 1 0 1 1 0 0 0 1 1 1 0 1 1 1 1 0 0 1 0 0 1 0 1 1 0 0 1 0 0 0 1 1 1 0 1 0 0 0 0 1 0 1 1 0 0 0 0 0 1 1 0 1 1 0 0 0 1 1 1 0 0 0 1 1 1 0 0 0 0 1 1 0 0 0 1 1 1 0 1 1 0 0 1 1 0 0 1 0 1 0 1 1 0 1 1 0 0 0 0 1 1 0 0 0 0 1 1 1 0 0 0 1 0 1 1 1 1 0 0 0 1 1 1 0 0 0 1 1 0 1 0 1 1 0 1 1 1 0 1 1 0 0 0 1 1 ...
output:
nice
result:
ok Both jury and participant think that everything is covered properly
Test #74:
score: 0
Accepted
time: 152ms
memory: 52344kb
input:
99999 0 0 1 0 1 2 0 0 0 2 1 2 0 2 1 2 1 0 0 2 0 0 1 0 1 1 0 2 1 2 0 1 0 0 1 0 1 0 0 2 0 1 1 1 0 1 1 0 1 1 0 1 1 2 1 0 0 0 1 1 0 0 1 1 1 0 1 0 0 1 0 0 0 2 1 2 0 1 1 0 0 0 0 1 0 0 1 1 1 2 1 1 1 0 0 0 1 1 0 1 1 0 1 1 0 1 1 2 0 0 1 1 1 0 0 0 1 1 0 1 1 2 0 1 1 1 1 1 1 0 0 0 0 2 1 2 0 1 0 0 1 0 0 1 1 0 0 ...
output:
nice
result:
ok Both jury and participant think that everything is covered properly
Test #75:
score: 0
Accepted
time: 142ms
memory: 53772kb
input:
99999 0 0 2 0 2 1 0 0 0 1 2 1 0 1 2 1 2 0 0 1 0 0 2 0 1 0 2 1 0 1 0 1 0 0 1 1 1 0 2 0 1 1 1 1 1 0 2 0 1 1 2 1 2 0 2 1 1 0 1 1 1 0 1 1 2 0 2 0 2 1 1 0 2 0 2 1 1 0 2 1 1 0 1 1 0 1 2 0 1 0 1 1 2 1 2 0 2 0 2 1 1 1 0 1 1 0 0 0 2 0 1 1 1 0 2 1 1 1 2 0 1 0 1 1 0 0 1 1 0 0 0 1 0 0 1 0 1 1 1 1 2 0 0 1 1 1 2 ...
output:
nice
result:
ok Both jury and participant think that everything is covered properly
Test #76:
score: 0
Accepted
time: 151ms
memory: 51428kb
input:
99999 0 0 2 0 2 2 0 0 0 2 2 2 0 2 2 2 2 0 0 2 0 0 2 0 2 1 0 0 2 0 0 2 0 1 1 2 1 0 2 2 1 1 2 1 1 2 1 0 1 1 1 2 0 2 1 1 1 2 2 0 1 1 2 0 2 1 1 1 0 1 2 0 2 1 1 1 2 2 1 0 1 1 0 1 0 2 1 2 2 1 1 2 1 1 0 1 2 1 1 1 0 0 0 2 1 2 1 1 2 1 1 2 1 1 1 1 2 2 1 2 2 0 1 1 2 1 1 0 1 1 2 0 2 1 2 2 1 1 0 0 1 1 0 1 2 2 1 ...
output:
nice
result:
ok Both jury and participant think that everything is covered properly
Test #77:
score: 0
Accepted
time: 154ms
memory: 52784kb
input:
99999 0 0 3 0 3 3 0 0 0 3 3 3 0 3 3 3 3 0 0 3 0 0 3 0 3 2 0 2 0 3 0 2 0 3 3 1 0 1 1 0 2 0 0 1 0 2 1 3 2 1 0 1 2 3 2 0 0 3 0 1 1 2 2 2 0 3 1 0 0 0 1 1 1 2 0 3 1 3 2 0 2 1 1 1 1 3 2 3 1 2 3 1 2 1 2 0 2 0 1 0 1 1 2 0 1 1 1 0 2 2 3 2 3 3 3 2 2 2 3 1 2 0 2 1 3 2 1 0 3 1 2 0 3 2 2 2 3 1 0 0 0 1 1 0 1 2 1 ...
output:
nice
result:
ok Both jury and participant think that everything is covered properly
Extra Test:
score: 0
Extra Test Passed