QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#693252 | #9463. 基础 ABC 练习题 | Shui_Dream | 31.6 | 2391ms | 6916kb | C++23 | 1.5kb | 2024-10-31 15:48:44 | 2024-10-31 15:48:51 |
Due to the privacy settings of the submitter, you are not allowed to view this code.
Details
Tip: Click on the bar to expand more detailed information
Subtask #1:
score: 15.8
Acceptable Answer
Test #1:
score: 15.8
Acceptable Answer
time: 2385ms
memory: 6844kb
input:
60 1 1 11 11 ABC 2 111 111 CABABC 3 1111 1111 CAABBCBAC 4 11111 11111 BACBBACBACAC 5 111111 111111 CABCCBBAABCCBAA 6 1111111 1111111 ABABABCACBCBCCACBA 7 11111111 11111111 BCAABACBBCBBABCCAACAC 8 111111111 111111111 CCBCBBBCAABCBCAAAAACBCBA 9 1111111111 1111111111 CCCCACABCBABAABCCAABABBCBBA 10 1111...
output:
1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1
result:
points 0.79 the max n you choose to answer is 39
Test #2:
score: 15.8
Acceptable Answer
time: 2349ms
memory: 5444kb
input:
60 1 1 11 11 CBA 2 111 111 BACACB 3 1111 1111 BCBCACABA 4 11111 11111 CCBACABBBCAA 5 111111 111111 BCACBBABBCCAACA 6 1111111 1111111 BBCBACCAACBCBCAABA 7 11111111 11111111 ACBCCBBAABAABCACCACBB 8 111111111 111111111 BAACACBACCCBAACCBABABBCB 9 1111111111 1111111111 BABCBCAAAAABBCCCACBCBBABACC 10 1111...
output:
0 0 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1
result:
points 0.79 the max n you choose to answer is 39
Test #3:
score: 15.8
Acceptable Answer
time: 2347ms
memory: 6136kb
input:
60 1 1 11 11 BCA 2 111 111 BCABCA 3 1111 1111 CBACCAABB 4 11111 11111 BACBCBBCCAAA 5 111111 111111 BCCCBABACCBABAA 6 1111111 1111111 ACAACBABABBCACBCCB 7 11111111 11111111 BBBCABCCCAABCACBACAAB 8 111111111 111111111 ACCACAABACBAABBCBCBBACBC 9 1111111111 1111111111 BCCBACBBACCCBCCAABAACABAABB 10 1111...
output:
1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1
result:
points 0.79 the max n you choose to answer is 39
Test #4:
score: 15.8
Acceptable Answer
time: 2355ms
memory: 6616kb
input:
60 1 1 11 11 BCA 2 111 111 ACABCB 3 1111 1111 BABCABCCA 4 11111 11111 CCABACABBACB 5 111111 111111 ABBBCBBCACCAACA 6 1111111 1111111 CACBABCABCCBABAACB 7 11111111 11111111 BACBCABACBBCCCBAAACAB 8 111111111 111111111 CABABBCAACABCBACBABACBCC 9 1111111111 1111111111 BCBAACBABABCBACBABABCCACACC 10 1111...
output:
1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1
result:
points 0.79 the max n you choose to answer is 39
Test #5:
score: 15.8
Acceptable Answer
time: 2363ms
memory: 5572kb
input:
60 1 1 11 11 ABC 2 111 111 BBCACA 3 1111 1111 ACBBCBAAC 4 11111 11111 ABACACCCABBB 5 111111 111111 ACCCCCAAABABBBB 6 1111111 1111111 ABAABBBBCCCCCCAABA 7 11111111 11111111 ACBBBACCCCCCAABABBBAA 8 111111111 111111111 CAAABAAACCCCBBCBBBCACBAB 9 1111111111 1111111111 ABAAACBBCCCCCCCBAAABAACBBBB 10 1111...
output:
1 1 0 0 0 1 1 0 1 1 1 1 1 0 1 1 1 0 0 0 0 1 1 1 0 1 1 1 1 1 0 0 1 0 1 0 1 0 0 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1
result:
points 0.79 the max n you choose to answer is 39
Test #6:
score: 15.8
Acceptable Answer
time: 2359ms
memory: 5500kb
input:
60 1 1 11 11 BCA 2 111 111 ACCBAB 3 1111 1111 BACCACBBA 4 11111 11111 AAABBCBCBACC 5 111111 111111 AABBBBCCBCCAACA 6 1111111 1111111 AAACCBCCCAABACBBBB 7 11111111 11111111 AAACACCACBBAABBCBCCBB 8 111111111 111111111 AAACAAABBBBBBBCBACCCACCC 9 1111111111 1111111111 BBCCACCCACCACCBAABBAAAABBBB 10 1111...
output:
1 0 0 1 1 0 1 1 1 1 1 0 0 0 1 1 1 0 0 1 0 1 1 1 1 1 1 0 1 1 1 1 1 0 0 0 0 0 1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1
result:
points 0.79 the max n you choose to answer is 39
Test #7:
score: 15.8
Acceptable Answer
time: 2363ms
memory: 6624kb
input:
60 1 1 11 11 BCA 2 111 111 ACCABB 3 1111 1111 CAABBBCAC 4 11111 11111 BBCCBCCABAAA 5 111111 111111 BAABBBCCCCCAABA 6 1111111 1111111 AACACCCCBABBBCAABB 7 11111111 11111111 AACBBCBBBCCCCCAAABBAA 8 111111111 111111111 AAAABBCBBBBCBBCCCCCCAAAA 9 1111111111 1111111111 ABBBBBBBBCCBCAACCACAACCAAAC 10 1111...
output:
1 0 1 1 1 0 1 1 1 1 0 1 1 0 1 1 0 0 1 0 1 1 0 1 1 0 0 0 0 1 1 0 0 1 0 1 1 1 0 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1
result:
points 0.79 the max n you choose to answer is 39
Test #8:
score: 15.8
Acceptable Answer
time: 2360ms
memory: 6252kb
input:
60 1 1 11 11 ABC 2 111 111 AABCBC 3 1111 1111 ABAACBBCC 4 11111 11111 AABCCBBBCACA 5 111111 111111 AAACCABBBACBCCB 6 1111111 1111111 AABBBBBBCCACAACACC 7 11111111 11111111 AAAABBBBBBCCACCCCCBAA 8 111111111 111111111 ACCBABBABBBBBCCCACCCAAAA 9 1111111111 1111111111 BAAAABCCCCCCCBBAABAACABCBBB 10 1111...
output:
1 1 1 0 1 1 1 1 0 1 0 1 1 1 0 1 1 1 0 0 0 0 1 0 1 0 0 1 1 0 0 1 0 0 0 1 1 0 1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1
result:
points 0.79 the max n you choose to answer is 39
Test #9:
score: 15.8
Acceptable Answer
time: 2391ms
memory: 6288kb
input:
60 1 1 11 11 CAB 2 111 111 CCAABB 3 1111 1111 ACCCABBAB 4 11111 11111 AAABBBBCCACC 5 111111 111111 BCACCCCBAAAABBB 6 1111111 1111111 CAAACABABACCCBCBBB 7 11111111 11111111 ACAAACBCCCCBCAABBABBB 8 111111111 111111111 ACCAACACCCCCABABAABBBBBB 9 1111111111 1111111111 AACAAAAAACBCCBCBACBBBBBBCCC 10 1111...
output:
1 1 0 1 1 0 0 0 0 1 1 0 0 1 1 0 1 1 1 1 0 0 1 0 1 1 0 1 1 1 1 0 0 0 0 1 0 0 1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1
result:
points 0.79 the max n you choose to answer is 39
Test #10:
score: 15.8
Acceptable Answer
time: 2365ms
memory: 6880kb
input:
60 1 1 11 11 BCA 2 111 111 ACACBB 3 1111 1111 AABCCCABB 4 11111 11111 CBCCCABABABA 5 111111 111111 ACACCCAABBCBABB 6 1111111 1111111 BACAAAACCBABCBCBCB 7 11111111 11111111 AAAAABBBBCCBBCCCCACAB 8 111111111 111111111 AACCCCCCABAAACAABCBBBBBB 9 1111111111 1111111111 AABAAAABCCCCABCCCABBCCABBBB 10 1111...
output:
1 0 0 1 1 0 1 1 0 1 0 0 0 0 1 0 1 0 1 1 0 1 1 0 1 1 0 1 1 0 0 1 0 1 0 1 0 1 1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1
result:
points 0.79 the max n you choose to answer is 39
Test #11:
score: 15.8
Acceptable Answer
time: 2361ms
memory: 6516kb
input:
60 1 1 11 11 BCA 2 111 111 CBBCAA 3 1111 1111 AABABCCCB 4 11111 11111 BABCBBCAAACC 5 111111 111111 AAACBBBBBCAACCC 6 1111111 1111111 BBBBBCCCCCCAABAAAA 7 11111111 11111111 BAAAABAACCCABBCCBBBCC 8 111111111 111111111 ABABBBBBCBCCCACCCCAAABAA 9 1111111111 1111111111 AAAABBAABCABACCCACCCBBCBCBB 10 1111...
output:
1 0 0 0 0 1 0 1 0 0 1 0 1 0 1 1 1 0 1 0 0 0 1 1 1 1 0 1 1 0 1 0 0 0 0 1 0 1 0 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1
result:
points 0.79 the max n you choose to answer is 39
Subtask #2:
score: 15.8
Acceptable Answer
Dependency #1:
79%
Acceptable Answer
Test #12:
score: 15.8
Acceptable Answer
time: 2119ms
memory: 6172kb
input:
60 2 1 01 11 ABC 2 101 001 ACBABC 3 0011 1000 AAACBBCBC 4 11100 00100 BACABCABACBC 5 001101 110010 ACBABCCABBCCAAB 6 0101010 1000011 CABBAAACACBBCCABCB 7 10010111 10100111 CABAAACBBAACBCACBBBCC 8 100101000 100000110 BACBCACBBAABCCCABCBAACBA 9 1100010100 0111110011 CAABCBBABCACBCACABCABAACBBC 10 0001...
output:
1 0 0 1 1 0 1 0 1 1 0 1 1 0 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1
result:
points 0.79 the max n you choose to answer is 39
Test #13:
score: 15.8
Acceptable Answer
time: 2098ms
memory: 6912kb
input:
60 2 1 01 01 CAB 2 011 101 ABCCBA 3 1111 0000 CBBAACCBA 4 00011 10011 BCCBCCABABAA 5 011111 111011 ACBBABCBCCAACBA 6 1011101 1101000 CBABBCACBAABABCACC 7 00001111 11010100 BCACAABCBBBCCABABCACA 8 110110100 010010100 ABAABCABCABAACCCCBBBBCCA 9 0000111111 1011100011 BAAABBCCABBBBCABACBACACCACC 10 0011...
output:
0 0 0 0 1 1 0 0 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1
result:
points 0.79 the max n you choose to answer is 39
Test #14:
score: 15.8
Acceptable Answer
time: 2111ms
memory: 6172kb
input:
60 2 1 01 00 ABC 2 111 000 CAABBC 3 0101 0011 CAACBCBAB 4 11011 01001 CABBCAACBBCA 5 000010 010100 BCCCACAAACBBBBA 6 0011011 0011000 BCACCBAAAAABCBCBBC 7 11000001 11111111 AACBCABACCBBCABCCBAAB 8 111010100 111101010 CBABCACBABAACBABCCCBCAAB 9 1001111111 1011000111 CAABCACCABBBABBCACCABBCAACB 10 0011...
output:
0 0 0 1 0 0 0 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1
result:
points 0.79 the max n you choose to answer is 39
Test #15:
score: 15.8
Acceptable Answer
time: 2113ms
memory: 6112kb
input:
60 2 1 00 10 BCA 2 110 000 BCAABC 3 0111 1001 CACAABBBC 4 10101 00000 ACCBCAABBACB 5 010001 100001 BBCBBAACCBACACA 6 0100101 0100010 CCAAAABCCAABBCBBBC 7 10010000 10010011 BCBCACBCBAAAABCABBCCA 8 001101111 110010111 CABACABCACBBABCBCABACABC 9 1000111100 1011101001 ACBCABABBCCBABCCAAACBBBACAC 10 1111...
output:
0 0 1 0 0 0 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1
result:
points 0.79 the max n you choose to answer is 39
Test #16:
score: 15.8
Acceptable Answer
time: 418ms
memory: 6268kb
input:
60 2 1 10 11 CAB 2 110 100 AABBCC 3 0100 0110 CAABCBABC 4 01010 01000 BCBCABACBCAA 5 001110 100000 AAABBCCCABCBABC 6 1000000 1101100 ACCBACBCAABCAABBCB 7 11011110 01000000 AAAAABABBBCBBBACCCCCC 8 101000000 010000000 ACBABBCCCCCCCABAAABAABBB 9 1000000000 1000000000 CCCCCCCCCAABAAABABBBABBAABB 10 0111...
output:
1 0 1 0 1 0 1 1 1 1 1 1 1 1 0 0 1 0 1 1 1 1 1 0 1 1 1 0 0 1 1 1 1 0 1 0 1 1 1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1
result:
points 0.79 the max n you choose to answer is 39
Test #17:
score: 15.8
Acceptable Answer
time: 222ms
memory: 5584kb
input:
60 2 1 01 10 ABC 2 100 100 BCABCA 3 1000 1100 CABACCBAB 4 11001 10000 AABCBACABBCC 5 110000 101110 BACBCAABCABCBCA 6 1110000 1111100 AABBBBCABCCCCABAAC 7 10110000 11100000 AAACCABBCAABCBBABBCCC 8 001111100 011000000 ABAACAAAACABCBCBBBBBCCCC 9 0110000000 1111000000 AACBBACBBBCBCABACACBCAABCCA 10 1111...
output:
1 0 0 1 1 1 1 1 1 0 0 1 1 1 1 1 1 1 0 1 0 0 0 1 1 1 1 1 0 1 0 1 1 1 1 1 0 1 1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1
result:
points 0.79 the max n you choose to answer is 39
Test #18:
score: 15.8
Acceptable Answer
time: 306ms
memory: 6916kb
input:
60 2 1 10 11 ABC 2 100 100 CABCAB 3 1000 1000 CCABCABAB 4 11100 10000 ACACBABCABCB 5 111101 100000 AABCABCBACABBCC 6 1000000 0100000 BCACCCCCABAAABBBBA 7 10101110 11000000 AAABBCBBCACCCABBAACBC 8 111110000 001100000 ACBBCBBCABACCACBBABAACCA 9 1110000000 1111110000 CAAACBCCBBAAABCCBACABACCBBB 10 1100...
output:
0 1 1 1 1 1 1 1 1 0 0 1 1 0 1 0 0 1 0 1 0 0 0 1 1 0 1 1 0 0 0 1 1 1 1 1 1 0 1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1
result:
points 0.79 the max n you choose to answer is 39
Test #19:
score: 15.8
Acceptable Answer
time: 334ms
memory: 6196kb
input:
60 2 1 11 10 ABC 2 100 110 BCABCA 3 1000 1111 BBCBACCAA 4 10000 10011 BCABCABCABCA 5 011111 100000 AABCBCABACABCBC 6 1110000 1000000 CAAACCCBBBCAACABBB 7 10000000 01000000 ABBCACCCABBACABACBBAC 8 110100011 100000000 AABBCABCCAABBCABCABCABCC 9 1111011100 1100000000 AAACABBBBBCACABCCBABCACBCCA 10 0111...
output:
1 1 1 1 1 1 0 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 0 1 1 1 1 1 1 1 0 1 1 0 0 1 1 1 1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1
result:
points 0.79 the max n you choose to answer is 39
Test #20:
score: 15.8
Acceptable Answer
time: 396ms
memory: 6060kb
input:
60 2 1 10 10 CAB 2 110 100 ABCACB 3 1000 1000 CABCABCAB 4 10111 10000 CABCABCABCAB 5 100000 110000 BCCAABCBCABACAB 6 1000000 1111000 CCCABACAABBCABCABB 7 10000000 11000110 BBCBBBCCACCCBABAAACAA 8 110000000 100000000 AACBCABCABBACCABCBCAABBC 9 1000000000 1100000000 BBCCACACCCBBACBCCABABAAAABB 10 1111...
output:
1 1 1 1 1 1 1 0 0 1 1 0 0 1 0 1 1 1 1 1 1 1 1 1 1 1 1 0 1 0 1 1 1 1 1 1 0 0 1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1
result:
points 0.79 the max n you choose to answer is 39
Test #21:
score: 15.8
Acceptable Answer
time: 360ms
memory: 6172kb
input:
60 2 1 10 10 CAB 2 110 100 CABCAB 3 0111 1000 CABCABCAB 4 11010 11000 AAABBBCBACCC 5 110000 100000 ACBACABCBABCABC 6 1111000 1111000 AAABBBBBCACCCAABCC 7 11011100 01000000 AAAAACCBCBCBBBCACACBB 8 111000000 111010000 AAABBBBBCCCCCCCABACABABA 9 1011100010 1000000000 AAABAABAABBABBCCCCBCCCCBACB 10 1111...
output:
1 1 1 1 1 1 0 0 1 0 1 0 1 1 1 1 0 1 1 1 0 0 1 1 1 1 0 0 1 1 0 1 0 0 1 1 0 1 1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1
result:
points 0.79 the max n you choose to answer is 39
Subtask #3:
score: 0
Time Limit Exceeded
Test #22:
score: 0
Time Limit Exceeded
input:
60 3 1 11 11 ??? 2 111 111 ?????? 3 1111 1111 ????????? 4 11111 11111 ???????????? 5 111111 111111 ??????????????? 6 1111111 1111111 ?????????????????? 7 11111111 11111111 ????????????????????? 8 111111111 111111111 ???????????????????????? 9 1111111111 1111111111 ??????????????????????????? 10 1111...
output:
result:
Subtask #4:
score: 0
Skipped
Dependency #1:
79%
Acceptable Answer
Dependency #3:
0%
Subtask #5:
score: 0
Skipped
Dependency #1:
79%
Acceptable Answer
Dependency #2:
79%
Acceptable Answer
Dependency #3:
0%