QOJ.ac

QOJ

ID	Problem	Submitter	Result	Time	Memory	Language	File size	Submit time	Judge time
#149593	#2785. Boxes with souvenirs	AbdelmagedNour^#	10	0ms	4068kb	C++20	506b	2023-08-24 22:32:33	2024-07-04 01:51:30

Judging History

你现在查看的是最新测评结果

[2024-07-04 01:51:30]
管理员手动重测该提交记录

测评结果：10
用时：0ms
内存：4068kb

查看

[2023-08-24 22:32:36]
评测

测评结果：Compile Error
用时：0ms
内存：0kb

查看

[2023-08-24 22:32:33]
提交

answer

#include <bits/stdc++.h>
using namespace std;
//#include "grader.cpp"
#include "boxes.h"

long long delivery(int N, int K, int L, int p[]){
    vector<long long>pre(K+1),suf(K+1);
    long long res=LLONG_MAX;
    for(int i=K-1;i<N;i++)suf[i%K]+=L-p[i];
    for(int i=K-1;i<N;i++){
        int l=p[i-K+1],r=p[i];
        suf[i%K]-=L-p[i];
        if(i>=K)pre[i%K]+=p[i-K];
        int cost=min({L,2*r,2*(L-l)});
        res=min(res,cost+2*pre[i%K]+2*suf[(i+1)%K]);
    }
    return res;
}

Source code, Language: C++20

Details

Tip: Click on the bar to expand more detailed information

Subtask #1:

score: 10

Accepted

Test #1:

score: 10

Accepted

time: 0ms

memory: 3708kb

input:

1 1 1000000000
210758687

output:

421517374

result:

ok single line: '421517374'

Test #2:

score: 0

Accepted

time: 0ms

memory: 3728kb

input:

1000 1 1000000000
1808509 2182084 3015527 4447494 7769779 8792029 9883237 12829051 12902231 13338930 16688684 16992515 17866419 19063417 20124997 20125047 20514891 20917910 24004241 25917774 30411202 34419407 34944244 36371532 36402573 39271076 39612282 40912226 41119528 41176691 42741034 42801382 4...

output:

511681980406

result:

ok single line: '511681980406'

Test #3:

score: 0

Accepted

time: 0ms

memory: 4068kb

input:

1000 1 1000
2 3 4 4 4 7 7 8 10 12 12 13 14 15 16 16 17 17 18 21 22 23 24 24 25 28 30 30 30 30 32 32 34 34 34 34 35 35 35 35 35 36 36 36 37 39 41 42 42 43 43 44 44 44 45 46 46 46 47 48 49 51 52 53 55 56 58 60 61 61 62 63 64 68 69 70 72 74 75 76 76 76 78 78 80 81 83 83 84 84 85 85 86 86 88 88 90 92 92...

output:

result:

ok single line: '511638'

Test #4:

score: 0

Accepted

time: 0ms

memory: 3992kb

input:

1000 1 5
0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0...

output:

result:

ok single line: '2322'

Test #5:

score: 0

Accepted

time: 0ms

memory: 3784kb

input:

1000 1 1000000000
447532220 447532220 447532220 447532220 447532220 447532220 447532220 447532220 447532220 447532220 447532220 447532220 447532220 447532220 447532220 447532220 447532220 447532220 447532220 447532220 447532220 447532220 447532220 447532220 447532220 447532220 447532220 447532220 44...

output:

895064440000

result:

ok single line: '895064440000'

Test #6:

score: 0

Accepted

time: 0ms

memory: 3704kb

input:

1000 1 1000000000
18457857 18457857 18457857 18457857 18457857 18457857 18457857 18457857 18457857 18457857 18457857 18457857 18457857 18457857 18457857 18457857 18457857 18457857 18457857 18457857 18457857 61895049 61895049 61895049 61895049 61895049 61895049 61895049 61895049 61895049 61895049 618...

output:

619577021140

result:

ok single line: '619577021140'

Test #7:

score: 0

Accepted

time: 0ms

memory: 3796kb

input:

1000 1 1000000000
159227065 159227065 159227065 159227065 159227065 159227065 159227065 159227065 159227065 159227065 159227065 159227065 159227065 159227065 159227065 159227065 159227065 159227065 159227065 159227065 159227065 159227065 159227065 159227065 159227065 159227065 159227065 159227065 15...

