oj.uz

Submission #67910

# Submission time Handle Problem Language Result Execution time Memory
67910 2018-08-15T13:29:33 Z theknife2001 Boxes with souvenirs (IOI15_boxes) C++17
100 / 100
 690 ms 243492 KB 
#include "boxes.h"
//#include "grader.cpp"
#include <bits/stdc++.h>
#define mid (l+r)/2


using namespace std;
const int N=1e7+55;
long long dp[N][2];
int p[N];
int n;
deque < long long > dq;



long long delivery(int N, int k, int L, int P[])
{
    int j=0;
    for(int i=0;i<N;i++)
    {
        if(!P[i])
            continue ;
        p[j++]=P[i];
    }
    if(j==0)
        return 0;
    n=j;
    int x=k;
    for(int i=0;i<n;i++)
    {
        if(i>=x)
        {
            dp[i][0]=dq.back()+p[i]+min(p[i],L-p[i]);
        }
        else
        {
            dp[i][0]=p[i]+min(p[i],L-p[i]);
        }
        while(dq.size()&&dq.front()>dp[i][0])
        {
            dq.pop_front();
        }
        dq.push_front(dp[i][0]);
        if(i-x>=0)
            if(dp[i-x][0]==dq.back())
                dq.pop_back();
    }
    for(int i=n-1;i>=0;i--)
    {
        if(i+x<n)
        {
            dp[i][1]=dq.back()+(L-p[i])+min(p[i],L-p[i]);
        }
        else
        {
            dp[i][1]=L-p[i]+min(p[i],L-p[i]);
        }
        while(dq.size()&&dq.front()>dp[i][1])
        {
            dq.pop_front();
        }
        dq.push_front(dp[i][1]);
        if(i+x<n)
            if(dp[i+x][1]==dq.back())
                dq.pop_back();
    }
    long long ans=dp[0][1];
    for(int i=0;i<n;i++)
    {
        ans=min(dp[i][0]+((i+1<n)?(dp[i+1][1]):0),ans);
    }
    return ans;
}
/*
10 5 100
1 5 20 35 41 42 55 56 57 58
*/

Compilation message

boxes.cpp: In function 'long long int delivery(int, int, int, int*)':
boxes.cpp:16:48: warning: declaration of 'N' shadows a global declaration [-Wshadow]
 long long delivery(int N, int k, int L, int P[])
                                                ^
boxes.cpp:8:11: note: shadowed declaration is here
 const int N=1e7+55;
           ^

Subtask #1
10.0 / 10.0

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

Subtask #2
10.0 / 10.0

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

Subtask #3
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 256 KB Output is correct
4 Correct 2 ms 256 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 2 ms 376 KB Output is correct
8 Correct 2 ms 296 KB Output is correct

Subtask #4
15.0 / 15.0

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

Subtask #5
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 2 ms 376 KB Output is correct
8 Correct 2 ms 376 KB Output is correct
9 Correct 2 ms 376 KB Output is correct
10 Correct 3 ms 376 KB Output is correct
11 Correct 2 ms 376 KB Output is correct
12 Correct 2 ms 376 KB Output is correct
13 Correct 2 ms 376 KB Output is correct
14 Correct 3 ms 376 KB Output is correct
15 Correct 2 ms 376 KB Output is correct
16 Correct 2 ms 376 KB Output is correct
17 Correct 2 ms 256 KB Output is correct
18 Correct 2 ms 256 KB Output is correct
19 Correct 2 ms 376 KB Output is correct
20 Correct 2 ms 376 KB Output is correct
21 Correct 2 ms 376 KB Output is correct
22 Correct 2 ms 296 KB Output is correct
23 Correct 2 ms 376 KB Output is correct
24 Correct 2 ms 376 KB Output is correct
25 Correct 2 ms 376 KB Output is correct
26 Correct 2 ms 376 KB Output is correct
27 Correct 2 ms 380 KB Output is correct
28 Correct 2 ms 376 KB Output is correct
29 Correct 2 ms 376 KB Output is correct
30 Correct 2 ms 376 KB Output is correct
31 Correct 2 ms 380 KB Output is correct
32 Correct 2 ms 376 KB Output is correct
33 Correct 68 ms 23800 KB Output is correct
34 Correct 37 ms 19876 KB Output is correct
35 Correct 41 ms 22776 KB Output is correct
36 Correct 66 ms 23792 KB Output is correct
37 Correct 65 ms 23800 KB Output is correct
38 Correct 64 ms 23800 KB Output is correct
39 Correct 60 ms 23788 KB Output is correct
40 Correct 45 ms 23800 KB Output is correct
41 Correct 65 ms 23792 KB Output is correct
42 Correct 46 ms 23800 KB Output is correct

Subtask #6
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 2 ms 376 KB Output is correct
8 Correct 2 ms 376 KB Output is correct
9 Correct 2 ms 376 KB Output is correct
10 Correct 3 ms 376 KB Output is correct
11 Correct 2 ms 376 KB Output is correct
12 Correct 2 ms 376 KB Output is correct
13 Correct 2 ms 376 KB Output is correct
14 Correct 3 ms 376 KB Output is correct
15 Correct 2 ms 376 KB Output is correct
16 Correct 2 ms 376 KB Output is correct
17 Correct 2 ms 256 KB Output is correct
18 Correct 2 ms 256 KB Output is correct
19 Correct 2 ms 376 KB Output is correct
20 Correct 2 ms 376 KB Output is correct
21 Correct 2 ms 376 KB Output is correct
22 Correct 2 ms 296 KB Output is correct
23 Correct 2 ms 376 KB Output is correct
24 Correct 2 ms 376 KB Output is correct
25 Correct 2 ms 376 KB Output is correct
26 Correct 2 ms 376 KB Output is correct
27 Correct 2 ms 380 KB Output is correct
28 Correct 2 ms 376 KB Output is correct
29 Correct 2 ms 376 KB Output is correct
30 Correct 2 ms 376 KB Output is correct
31 Correct 2 ms 380 KB Output is correct
32 Correct 2 ms 376 KB Output is correct
33 Correct 68 ms 23800 KB Output is correct
34 Correct 37 ms 19876 KB Output is correct
35 Correct 41 ms 22776 KB Output is correct
36 Correct 66 ms 23792 KB Output is correct
37 Correct 65 ms 23800 KB Output is correct
38 Correct 64 ms 23800 KB Output is correct
39 Correct 60 ms 23788 KB Output is correct
40 Correct 45 ms 23800 KB Output is correct
41 Correct 65 ms 23792 KB Output is correct
42 Correct 46 ms 23800 KB Output is correct
43 Correct 689 ms 243492 KB Output is correct
44 Correct 370 ms 200236 KB Output is correct
45 Correct 394 ms 231196 KB Output is correct
46 Correct 665 ms 239276 KB Output is correct
47 Correct 637 ms 236816 KB Output is correct
48 Correct 635 ms 235192 KB Output is correct
49 Correct 586 ms 243448 KB Output is correct
50 Correct 485 ms 238888 KB Output is correct
51 Correct 690 ms 237760 KB Output is correct
52 Correct 485 ms 238564 KB Output is correct