QOJ.ac
QOJ
ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
---|---|---|---|---|---|---|---|---|---|
#364280 | #5075. Fenwick Tree | GuanYunchang | WA | 15ms | 4216kb | C++17 | 1.2kb | 2024-03-24 13:27:03 | 2024-03-24 13:27:03 |
Due to the privacy settings of the submitter, you are not allowed to view this code.
详细
Test #1:
score: 100
Accepted
time: 1ms
memory: 4216kb
input:
3 5 10110 5 00000 5 11111
output:
3 0 3
result:
ok 3 number(s): "3 0 3"
Test #2:
score: -100
Wrong Answer
time: 15ms
memory: 4176kb
input:
100000 10 0000000000 10 0000000100 10 0000000000 10 1000000000 10 0000010000 10 0000000000 10 0000000000 10 0000000000 10 0100000000 10 0000000000 10 0000000001 10 0000001000 10 0000000000 10 0000000000 10 0000000001 10 0000100000 10 0010000000 10 0000000000 10 0010000000 10 0000000001 10 0000000000...
output:
0 1 0 2 2 0 0 0 2 0 1 2 0 0 1 2 2 0 2 1 0 0 1 1 2 0 2 2 2 0 2 2 0 0 2 1 0 0 2 0 2 2 0 0 0 0 0 0 0 2 2 2 2 0 1 0 1 2 0 2 2 0 1 2 0 1 0 2 0 0 2 2 0 0 0 1 2 0 2 0 0 0 0 2 1 0 0 0 0 0 0 2 0 2 2 0 2 2 1 0 0 0 0 0 0 0 1 0 0 0 2 0 2 0 0 0 2 0 2 0 0 2 0 0 0 1 0 0 1 2 0 0 2 0 2 0 0 1 0 2 0 0 0 2 0 0 2 2 1 0 ...
result:
wrong answer 23rd numbers differ - expected: '2', found: '1'