QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #737638 | #2134. Balanced Illumination | chenyitaoooo | AC ✓ | 91ms | 8108kb | C++23 | 1.9kb | 2024-11-12 16:28:51 | 2024-11-12 16:28:52 |
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
Test #1:
score: 100
Accepted
time: 1ms
memory: 5956kb
input:
3
output:
000 100 101 111 110 010 011 001
result:
ok n = 3, mihch = 2, maxch = 4
Test #2:
score: 0
Accepted
time: 1ms
memory: 8044kb
input:
4
output:
0000 0010 0011 1011 1111 1110 1010 1000 1100 0100 0110 0111 0101 1101 1001 0001
result:
ok n = 4, mihch = 4, maxch = 4
Test #3:
score: 0
Accepted
time: 0ms
memory: 3836kb
input:
1
output:
0 1
result:
ok n = 1, mihch = 2, maxch = 2
Test #4:
score: 0
Accepted
time: 1ms
memory: 5932kb
input:
2
output:
00 10 11 01
result:
ok n = 2, mihch = 2, maxch = 2
Test #5:
score: 0
Accepted
time: 1ms
memory: 7984kb
input:
5
output:
00000 10000 10010 00010 00011 10011 10111 10110 10100 11100 11110 11111 11011 01011 01010 11010 11000 01000 01100 00100 00110 01110 01111 00111 00101 01101 01001 11001 11101 10101 10001 00001
result:
ok n = 5, mihch = 6, maxch = 8
Test #6:
score: 0
Accepted
time: 1ms
memory: 7956kb
input:
6
output:
000000 000010 000011 001011 001010 001000 001100 001110 001111 101111 101110 101100 111100 111000 111010 111110 111111 111011 101011 101010 101000 100000 110000 110010 100010 100011 110011 010011 010010 010000 011000 011100 010100 110100 100100 000100 000110 100110 110110 010110 011110 011010 011011...
result:
ok n = 6, mihch = 10, maxch = 12
Test #7:
score: 0
Accepted
time: 1ms
memory: 7900kb
input:
7
output:
0000000 0000010 0000011 1000011 1000010 1000000 1001000 1001010 1001011 0001011 0001010 0001000 0001100 0001110 0001111 1001111 1001110 1001100 1011100 1011000 1011010 1011110 1011111 1011011 1010011 1010010 1010000 1110000 1110010 1110011 1111011 1111111 1111110 1111010 1111000 1111100 1101100 1101...
result:
ok n = 7, mihch = 18, maxch = 20
Test #8:
score: 0
Accepted
time: 1ms
memory: 7996kb
input:
8
output:
00000000 00000010 00000011 00001011 00001010 00001000 00001100 00001110 00001111 00101111 00101110 00101100 00101000 00101010 00101011 00100011 00100010 00100000 00110000 00110010 00110011 00111011 00111111 00111110 00111010 00111000 00111100 10111100 10111000 10111010 10111110 10111111 10111011 101...
result:
ok n = 8, mihch = 32, maxch = 32
Test #9:
score: 0
Accepted
time: 0ms
memory: 7984kb
input:
9
output:
000000000 000000010 000000011 000001011 000001010 000001000 000001100 000001110 000001111 100001111 100001110 100001100 100001000 100001010 100001011 100000011 100000010 100000000 100100000 100100010 100100011 100101011 100101010 100101000 100101100 100101110 100101111 000101111 000101110 000101100 ...
result:
ok n = 9, mihch = 56, maxch = 58
Test #10:
score: 0
Accepted
time: 0ms
memory: 7936kb
input:
10
output:
0000000000 0000000010 0000000011 0000001011 0000001010 0000001000 0000001100 0000001110 0000001111 0000101111 0000101110 0000101100 0000101000 0000101010 0000101011 0000100011 0000100010 0000100000 0000110000 0000110010 0000110011 0000111011 0000111010 0000111000 0000111100 0000111110 0000111111 001...
result:
ok n = 10, mihch = 102, maxch = 104
Test #11:
score: 0
Accepted
time: 2ms
memory: 7940kb
input:
11
output:
00000000000 00000000010 00000000011 00000001011 00000001010 00000001000 00000001100 00000001110 00000001111 00000101111 00000101110 00000101100 00000101000 00000101010 00000101011 00000100011 00000100010 00000100000 00000110000 00000110010 00000110011 00000111011 00000111010 00000111000 00000111100 ...
result:
ok n = 11, mihch = 186, maxch = 188
Test #12:
score: 0
Accepted
time: 3ms
memory: 8044kb
input:
12
output:
000000000000 000000000010 000000000011 000000001011 000000001010 000000001000 000000001100 000000001110 000000001111 000000101111 000000101110 000000101100 000000101000 000000101010 000000101011 000000100011 000000100010 000000100000 000000110000 000000110010 000000110011 000000111011 000000111010 0...
result:
ok n = 12, mihch = 340, maxch = 342
Test #13:
score: 0
Accepted
time: 5ms
memory: 8008kb
input:
13
output:
0000000000000 0000000000010 0000000000011 0000000001011 0000000001010 0000000001000 0000000001100 0000000001110 0000000001111 0000000101111 0000000101110 0000000101100 0000000101000 0000000101010 0000000101011 0000000100011 0000000100010 0000000100000 0000000110000 0000000110010 0000000110011 000000...
result:
ok n = 13, mihch = 630, maxch = 632
Test #14:
score: 0
Accepted
time: 3ms
memory: 8012kb
input:
14
output:
00000000000000 00000000000010 00000000000011 00000000001011 00000000001010 00000000001000 00000000001100 00000000001110 00000000001111 00000000101111 00000000101110 00000000101100 00000000101000 00000000101010 00000000101011 00000000100011 00000000100010 00000000100000 00000000110000 00000000110010 ...
result:
ok n = 14, mihch = 1170, maxch = 1172
Test #15:
score: 0
Accepted
time: 17ms
memory: 8016kb
input:
15
output:
000000000000000 000000000000010 000000000000011 000000000001011 000000000001010 000000000001000 000000000001100 000000000001110 000000000001111 000000000101111 000000000101110 000000000101100 000000000101000 000000000101010 000000000101011 000000000100011 000000000100010 000000000100000 000000000110...
result:
ok n = 15, mihch = 2184, maxch = 2186
Test #16:
score: 0
Accepted
time: 43ms
memory: 8024kb
input:
16
output:
0000000000000000 0000000000000010 0000000000000011 0000000000001011 0000000000001010 0000000000001000 0000000000001100 0000000000001110 0000000000001111 0000000000101111 0000000000101110 0000000000101100 0000000000101000 0000000000101010 0000000000101011 0000000000100011 0000000000100010 00000000001...
result:
ok n = 16, mihch = 4096, maxch = 4096
Test #17:
score: 0
Accepted
time: 91ms
memory: 8108kb
input:
17
output:
00000000000000000 00000000000000010 00000000000000011 00000000000001011 00000000000001010 00000000000001000 00000000000001100 00000000000001110 00000000000001111 00000000000101111 00000000000101110 00000000000101100 00000000000101000 00000000000101010 00000000000101011 00000000000100011 000000000001...
result:
ok n = 17, mihch = 7710, maxch = 7712