oj.uz

Submission #63617

# Submission time Handle Problem Language Result Execution time Memory
63617 2018-08-02T09:14:45 Z MKopchev Boxes with souvenirs (IOI15_boxes) C++14
100 / 100
 535 ms 196148 KB 
#include<bits/stdc++.h>
using namespace std;
const int nmax=1e7+42;
long long l[nmax],r[nmax];
long long delivery(int N, int K, int L, int positions[])
{
    l[0]=0;
    for(int i=1;i<=K;i++)
        l[i]=positions[i-1]+min(positions[i-1],L-positions[i-1]);
    for(int i=K+1;i<=N;i++)
        l[i]=l[i-K]+positions[i-1]+min(positions[i-1],L-positions[i-1]);
    r[N+1]=0;
    for(int i=N;i>=1;i--)
        r[i]=r[min(i+K,N+1)]+L-positions[i-1]+min(positions[i-1],L-positions[i-1]);
    /*
    for(int i=0;i<=N+1;i++)cout<<l[i]<<" ";cout<<endl;
    for(int i=0;i<=N+1;i++)cout<<r[i]<<" ";cout<<endl;
    */
    long long outp=1e18;
    for(int i=0;i<=N;i++)
        outp=min(outp,l[i]+r[i+1]);
    return outp;
}
/*
int N=3,K=2,L=8;
int arr[3]={1,2,5};
int main()
{
cout<<delivery(N,K,L,arr)<<endl;
}
*/

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 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 348 KB Output is correct
7 Correct 2 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 376 KB Output is correct
4 Correct 2 ms 348 KB Output is correct
5 Correct 2 ms 256 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 2 ms 252 KB Output is correct
8 Correct 2 ms 376 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 2 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 348 KB Output is correct
14 Correct 2 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 376 KB Output is correct
18 Correct 2 ms 348 KB Output is correct
19 Correct 2 ms 256 KB Output is correct
20 Correct 2 ms 376 KB Output is correct
21 Correct 2 ms 252 KB Output is correct
22 Correct 2 ms 376 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 380 KB Output is correct
26 Correct 2 ms 376 KB Output is correct
27 Correct 2 ms 376 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 376 KB Output is correct
32 Correct 2 ms 380 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 2 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 348 KB Output is correct
14 Correct 2 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 376 KB Output is correct
18 Correct 2 ms 348 KB Output is correct
19 Correct 2 ms 256 KB Output is correct
20 Correct 2 ms 376 KB Output is correct
21 Correct 2 ms 252 KB Output is correct
22 Correct 2 ms 376 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 380 KB Output is correct
26 Correct 2 ms 376 KB Output is correct
27 Correct 2 ms 376 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 376 KB Output is correct
32 Correct 2 ms 380 KB Output is correct
33 Correct 50 ms 19960 KB Output is correct
34 Correct 25 ms 19972 KB Output is correct
35 Correct 26 ms 19832 KB Output is correct
36 Correct 53 ms 19932 KB Output is correct
37 Correct 49 ms 19896 KB Output is correct
38 Correct 53 ms 19888 KB Output is correct
39 Correct 45 ms 19832 KB Output is correct
40 Correct 30 ms 19872 KB Output is correct
41 Correct 57 ms 19924 KB Output is correct
42 Correct 32 ms 19964 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 2 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 348 KB Output is correct
14 Correct 2 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 376 KB Output is correct
18 Correct 2 ms 348 KB Output is correct
19 Correct 2 ms 256 KB Output is correct
20 Correct 2 ms 376 KB Output is correct
21 Correct 2 ms 252 KB Output is correct
22 Correct 2 ms 376 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 380 KB Output is correct
26 Correct 2 ms 376 KB Output is correct
27 Correct 2 ms 376 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 376 KB Output is correct
32 Correct 2 ms 380 KB Output is correct
33 Correct 50 ms 19960 KB Output is correct
34 Correct 25 ms 19972 KB Output is correct
35 Correct 26 ms 19832 KB Output is correct
36 Correct 53 ms 19932 KB Output is correct
37 Correct 49 ms 19896 KB Output is correct
38 Correct 53 ms 19888 KB Output is correct
39 Correct 45 ms 19832 KB Output is correct
40 Correct 30 ms 19872 KB Output is correct
41 Correct 57 ms 19924 KB Output is correct
42 Correct 32 ms 19964 KB Output is correct
43 Correct 478 ms 195948 KB Output is correct
44 Correct 278 ms 196008 KB Output is correct
45 Correct 253 ms 196064 KB Output is correct
46 Correct 490 ms 196072 KB Output is correct
47 Correct 511 ms 196028 KB Output is correct
48 Correct 535 ms 195972 KB Output is correct
49 Correct 462 ms 196124 KB Output is correct
50 Correct 346 ms 196072 KB Output is correct
51 Correct 504 ms 196148 KB Output is correct
52 Correct 314 ms 196080 KB Output is correct