QOJ.ac
QOJ
| ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
|---|---|---|---|---|---|---|---|---|---|
| #208598 | #6416. Classical Scheduling Problem | GuanYunchang | WA | 0ms | 3800kb | C++20 | 3.0kb | 2023-10-09 19:16:53 | 2023-10-09 19:16:54 |
Due to the privacy settings of the submitter, you are not allowed to view this code.
详细
Test #1:
score: 100
Accepted
time: 0ms
memory: 3800kb
input:
2 4 100 20 1 40 4 60 3 30 3 1 5 10 1
output:
2 3 1 4 2 0 0
result:
ok ok, 2 test cases (2 test cases)
Test #2:
score: -100
Wrong Answer
time: 0ms
memory: 3668kb
input:
10000 21 1892 174 13 604 15 170 2 413 11 899 2 531 12 651 17 553 9 429 8 837 14 937 12 577 7 532 11 19 2 173 10 165 6 762 15 221 6 945 13 302 19 7 3 54 26066 812 31 432 24 240 37 171 39 204 47 174 30 569 1 467 5 624 42 734 35 907 3 568 23 802 40 991 32 119 13 187 27 739 42 891 14 550 44 374 16 483 1...
output:
6 6 3 5 14 21 18 16 52 48 7 54 11 8 38 51 25 53 43 15 18 49 21 20 24 40 36 12 31 2 35 48 16 26 42 52 44 47 6 1 46 45 14 32 10 34 22 33 3 4 13 23 37 17 9 27 41 30 39 19 5 29 11 11 8 1 7 6 5 4 14 15 2 9 16 4 10 31 15 40 41 38 21 37 8 24 28 7 7 28 7 1 10 22 3 12 0 0
result:
wrong answer jury has a better answer: jans = 7, pans = 6 (test case 1)