oj.uz

Submission #441063

# Submission time Handle Problem Language Result Execution time Memory
441063 2021-07-04T03:03:05 Z ToroTN Boxes with souvenirs (IOI15_boxes) C++14
100 / 100
 553 ms 274588 KB 
#include<bits/stdc++.h>
using namespace std;
#include "boxes.h"
long long n,m,l,a[10000005],dp1[10000005],dp2[10000005],ans=1e18;
long long delivery(int N,int K,int L,int p[]) {
    n=(long long)N;
    m=(long long)K;
    l=(long long)L;
    for(int i=1;i<=n;i++)
    {
        a[i]=p[i-1];
    }
    for(int i=1;i<=min(n,m-1);i++)
    {
        dp1[i]=min(2*a[i],l);
    }
    for(int i=m;i<=n;i++)
    {
        dp1[i]=dp1[i-m]+min(2*a[i],l);
    }
    for(int i=n;i>=max(n-m+2,(long long)1);i--)
    {
        dp2[i]=min(2*(l-a[i]),l);
    }
    for(int i=n-m+1;i>=1;i--)
    {
        dp2[i]=dp2[i+m]+min(2*(l-a[i]),l);
    }
    /*for(int i=0;i<=n;i++)
    {
        printf("%lld %lld\n",dp1[i],dp2[i]);
    }*/
    ans=min(ans,dp2[0]+dp1[n]);
    for(int i=0;i<n;i++)
    {
        ans=min(ans,dp1[i]+dp2[i+1]);
    }
    return ans;
}

Compilation message

boxes.cpp: In function 'long long int delivery(int, int, int, int*)':
boxes.cpp:17:15: warning: conversion from 'long long int' to 'int' may change value [-Wconversion]
   17 |     for(int i=m;i<=n;i++)
      |               ^
boxes.cpp:21:15: warning: conversion from 'long long int' to 'int' may change value [-Wconversion]
   21 |     for(int i=n;i>=max(n-m+2,(long long)1);i--)
      |               ^
boxes.cpp:25:18: warning: conversion from 'long long int' to 'int' may change value [-Wconversion]
   25 |     for(int i=n-m+1;i>=1;i--)
      |               ~~~^~

Subtask #1
10.0 / 10.0

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

Subtask #2
10.0 / 10.0

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

Subtask #3
15.0 / 15.0

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

Subtask #4
15.0 / 15.0

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

Subtask #5
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 0 ms 332 KB Output is correct
4 Correct 0 ms 332 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 0 ms 332 KB Output is correct
7 Correct 0 ms 332 KB Output is correct
8 Correct 0 ms 332 KB Output is correct
9 Correct 0 ms 332 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
11 Correct 1 ms 332 KB Output is correct
12 Correct 0 ms 332 KB Output is correct
13 Correct 0 ms 332 KB Output is correct
14 Correct 1 ms 332 KB Output is correct
15 Correct 1 ms 204 KB Output is correct
16 Correct 0 ms 204 KB Output is correct
17 Correct 0 ms 204 KB Output is correct
18 Correct 0 ms 204 KB Output is correct
19 Correct 0 ms 204 KB Output is correct
20 Correct 0 ms 204 KB Output is correct
21 Correct 0 ms 204 KB Output is correct
22 Correct 0 ms 204 KB Output is correct
23 Correct 1 ms 332 KB Output is correct
24 Correct 0 ms 332 KB Output is correct
25 Correct 0 ms 332 KB Output is correct
26 Correct 0 ms 332 KB Output is correct
27 Correct 1 ms 332 KB Output is correct
28 Correct 0 ms 332 KB Output is correct
29 Correct 1 ms 332 KB Output is correct
30 Correct 0 ms 332 KB Output is correct
31 Correct 1 ms 332 KB Output is correct
32 Correct 0 ms 332 KB Output is correct
33 Correct 55 ms 27592 KB Output is correct
34 Correct 24 ms 27724 KB Output is correct
35 Correct 26 ms 27672 KB Output is correct
36 Correct 56 ms 27612 KB Output is correct
37 Correct 56 ms 27596 KB Output is correct
38 Correct 54 ms 27660 KB Output is correct
39 Correct 49 ms 27676 KB Output is correct
40 Correct 30 ms 27604 KB Output is correct
41 Correct 55 ms 27588 KB Output is correct
42 Correct 32 ms 27588 KB Output is correct

Subtask #6
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 332 KB Output is correct
3 Correct 0 ms 332 KB Output is correct
4 Correct 0 ms 332 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 0 ms 332 KB Output is correct
7 Correct 0 ms 332 KB Output is correct
8 Correct 0 ms 332 KB Output is correct
9 Correct 0 ms 332 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
11 Correct 1 ms 332 KB Output is correct
12 Correct 0 ms 332 KB Output is correct
13 Correct 0 ms 332 KB Output is correct
14 Correct 1 ms 332 KB Output is correct
15 Correct 1 ms 204 KB Output is correct
16 Correct 0 ms 204 KB Output is correct
17 Correct 0 ms 204 KB Output is correct
18 Correct 0 ms 204 KB Output is correct
19 Correct 0 ms 204 KB Output is correct
20 Correct 0 ms 204 KB Output is correct
21 Correct 0 ms 204 KB Output is correct
22 Correct 0 ms 204 KB Output is correct
23 Correct 1 ms 332 KB Output is correct
24 Correct 0 ms 332 KB Output is correct
25 Correct 0 ms 332 KB Output is correct
26 Correct 0 ms 332 KB Output is correct
27 Correct 1 ms 332 KB Output is correct
28 Correct 0 ms 332 KB Output is correct
29 Correct 1 ms 332 KB Output is correct
30 Correct 0 ms 332 KB Output is correct
31 Correct 1 ms 332 KB Output is correct
32 Correct 0 ms 332 KB Output is correct
33 Correct 55 ms 27592 KB Output is correct
34 Correct 24 ms 27724 KB Output is correct
35 Correct 26 ms 27672 KB Output is correct
36 Correct 56 ms 27612 KB Output is correct
37 Correct 56 ms 27596 KB Output is correct
38 Correct 54 ms 27660 KB Output is correct
39 Correct 49 ms 27676 KB Output is correct
40 Correct 30 ms 27604 KB Output is correct
41 Correct 55 ms 27588 KB Output is correct
42 Correct 32 ms 27588 KB Output is correct
43 Correct 531 ms 274292 KB Output is correct
44 Correct 231 ms 274244 KB Output is correct
45 Correct 275 ms 274176 KB Output is correct
46 Correct 553 ms 274260 KB Output is correct
47 Correct 538 ms 274256 KB Output is correct
48 Correct 538 ms 274244 KB Output is correct
49 Correct 487 ms 274352 KB Output is correct
50 Correct 295 ms 274232 KB Output is correct
51 Correct 545 ms 274588 KB Output is correct
52 Correct 303 ms 274252 KB Output is correct