Submission #880030

# Submission time Handle Problem Language Result Execution time Memory
880030 2023-11-28T15:34:55 Z JakobZorz Boxes with souvenirs (IOI15_boxes) C++14
100 / 100
570 ms 256976 KB
#include"boxes.h"
#include<vector>
#include<iostream>
#include<algorithm>
typedef long long ll;
using namespace std;

ll delivery(int k,int l,int n,int p[]){
    vector<int>pos1,pos2;
    pos1.push_back(0);
    pos2.push_back(0);
    for(int i=0;i<k;i++){
        if(p[i]<=n/2)
            pos1.push_back(p[i]);
    }
    
    for(int i=k-1;i>=0;i--){
        if(p[i]>n/2)
            pos2.push_back(n-p[i]);
    }
    
    vector<ll>cost1(pos1.size()),cost2(pos2.size());
    for(int i=0;i<min((int)cost1.size(),l);i++){
        cost1[i]=2*pos1[i];
        for(int j=i+l;j<(int)cost1.size();j+=l)
            cost1[j]=cost1[j-l]+2*pos1[j];
    }
    
    for(int i=0;i<min((int)cost2.size(),l);i++){
        cost2[i]=2*pos2[i];
        for(int j=i+l;j<(int)cost2.size();j+=l)
            cost2[j]=cost2[j-l]+2*pos2[j];
    }
    
    ll res=cost1.back()+cost2.back();
    /*for(int i1=0;i1<(int)cost1.size();i1++){
        int start=(cost1.size()+cost2.size()-2-i1)%l;
        
        for(int i2=start;i2<(int)cost2.size();i2+=l){
            ll rem=cost1.size()+cost2.size()-2-i1-i2;
            ll curr=cost1[i1]+cost2[i2]+rem/l*n;
            //cout<<curr<<" "<<i1<<" "<<i2<<" "<<rem<<"\n";
            res=min(res,curr);
        }
    }*/
    
    for(int i=0;i<=l;i++){
        int i1=(int)cost1.size()-1-i;
        int i2=(int)cost2.size()-1-l+i;
        
        if(i1>=0&&i2>=0){
            ll curr=cost1[i1]+cost2[i2]+n;
            res=min(res,curr);
        }
    }
    
    return res;
}
# 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 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 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 1 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 600 KB Output is correct
# 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 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 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
# 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 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 1 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 1 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 600 KB Output is correct
15 Correct 0 ms 344 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 348 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 348 KB Output is correct
23 Correct 0 ms 348 KB Output is correct
24 Correct 0 ms 348 KB Output is correct
25 Correct 0 ms 348 KB Output is correct
26 Correct 1 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 348 KB Output is correct
31 Correct 0 ms 348 KB Output is correct
32 Correct 0 ms 600 KB Output is correct
# 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 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 1 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 1 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 600 KB Output is correct
15 Correct 0 ms 344 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 348 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 348 KB Output is correct
23 Correct 0 ms 348 KB Output is correct
24 Correct 0 ms 348 KB Output is correct
25 Correct 0 ms 348 KB Output is correct
26 Correct 1 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 348 KB Output is correct
31 Correct 0 ms 348 KB Output is correct
32 Correct 0 ms 600 KB Output is correct
33 Correct 41 ms 16208 KB Output is correct
34 Correct 19 ms 18888 KB Output is correct
35 Correct 18 ms 18116 KB Output is correct
36 Correct 43 ms 26008 KB Output is correct
37 Correct 43 ms 25760 KB Output is correct
38 Correct 44 ms 27068 KB Output is correct
39 Correct 42 ms 24408 KB Output is correct
40 Correct 23 ms 19876 KB Output is correct
41 Correct 44 ms 26060 KB Output is correct
42 Correct 22 ms 19912 KB Output is correct
# 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 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 1 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 1 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 600 KB Output is correct
15 Correct 0 ms 344 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 348 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 348 KB Output is correct
23 Correct 0 ms 348 KB Output is correct
24 Correct 0 ms 348 KB Output is correct
25 Correct 0 ms 348 KB Output is correct
26 Correct 1 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 348 KB Output is correct
31 Correct 0 ms 348 KB Output is correct
32 Correct 0 ms 600 KB Output is correct
33 Correct 41 ms 16208 KB Output is correct
34 Correct 19 ms 18888 KB Output is correct
35 Correct 18 ms 18116 KB Output is correct
36 Correct 43 ms 26008 KB Output is correct
37 Correct 43 ms 25760 KB Output is correct
38 Correct 44 ms 27068 KB Output is correct
39 Correct 42 ms 24408 KB Output is correct
40 Correct 23 ms 19876 KB Output is correct
41 Correct 44 ms 26060 KB Output is correct
42 Correct 22 ms 19912 KB Output is correct
43 Correct 441 ms 256196 KB Output is correct
44 Correct 140 ms 195052 KB Output is correct
45 Correct 186 ms 187484 KB Output is correct
46 Correct 443 ms 256976 KB Output is correct
47 Correct 447 ms 255128 KB Output is correct
48 Correct 570 ms 256916 KB Output is correct
49 Correct 379 ms 242576 KB Output is correct
50 Correct 208 ms 195564 KB Output is correct
51 Correct 456 ms 256156 KB Output is correct
52 Correct 229 ms 196760 KB Output is correct