QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#474364 | #3098. Ancient Machine | egypt_ioi2024b_04 | 5 | 34ms | 9884kb | C++20 | 2.7kb | 2024-07-12 17:39:56 | 2024-07-12 17:39:56 |
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: 5
Accepted
Test #1:
score: 100
Accepted
time: 0ms
memory: 3856kb
input:
18 Y X Y Z X Z X X Z Z Y Y Z Y Y Z X X
output:
30 100110101110010000000000000000
input:
30 100110101110010000000000000000
output:
0 30 3
result:
ok n = 18, D = 30, L = 3
Test #2:
score: 100
Accepted
time: 0ms
memory: 3764kb
input:
18 X Z X Y Y Y X Z X Y Z Z Z Z Y Z Z Y
output:
30 011000101010001000000000000000
input:
30 011000101010001000000000000000
output:
0 30 3
result:
ok n = 18, D = 30, L = 3
Test #3:
score: 100
Accepted
time: 0ms
memory: 3800kb
input:
18 Y Z Z Y Z X X Z Y Y Z Z Z Y X X Z Y
output:
30 001011110000001000000000000000
input:
30 001011110000001000000000000000
output:
0 30 2
result:
ok n = 18, D = 30, L = 2
Test #4:
score: 100
Accepted
time: 0ms
memory: 3756kb
input:
18 X Z Z X Z X X Z X Y Y X X Z X Y Z X
output:
30 101010101010001000000000000000
input:
30 101010101010001000000000000000
output:
0 30 2
result:
ok n = 18, D = 30, L = 2
Test #5:
score: 100
Accepted
time: 0ms
memory: 3800kb
input:
18 X Y X Y Y X X Z Y Z Y X Z Y Y X X Z
output:
30 011011110000111000000000000000
input:
30 011011110000111000000000000000
output:
0 30 5
result:
ok n = 18, D = 30, L = 5
Test #6:
score: 100
Accepted
time: 0ms
memory: 3796kb
input:
18 X X Y Z X Y Y Y X X Z X X X Z X Z Z
output:
30 011000000111111000000000000000
input:
30 011000000111111000000000000000
output:
0 30 2
result:
ok n = 18, D = 30, L = 2
Test #7:
score: 100
Accepted
time: 0ms
memory: 3860kb
input:
3 X Y Z
output:
30 101000000000000000000000000000
input:
30 101000000000000000000000000000
output:
0 30 1
result:
ok n = 3, D = 30, L = 1
Test #8:
score: 100
Accepted
time: 0ms
memory: 3760kb
input:
3 Z Y X
output:
30 001000000000000000000000000000
input:
30 001000000000000000000000000000
output:
0 30 0
result:
ok n = 3, D = 30, L = 0
Test #9:
score: 100
Accepted
time: 0ms
memory: 3764kb
input:
18 X X X X X X X X X X X X X X X X X X
output:
30 111110000101011000000000000000
input:
30 111110000101011000000000000000
output:
0 30 0
result:
ok n = 18, D = 30, L = 0
Test #10:
score: 100
Accepted
time: 0ms
memory: 3756kb
input:
18 Y Y Y Y Y Y Y Y Y Y Y Y Y Y Y Y Y Y
output:
30 000000000000000000000000000000
input:
30 000000000000000000000000000000
output:
0 30 0
result:
ok n = 18, D = 30, L = 0
Test #11:
score: 100
Accepted
time: 0ms
memory: 3856kb
input:
18 Z Z Z Z Z Z Z Z Z Z Z Z Z Z Z Z Z Z
output:
30 000000000000000000000000000000
input:
30 000000000000000000000000000000
output:
0 30 0
result:
ok n = 18, D = 30, L = 0
Subtask #2:
score: 0
Wrong Answer
Test #12:
score: 0
Wrong Answer
time: 34ms
memory: 9884kb
input:
100000 X Z X Z Z X Y Z Y X Y X Z Z Z Y X Z Y X Y Y X Y Y Y Z Y Z Z Y X X Y X X Y Y X X X Z Y Y Y Z Z Z Z Y X Y Y Z Z Z X Y Z X X X X Y X Y X X Z X Z Z Z X Y X X X Z X Z X X X Y Y Y Y Z X X Y Z Y Y X Z X Z Z Z Z Z Y Z Y X Y Y Y Y X Z Z Y Z Z Y Z Z Z X Z Z X X Z Z Z Z X X Z Y Y Z Y Y Z Z Y Y Z Y Z Y Z...
output:
75000 000101010001101010011100010000000001010010100101000010000100001111110101110111001100100100100101011101000011010000101011010110101110110010010100001001111010000001111100000000000011000000001101011010100010000101011111100101011000011000100110010000010110100110000011010110101110000011110110101100...
input:
75000 000101010001101010011100010000000001010010100101000010000100001111110101110111001100100100100101011101000011010000101011010110101110110010010100001001111010000001111100000000000011000000001101011010100010000101011111100101011000011000100110010000010110100110000011010110101110000011110110101100...
output:
0 75000 9654
result:
wrong answer your query is valid but your solution is not optimal: read 9654 but expected 22133