QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #740846 | #2134. Balanced Illumination | qiuzx | AC ✓ | 5ms | 4200kb | C++20 | 1.9kb | 2024-11-13 11:48:36 | 2024-11-13 11:48:37 |
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: 0ms
memory: 3572kb
input:
3
output:
000 100 110 010 011 111 101 001
result:
ok n = 3, mihch = 2, maxch = 4
Test #2:
score: 0
Accepted
time: 0ms
memory: 3608kb
input:
4
output:
0000 1000 1010 1011 1111 1110 1100 0100 0101 1101 1001 0001 0011 0111 0110 0010
result:
ok n = 4, mihch = 4, maxch = 4
Test #3:
score: 0
Accepted
time: 0ms
memory: 3896kb
input:
1
output:
0 1
result:
ok n = 1, mihch = 2, maxch = 2
Test #4:
score: 0
Accepted
time: 0ms
memory: 3656kb
input:
2
output:
00 10 11 01
result:
ok n = 2, mihch = 2, maxch = 2
Test #5:
score: 0
Accepted
time: 0ms
memory: 3652kb
input:
5
output:
00000 10000 10010 10011 11011 11010 11000 01000 01100 01110 01010 01011 01111 11111 10111 10110 11110 11100 10100 00100 00101 10101 11101 01101 01001 11001 10001 00001 00011 00111 00110 00010
result:
ok n = 5, mihch = 6, maxch = 8
Test #6:
score: 0
Accepted
time: 0ms
memory: 3676kb
input:
6
output:
000000 100000 100010 100011 101011 101010 101000 101100 101110 101111 111111 111110 111100 111000 111010 111011 110011 110010 110000 010000 010010 010011 010111 110111 100111 000111 001111 011111 011011 011010 011110 001110 000110 100110 110110 010110 010100 110100 100100 000100 001100 011100 011000...
result:
ok n = 6, mihch = 10, maxch = 12
Test #7:
score: 0
Accepted
time: 0ms
memory: 3604kb
input:
7
output:
0000000 1000000 1000010 1000011 1001011 1001010 1001000 1001100 1001110 1001111 1101111 1101110 1101100 1101000 1101010 1101011 1100011 1100010 1100000 0100000 0100010 0100011 0110011 0111011 0111010 0110010 0110000 0111000 0101000 0101010 0101011 0101111 0111111 0111110 0101110 0101100 0111100 1111...
result:
ok n = 7, mihch = 18, maxch = 20
Test #8:
score: 0
Accepted
time: 1ms
memory: 3604kb
input:
8
output:
00000000 10000000 10000010 10000011 10001011 10001010 10001000 10001100 10001110 10001111 10101111 10101110 10101100 10101000 10101010 10101011 10100011 10100010 10100000 10110000 10110010 10110011 10111011 10111010 10111000 10111100 10111110 10111111 11111111 11111110 11111100 11111000 11110000 111...
result:
ok n = 8, mihch = 32, maxch = 32
Test #9:
score: 0
Accepted
time: 0ms
memory: 3716kb
input:
9
output:
000000000 100000000 100000010 100000011 100001011 100001010 100001000 100001100 100001110 100001111 100101111 100101110 100101100 100101000 100101010 100101011 100100011 100100010 100100000 100110000 100110010 100110011 100111011 100111010 100111000 100111100 100111110 100111111 110111111 110111110 ...
result:
ok n = 9, mihch = 56, maxch = 58
Test #10:
score: 0
Accepted
time: 0ms
memory: 3900kb
input:
10
output:
0000000000 1000000000 1000000010 1000000011 1000001011 1000001010 1000001000 1000001100 1000001110 1000001111 1000101111 1000101110 1000101100 1000101000 1000101010 1000101011 1000100011 1000100010 1000100000 1000110000 1000110010 1000110011 1000111011 1000111010 1000111000 1000111100 1000111110 100...
result:
ok n = 10, mihch = 102, maxch = 104
Test #11:
score: 0
Accepted
time: 0ms
memory: 3956kb
input:
11
output:
00000000000 10000000000 10000000010 10000000011 10000001011 10000001010 10000001000 10000001100 10000001110 10000001111 10000101111 10000101110 10000101100 10000101000 10000101010 10000101011 10000100011 10000100010 10000100000 10000110000 10000110010 10000110011 10000111011 10000111010 10000111000 ...
result:
ok n = 11, mihch = 186, maxch = 188
Test #12:
score: 0
Accepted
time: 1ms
memory: 3668kb
input:
12
output:
000000000000 100000000000 100000000010 100000000011 100000001011 100000001010 100000001000 100000001100 100000001110 100000001111 100000101111 100000101110 100000101100 100000101000 100000101010 100000101011 100000100011 100000100010 100000100000 100000110000 100000110010 100000110011 100000111011 1...
result:
ok n = 12, mihch = 340, maxch = 342
Test #13:
score: 0
Accepted
time: 1ms
memory: 3700kb
input:
13
output:
0000000000000 1000000000000 1000000000010 1000000000011 1000000001011 1000000001010 1000000001000 1000000001100 1000000001110 1000000001111 1000000101111 1000000101110 1000000101100 1000000101000 1000000101010 1000000101011 1000000100011 1000000100010 1000000100000 1000000110000 1000000110010 100000...
result:
ok n = 13, mihch = 630, maxch = 632
Test #14:
score: 0
Accepted
time: 1ms
memory: 3744kb
input:
14
output:
00000000000000 10000000000000 10000000000010 10000000000011 10000000001011 10000000001010 10000000001000 10000000001100 10000000001110 10000000001111 10000000101111 10000000101110 10000000101100 10000000101000 10000000101010 10000000101011 10000000100011 10000000100010 10000000100000 10000000110000 ...
result:
ok n = 14, mihch = 1170, maxch = 1172
Test #15:
score: 0
Accepted
time: 0ms
memory: 3808kb
input:
15
output:
000000000000000 100000000000000 100000000000010 100000000000011 100000000001011 100000000001010 100000000001000 100000000001100 100000000001110 100000000001111 100000000101111 100000000101110 100000000101100 100000000101000 100000000101010 100000000101011 100000000100011 100000000100010 100000000100...
result:
ok n = 15, mihch = 2184, maxch = 2186
Test #16:
score: 0
Accepted
time: 3ms
memory: 3952kb
input:
16
output:
0000000000000000 1000000000000000 1000000000000010 1000000000000011 1000000000001011 1000000000001010 1000000000001000 1000000000001100 1000000000001110 1000000000001111 1000000000101111 1000000000101110 1000000000101100 1000000000101000 1000000000101010 1000000000101011 1000000000100011 10000000001...
result:
ok n = 16, mihch = 4096, maxch = 4096
Test #17:
score: 0
Accepted
time: 5ms
memory: 4200kb
input:
17
output:
00000000000000000 10000000000000000 10000000000000010 10000000000000011 10000000000001011 10000000000001010 10000000000001000 10000000000001100 10000000000001110 10000000000001111 10000000000101111 10000000000101110 10000000000101100 10000000000101000 10000000000101010 10000000000101011 100000000001...
result:
ok n = 17, mihch = 7710, maxch = 7712