oj.uz

Submission #1056874

# Submission time Handle Problem Language Result Execution time Memory
1056874 2024-08-13T12:01:35 Z Faisal_Saqib Boxes with souvenirs (IOI15_boxes) C++17
100 / 100
 376 ms 293992 KB 
#include "boxes.h"
#include <bits/stdc++.h>
using namespace std;

#define ll long long
#define vll vector<ll>
#define all(x) begin(x),end(x)
#define pb push_back

long long delivery(int n, int k, int LP, int p[])
{
    ll l=LP;
    // if(k==1)
    // {
    //     ll ans=0; 
    //     for(int i=0;i<n;i++)
    //         ans+=(2ll*(ll)min(p[i],l-p[i]));
    //     return ans;
    // }
    // else if(k==n){
        ll ans=1e18;
        ll pq[n],qp[n];
        pq[0]=min(l,2ll*p[0]);
        for(int i=1;i<n;i++)
        {
            pq[i]=min(l,2ll*p[i]);
            if((i-k)>=0)
                pq[i]+=pq[i-k];
        }
        ll mx=0;
        ans=min(ans,pq[n-1]);
        for(int j=n-1;j>=0;j--)
        {
            qp[j]=min(l,2ll*(l-p[j]));
            if((j+k)<n)
                qp[j]+=qp[j+k];
            if(j==0)
            {
                ans=min(ans,qp[j]);
            }
            else{
                ans=min(ans,qp[j]+pq[j-1]);
            }
        }
        return ans;
    // }
    // return 0;
}

Compilation message

boxes.cpp: In function 'long long int delivery(int, int, int, int*)':
boxes.cpp:30:12: warning: unused variable 'mx' [-Wunused-variable]
   30 |         ll mx=0;
      |            ^~

Subtask #1
10.0 / 10.0

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

Subtask #2
10.0 / 10.0

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

Subtask #3
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 436 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 604 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 440 KB Output is correct

Subtask #4
15.0 / 15.0

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

Subtask #5
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 ms 440 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 448 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 436 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 604 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 0 ms 440 KB Output is correct
23 Correct 1 ms 348 KB Output is correct
24 Correct 0 ms 348 KB Output is correct
25 Correct 0 ms 604 KB Output is correct
26 Correct 0 ms 348 KB Output is correct
27 Correct 0 ms 348 KB Output is correct
28 Correct 0 ms 348 KB Output is correct
29 Correct 0 ms 348 KB Output is correct
30 Correct 0 ms 440 KB Output is correct
31 Correct 0 ms 444 KB Output is correct
32 Correct 0 ms 348 KB Output is correct
33 Correct 37 ms 29612 KB Output is correct
34 Correct 15 ms 21852 KB Output is correct
35 Correct 16 ms 22400 KB Output is correct
36 Correct 38 ms 29684 KB Output is correct
37 Correct 39 ms 29780 KB Output is correct
38 Correct 41 ms 29780 KB Output is correct
39 Correct 33 ms 28072 KB Output is correct
40 Correct 25 ms 23444 KB Output is correct
41 Correct 37 ms 29780 KB Output is correct
42 Correct 23 ms 23892 KB Output is correct

Subtask #6
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 ms 440 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 448 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 436 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 604 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 0 ms 440 KB Output is correct
23 Correct 1 ms 348 KB Output is correct
24 Correct 0 ms 348 KB Output is correct
25 Correct 0 ms 604 KB Output is correct
26 Correct 0 ms 348 KB Output is correct
27 Correct 0 ms 348 KB Output is correct
28 Correct 0 ms 348 KB Output is correct
29 Correct 0 ms 348 KB Output is correct
30 Correct 0 ms 440 KB Output is correct
31 Correct 0 ms 444 KB Output is correct
32 Correct 0 ms 348 KB Output is correct
33 Correct 37 ms 29612 KB Output is correct
34 Correct 15 ms 21852 KB Output is correct
35 Correct 16 ms 22400 KB Output is correct
36 Correct 38 ms 29684 KB Output is correct
37 Correct 39 ms 29780 KB Output is correct
38 Correct 41 ms 29780 KB Output is correct
39 Correct 33 ms 28072 KB Output is correct
40 Correct 25 ms 23444 KB Output is correct
41 Correct 37 ms 29780 KB Output is correct
42 Correct 23 ms 23892 KB Output is correct
43 Correct 363 ms 292952 KB Output is correct
44 Correct 135 ms 215636 KB Output is correct
45 Correct 168 ms 223404 KB Output is correct
46 Correct 362 ms 293784 KB Output is correct
47 Correct 376 ms 293756 KB Output is correct
48 Correct 365 ms 293992 KB Output is correct
49 Correct 322 ms 278616 KB Output is correct
50 Correct 184 ms 232556 KB Output is correct
51 Correct 367 ms 293748 KB Output is correct
52 Correct 205 ms 235092 KB Output is correct