Submission #248892

# Submission time Handle Problem Language Result Execution time Memory
248892 2020-07-13T17:09:49 Z kshitij_sodani Boxes with souvenirs (IOI15_boxes) C++14
100 / 100
1062 ms 177068 KB
#include <bits/stdc++.h>
using namespace std;
typedef long long llo;
#define mp make_pair
#define pb push_back
#define a first 
#define b second
//#include "boxes.h"
llo dp[10000001];
long long delivery(int n, int k, int ll, int it[]) {
	sort(it,it+n);
	for(int i=0;i<n;i++){
		dp[i]=-1;
	}
	llo l=ll;
	deque<pair<llo,int>> aa;
	deque<pair<llo,int>> bb;

	dp[0]=min((llo)(it[0]*2),l*2-(llo)it[0]*2);

	for(int i=1;i<n;i++){
		llo cc=dp[i-1]+(l-it[i])*2;
		while(aa.size()){
			if(aa.back().a>=cc){
				aa.pop_back();
			}
			else{
				break;
			}
		}
		aa.pb({cc,i-1});
		cc=dp[i-1];
		while(bb.size()){
			if(bb.back().a>=cc){
				bb.pop_back();
			}
			else{
				break;
			}
		}
		bb.pb({cc,i-1});
		while(aa.size()){
			if(aa.front().b<i-k){
				aa.pop_front();
				continue;
			}
			else{
				break;
			}
		}
		while(bb.size()){
			if(bb.front().b<i-k){
				bb.pop_front();
				continue;
			}
			else{
				break;
			}
		}
		dp[i]=bb.front().a+min(l,(llo)it[i]*2);
		dp[i]=min(dp[i],aa.front().a);
		if(i<k){
			dp[i]=min(dp[i],(llo)(it[i]*2));
			dp[i]=min(dp[i],(llo)(l));
			dp[i]=min(dp[i],(llo)(l*2-it[0]*2));
		}
		/*for(int j=max(0,i-k+1);j<=i;j++){
			llo cost=l;
			cost=min(cost,it[i]*(llo)2);
			cost=min(cost,(l-it[j])*(llo)2);
			if(j>0){
				cost+=dp[j-1];
			}
			if(dp[i]==-1){
				dp[i]=cost;
			}
			dp[i]=min(dp[i],cost);
		}*/
	}



    return dp[n-1];
}


/*int main(){
	ios_base::sync_with_stdio(false);
	cin.tie(NULL);


	return 0;
}*/

