oj.uz

Submission #786682

# Submission time Handle Problem Language Result Execution time Memory
786682 2023-07-18T11:14:49 Z vnm06 Boxes with souvenirs (IOI15_boxes) C++14
100 / 100
 623 ms 157624 KB 
#include "boxes.h"
#include "bits/stdc++.h"
using namespace std;

int sL[10000005], brL=0, tL=0;
int sR[10000005], brR=0, tR=0;
long long dpL[10000005];
long long dpR[10000005];

long long delivery(int N, int K, int L, int p[])
{
    for(int i=0; i<N; i++)
    {
        if(p[i]==0) continue;
        if(p[i]<=L/2) sL[brL]=p[i], brL++;
        else sR[brR]=p[i], brR++;
    }
    sort(sL, sL+brL);
    sort(sR, sR+brR);
    reverse(sR, sR+brR);
    for(int i=0; i<brL; i++)
    {
        dpL[i]=2*sL[i];
        if(i>=K) dpL[i]+=dpL[i-K];
    }
    for(int i=0; i<brR; i++)
    {
        dpR[i]=2*(L-sR[i]);
        if(i>=K) dpR[i]+=dpR[i-K];
    }
    long long mans=1e18;
    if(brL+brR<=K) mans=L;
    if(brL==0 && brR==0) return 0;
    if(brL==0) return dpR[brR-1];
    if(brR==0) return dpL[brL-1];
    if(brL%K==0 || brR%K==0) return dpL[brL-1]+dpR[brR-1];
    for(int i=1; i<=K-1; i++)
    {
        long long ch=L;
        if(brL>i) ch+=dpL[brL-1-i];
        if(brR>K-i) ch+=dpR[brR-1-K+i];
        mans=min(mans, ch);
    }
    mans=min(mans, dpL[brL-1]+dpR[brR-1]);
    return mans;
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 0 ms 340 KB Output is correct
7 Correct 0 ms 340 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 0 ms 340 KB Output is correct

Subtask #3
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct

Subtask #4
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 0 ms 340 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Correct 0 ms 340 KB Output is correct
9 Correct 0 ms 340 KB Output is correct
10 Correct 0 ms 340 KB Output is correct
11 Correct 0 ms 340 KB Output is correct
12 Correct 0 ms 340 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 0 ms 340 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 0 ms 212 KB Output is correct
17 Correct 0 ms 212 KB Output is correct
18 Correct 0 ms 340 KB Output is correct
19 Correct 0 ms 212 KB Output is correct
20 Correct 1 ms 212 KB Output is correct
21 Correct 0 ms 212 KB Output is correct
22 Correct 0 ms 212 KB Output is correct
23 Correct 0 ms 340 KB Output is correct
24 Correct 0 ms 340 KB Output is correct
25 Correct 0 ms 340 KB Output is correct
26 Correct 0 ms 212 KB Output is correct
27 Correct 0 ms 340 KB Output is correct
28 Correct 1 ms 340 KB Output is correct
29 Correct 1 ms 256 KB Output is correct
30 Correct 1 ms 340 KB Output is correct
31 Correct 1 ms 340 KB Output is correct
32 Correct 1 ms 304 KB Output is correct

Subtask #5
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 0 ms 340 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Correct 0 ms 340 KB Output is correct
9 Correct 0 ms 340 KB Output is correct
10 Correct 0 ms 340 KB Output is correct
11 Correct 0 ms 340 KB Output is correct
12 Correct 0 ms 340 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 0 ms 340 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 0 ms 212 KB Output is correct
17 Correct 0 ms 212 KB Output is correct
18 Correct 0 ms 340 KB Output is correct
19 Correct 0 ms 212 KB Output is correct
20 Correct 1 ms 212 KB Output is correct
21 Correct 0 ms 212 KB Output is correct
22 Correct 0 ms 212 KB Output is correct
23 Correct 0 ms 340 KB Output is correct
24 Correct 0 ms 340 KB Output is correct
25 Correct 0 ms 340 KB Output is correct
26 Correct 0 ms 212 KB Output is correct
27 Correct 0 ms 340 KB Output is correct
28 Correct 1 ms 340 KB Output is correct
29 Correct 1 ms 256 KB Output is correct
30 Correct 1 ms 340 KB Output is correct
31 Correct 1 ms 340 KB Output is correct
32 Correct 1 ms 304 KB Output is correct
33 Correct 61 ms 18728 KB Output is correct
34 Correct 22 ms 13996 KB Output is correct
35 Correct 35 ms 15756 KB Output is correct
36 Correct 52 ms 16316 KB Output is correct
37 Correct 52 ms 16292 KB Output is correct
38 Correct 50 ms 16344 KB Output is correct
39 Correct 51 ms 16272 KB Output is correct
40 Correct 32 ms 16296 KB Output is correct
41 Correct 60 ms 16308 KB Output is correct
42 Correct 35 ms 16436 KB Output is correct

Subtask #6
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 0 ms 340 KB Output is correct
7 Correct 0 ms 340 KB Output is correct
8 Correct 0 ms 340 KB Output is correct
9 Correct 0 ms 340 KB Output is correct
10 Correct 0 ms 340 KB Output is correct
11 Correct 0 ms 340 KB Output is correct
12 Correct 0 ms 340 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 0 ms 340 KB Output is correct
15 Correct 0 ms 212 KB Output is correct
16 Correct 0 ms 212 KB Output is correct
17 Correct 0 ms 212 KB Output is correct
18 Correct 0 ms 340 KB Output is correct
19 Correct 0 ms 212 KB Output is correct
20 Correct 1 ms 212 KB Output is correct
21 Correct 0 ms 212 KB Output is correct
22 Correct 0 ms 212 KB Output is correct
23 Correct 0 ms 340 KB Output is correct
24 Correct 0 ms 340 KB Output is correct
25 Correct 0 ms 340 KB Output is correct
26 Correct 0 ms 212 KB Output is correct
27 Correct 0 ms 340 KB Output is correct
28 Correct 1 ms 340 KB Output is correct
29 Correct 1 ms 256 KB Output is correct
30 Correct 1 ms 340 KB Output is correct
31 Correct 1 ms 340 KB Output is correct
32 Correct 1 ms 304 KB Output is correct
33 Correct 61 ms 18728 KB Output is correct
34 Correct 22 ms 13996 KB Output is correct
35 Correct 35 ms 15756 KB Output is correct
36 Correct 52 ms 16316 KB Output is correct
37 Correct 52 ms 16292 KB Output is correct
38 Correct 50 ms 16344 KB Output is correct
39 Correct 51 ms 16272 KB Output is correct
40 Correct 32 ms 16296 KB Output is correct
41 Correct 60 ms 16308 KB Output is correct
42 Correct 35 ms 16436 KB Output is correct
43 Correct 596 ms 157516 KB Output is correct
44 Correct 217 ms 133900 KB Output is correct
45 Correct 280 ms 154956 KB Output is correct
46 Correct 512 ms 157624 KB Output is correct
47 Correct 523 ms 157536 KB Output is correct
48 Correct 536 ms 157536 KB Output is correct
49 Correct 559 ms 157516 KB Output is correct
50 Correct 326 ms 156664 KB Output is correct
51 Correct 623 ms 157508 KB Output is correct
52 Correct 351 ms 156856 KB Output is correct