output:

294049546692

result:

ok single line: '294049546692'

Subtask #2:

score: 0

Wrong Answer

Test #8:

score: 10

Accepted

time: 0ms

memory: 3804kb

input:

1000 1000 1000
0 0 1 2 3 3 4 5 5 6 6 7 8 8 8 9 10 11 11 11 12 13 13 13 14 14 15 16 17 17 17 18 20 20 21 21 24 25 25 26 30 31 34 34 35 38 40 43 44 46 46 46 47 47 51 52 52 52 55 56 58 62 64 65 67 68 69 72 73 75 76 77 78 79 79 80 83 84 85 85 86 86 87 88 88 88 92 92 92 95 95 96 98 98 99 99 100 100 101 1...

output:

result:

ok single line: '1000'

Test #9:

score: 0

Accepted

time: 0ms

memory: 3716kb

input:

1000 1000 5
0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 ...

output:

result:

ok single line: '5'

Test #10:

score: 0

Accepted

time: 0ms

memory: 3968kb

input:

1000 1000 1000000000
154376846 154376846 154376846 154376846 154376846 154376846 154376846 154376846 154376846 154376846 154376846 154376846 154376846 154376846 154376846 154376846 154376846 154376846 154376846 154376846 154376846 154376846 154376846 154376846 154376846 154376846 154376846 154376846...

output:

308753692

result:

ok single line: '308753692'

Test #11:

score: 0

Accepted

time: 0ms

memory: 3744kb

input:

1000 1000 1000000000
198812287 198812287 198812287 198812287 198812287 198812287 198812287 198812287 198812287 198812287 198812287 198812287 198812287 198812287 198812287 198812287 198812287 198812287 198812287 198812287 198812287 198812287 198812287 198812287 198812287 198812287 198812287 198812287...

output:

1000000000

result:

ok single line: '1000000000'

Test #12:

score: -10

Wrong Answer

time: 0ms

memory: 3780kb

input:

1000 1000 1000000000
84700188 84700188 84700188 84700188 84700188 84700188 84700188 84700188 84700188 84700188 84700188 84700188 84700188 84700188 84700188 84700188 84700188 84700188 84700188 84700188 84700188 84700188 84700188 84700188 84700188 84700188 84700188 84700188 84700188 84700188 84700188 ...

output:

1000000000

result:

wrong answer 1st lines differ - expected: '665477708', found: '1000000000'

Subtask #3:

score: 0

Wrong Answer

Test #15:

score: 15

Accepted

time: 0ms

memory: 3656kb

input:

10 5 5
0 0 0 0 0 1 3 3 3 4

output:

result:

ok single line: '5'

Test #16:

score: 0

Accepted

time: 0ms

memory: 3640kb

input:

10 5 1000000000
334882664 334882664 334882664 334882664 334882664 334882664 334882664 334882664 334882664 334882664

output:

1339530656

result:

ok single line: '1339530656'

Test #17:

score: 0

Accepted

time: 0ms

memory: 3656kb

input:

10 2 1000000000
85975415 85975415 85975415 85975415 85975415 85975415 85975415 85975415 85975415 105352579

output:

898508478

result:

ok single line: '898508478'

Test #18:

score: 0

Accepted

time: 0ms

memory: 3660kb

input:

10 2 1000000000
450369670 450369670 450369670 450369670 450369670 450369670 450369670 450369670 973255696 973255696

output:

3656445968

result:

ok single line: '3656445968'

Test #19:

score: -15

Wrong Answer

time: 0ms

memory: 3656kb

input:

10 10 1000000000
20859 165911 251492 256622 477740 805842 835605 999196078 999415731 999776268

output:

1000000000

result:

wrong answer 1st lines differ - expected: '3279054', found: '1000000000'

Subtask #4:

score: 0

Skipped

Dependency #1:

100%

Accepted

Dependency #2:

Subtask #5:

score: 0

Skipped

Dependency #1:

100%

Accepted

Dependency #2:

Subtask #6:

score: 0

Skipped

Dependency #1:

100%

Accepted