/*
g++  -o aa -O2 box.cpp grader.cpp -std=c++14
*/
# Verdict Execution time Memory Grader output
1 Correct 0 ms 256 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 1 ms 384 KB Output is correct
7 Correct 0 ms 384 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 0 ms 384 KB Output is correct
4 Correct 0 ms 384 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 0 ms 384 KB Output is correct
7 Correct 0 ms 384 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 0 ms 256 KB Output is correct
2 Correct 0 ms 256 KB Output is correct
3 Correct 0 ms 256 KB Output is correct
4 Correct 0 ms 256 KB Output is correct
5 Correct 0 ms 256 KB Output is correct
6 Correct 0 ms 256 KB Output is correct
7 Correct 0 ms 256 KB Output is correct
8 Correct 0 ms 256 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 0 ms 256 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 1 ms 384 KB Output is correct
7 Correct 0 ms 384 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 1 ms 384 KB Output is correct
10 Correct 0 ms 384 KB Output is correct
11 Correct 0 ms 384 KB Output is correct
12 Correct 1 ms 384 KB Output is correct
13 Correct 0 ms 384 KB Output is correct
14 Correct 0 ms 384 KB Output is correct
15 Correct 0 ms 256 KB Output is correct
16 Correct 0 ms 256 KB Output is correct
17 Correct 0 ms 256 KB Output is correct
18 Correct 0 ms 256 KB Output is correct
19 Correct 0 ms 256 KB Output is correct
20 Correct 0 ms 256 KB Output is correct
21 Correct 0 ms 256 KB Output is correct
22 Correct 0 ms 256 KB Output is correct
23 Correct 0 ms 384 KB Output is correct
24 Correct 0 ms 384 KB Output is correct
25 Correct 0 ms 384 KB Output is correct
26 Correct 0 ms 384 KB Output is correct
27 Correct 0 ms 384 KB Output is correct
28 Correct 0 ms 384 KB Output is correct
29 Correct 0 ms 384 KB Output is correct
30 Correct 0 ms 384 KB Output is correct
31 Correct 0 ms 384 KB Output is correct
32 Correct 0 ms 384 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 0 ms 256 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 1 ms 384 KB Output is correct
7 Correct 0 ms 384 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 1 ms 384 KB Output is correct
10 Correct 0 ms 384 KB Output is correct
11 Correct 0 ms 384 KB Output is correct
12 Correct 1 ms 384 KB Output is correct
13 Correct 0 ms 384 KB Output is correct
14 Correct 0 ms 384 KB Output is correct
15 Correct 0 ms 256 KB Output is correct
16 Correct 0 ms 256 KB Output is correct
17 Correct 0 ms 256 KB Output is correct
18 Correct 0 ms 256 KB Output is correct
19 Correct 0 ms 256 KB Output is correct
20 Correct 0 ms 256 KB Output is correct
21 Correct 0 ms 256 KB Output is correct
22 Correct 0 ms 256 KB Output is correct
23 Correct 0 ms 384 KB Output is correct
24 Correct 0 ms 384 KB Output is correct
25 Correct 0 ms 384 KB Output is correct
26 Correct 0 ms 384 KB Output is correct
27 Correct 0 ms 384 KB Output is correct
28 Correct 0 ms 384 KB Output is correct
29 Correct 0 ms 384 KB Output is correct
30 Correct 0 ms 384 KB Output is correct
31 Correct 0 ms 384 KB Output is correct
32 Correct 0 ms 384 KB Output is correct
33 Correct 99 ms 12180 KB Output is correct
34 Correct 58 ms 14072 KB Output is correct
35 Correct 67 ms 14712 KB Output is correct
36 Correct 92 ms 21880 KB Output is correct
37 Correct 91 ms 21880 KB Output is correct
38 Correct 91 ms 21884 KB Output is correct
39 Correct 97 ms 20344 KB Output is correct
40 Correct 68 ms 15736 KB Output is correct
41 Correct 103 ms 21828 KB Output is correct
42 Correct 67 ms 15992 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 0 ms 256 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 1 ms 384 KB Output is correct
7 Correct 0 ms 384 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 1 ms 384 KB Output is correct
10 Correct 0 ms 384 KB Output is correct
11 Correct 0 ms 384 KB Output is correct
12 Correct 1 ms 384 KB Output is correct
13 Correct 0 ms 384 KB Output is correct
14 Correct 0 ms 384 KB Output is correct
15 Correct 0 ms 256 KB Output is correct
16 Correct 0 ms 256 KB Output is correct
17 Correct 0 ms 256 KB Output is correct
18 Correct 0 ms 256 KB Output is correct
19 Correct 0 ms 256 KB Output is correct
20 Correct 0 ms 256 KB Output is correct
21 Correct 0 ms 256 KB Output is correct
22 Correct 0 ms 256 KB Output is correct
23 Correct 0 ms 384 KB Output is correct
24 Correct 0 ms 384 KB Output is correct
25 Correct 0 ms 384 KB Output is correct
26 Correct 0 ms 384 KB Output is correct
27 Correct 0 ms 384 KB Output is correct
28 Correct 0 ms 384 KB Output is correct
29 Correct 0 ms 384 KB Output is correct
30 Correct 0 ms 384 KB Output is correct
31 Correct 0 ms 384 KB Output is correct
32 Correct 0 ms 384 KB Output is correct
33 Correct 99 ms 12180 KB Output is correct
34 Correct 58 ms 14072 KB Output is correct
35 Correct 67 ms 14712 KB Output is correct
36 Correct 92 ms 21880 KB Output is correct
37 Correct 91 ms 21880 KB Output is correct
38 Correct 91 ms 21884 KB Output is correct
39 Correct 97 ms 20344 KB Output is correct
40 Correct 68 ms 15736 KB Output is correct
41 Correct 103 ms 21828 KB Output is correct
42 Correct 67 ms 15992 KB Output is correct
43 Correct 1062 ms 177068 KB Output is correct
44 Correct 581 ms 137360 KB Output is correct
45 Correct 631 ms 124644 KB Output is correct
46 Correct 901 ms 144808 KB Output is correct
47 Correct 899 ms 144632 KB Output is correct
48 Correct 888 ms 144484 KB Output is correct
49 Correct 1012 ms 159600 KB Output is correct
50 Correct 646 ms 126708 KB Output is correct
51 Correct 1028 ms 143932 KB Output is correct
52 Correct 646 ms 127224 KB Output is correct