oj.uz

Submission #849397

# Submission time Handle Problem Language Result Execution time Memory
849397 2023-09-14T14:52:00 Z abcvuitunggio Boxes with souvenirs (IOI15_boxes) C++17
100 / 100
 585 ms 258708 KB 
#include "boxes.h"
#include <bits/stdc++.h>
using namespace std;
vector <int> a,b;
long long res,dp[10000001],dp2[10000001];
long long delivery(int N, int K, int L, int p[]){
    for (int i=0;i<N;i++)
        if (p[i]<=L/2)
            a.push_back(p[i]);
        else
            b.push_back(L-p[i]);
    sort(a.begin(),a.end());
    sort(b.begin(),b.end());
    for (int i=0;i<(int)a.size();i++)
        dp[i]=(i<K?0:dp[i-K])+a[i]*2;
    for (int i=0;i<(int)b.size();i++)
        dp2[i]=(i<K?0:dp2[i-K])+b[i]*2;
    int i=(int)a.size()-1,j=(int)b.size()-1;
    while (i>=0||j>=0){
        pair <long long, int> mn={1e18,-1};
        for (int l=0;l<=K;l++)
            mn=min(mn,{(i<l?0:dp[i-l])+(j<K-l?0:dp2[j-K+l]),l});
        if (mn.first+L>(i<0?0:dp[i])+(j<0?0:dp2[j])){
            res+=(i<0?0:dp[i])+(j<0?0:dp2[j]);
            break;
        }
        res+=L;
        i-=mn.second;
        j-=K-mn.second;
    }
    return res;
}

Subtask #1
10.0 / 10.0

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

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2392 KB Output is correct
2 Correct 1 ms 2396 KB Output is correct
3 Correct 1 ms 2392 KB Output is correct
4 Correct 0 ms 2392 KB Output is correct
5 Correct 1 ms 2392 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 344 KB Output is correct

Subtask #3
15.0 / 15.0

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

Subtask #4
15.0 / 15.0

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

Subtask #5
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2392 KB Output is correct
2 Correct 1 ms 2396 KB Output is correct
3 Correct 1 ms 2392 KB Output is correct
4 Correct 1 ms 2392 KB Output is correct
5 Correct 1 ms 2392 KB Output is correct
6 Correct 1 ms 2396 KB Output is correct
7 Correct 1 ms 2396 KB Output is correct
8 Correct 1 ms 2392 KB Output is correct
9 Correct 1 ms 2396 KB Output is correct
10 Correct 1 ms 2392 KB Output is correct
11 Correct 0 ms 2392 KB Output is correct
12 Correct 1 ms 2392 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 344 KB Output is correct
15 Correct 1 ms 2392 KB Output is correct
16 Correct 1 ms 2392 KB Output is correct
17 Correct 0 ms 2392 KB Output is correct
18 Correct 0 ms 2392 KB Output is correct
19 Correct 1 ms 2392 KB Output is correct
20 Correct 1 ms 2396 KB Output is correct
21 Correct 0 ms 344 KB Output is correct
22 Correct 0 ms 344 KB Output is correct
23 Correct 1 ms 2392 KB Output is correct
24 Correct 1 ms 2392 KB Output is correct
25 Correct 1 ms 2396 KB Output is correct
26 Correct 0 ms 348 KB Output is correct
27 Correct 1 ms 2392 KB Output is correct
28 Correct 0 ms 348 KB Output is correct
29 Correct 1 ms 2392 KB Output is correct
30 Correct 0 ms 2396 KB Output is correct
31 Correct 1 ms 344 KB Output is correct
32 Correct 0 ms 344 KB Output is correct
33 Correct 54 ms 26320 KB Output is correct
34 Correct 27 ms 23996 KB Output is correct
35 Correct 30 ms 23692 KB Output is correct
36 Correct 53 ms 26464 KB Output is correct
37 Correct 55 ms 28492 KB Output is correct
38 Correct 55 ms 29504 KB Output is correct
39 Correct 55 ms 24976 KB Output is correct
40 Correct 32 ms 20244 KB Output is correct
41 Correct 57 ms 26808 KB Output is correct
42 Correct 34 ms 20684 KB Output is correct

Subtask #6
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2392 KB Output is correct
2 Correct 1 ms 2396 KB Output is correct
3 Correct 1 ms 2392 KB Output is correct
4 Correct 1 ms 2392 KB Output is correct
5 Correct 1 ms 2392 KB Output is correct
6 Correct 1 ms 2396 KB Output is correct
7 Correct 1 ms 2396 KB Output is correct
8 Correct 1 ms 2392 KB Output is correct
9 Correct 1 ms 2396 KB Output is correct
10 Correct 1 ms 2392 KB Output is correct
11 Correct 0 ms 2392 KB Output is correct
12 Correct 1 ms 2392 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 344 KB Output is correct
15 Correct 1 ms 2392 KB Output is correct
16 Correct 1 ms 2392 KB Output is correct
17 Correct 0 ms 2392 KB Output is correct
18 Correct 0 ms 2392 KB Output is correct
19 Correct 1 ms 2392 KB Output is correct
20 Correct 1 ms 2396 KB Output is correct
21 Correct 0 ms 344 KB Output is correct
22 Correct 0 ms 344 KB Output is correct
23 Correct 1 ms 2392 KB Output is correct
24 Correct 1 ms 2392 KB Output is correct
25 Correct 1 ms 2396 KB Output is correct
26 Correct 0 ms 348 KB Output is correct
27 Correct 1 ms 2392 KB Output is correct
28 Correct 0 ms 348 KB Output is correct
29 Correct 1 ms 2392 KB Output is correct
30 Correct 0 ms 2396 KB Output is correct
31 Correct 1 ms 344 KB Output is correct
32 Correct 0 ms 344 KB Output is correct
33 Correct 54 ms 26320 KB Output is correct
34 Correct 27 ms 23996 KB Output is correct
35 Correct 30 ms 23692 KB Output is correct
36 Correct 53 ms 26464 KB Output is correct
37 Correct 55 ms 28492 KB Output is correct
38 Correct 55 ms 29504 KB Output is correct
39 Correct 55 ms 24976 KB Output is correct
40 Correct 32 ms 20244 KB Output is correct
41 Correct 57 ms 26808 KB Output is correct
42 Correct 34 ms 20684 KB Output is correct
43 Correct 549 ms 258168 KB Output is correct
44 Correct 260 ms 196704 KB Output is correct
45 Correct 294 ms 188548 KB Output is correct
46 Correct 543 ms 256856 KB Output is correct
47 Correct 536 ms 257088 KB Output is correct
48 Correct 541 ms 258708 KB Output is correct
49 Correct 535 ms 243024 KB Output is correct
50 Correct 317 ms 196296 KB Output is correct
51 Correct 585 ms 258528 KB Output is correct
52 Correct 334 ms 200132 KB Output is correct