Submission #198885

# Submission time Handle Problem Language Result Execution time Memory
198885 2020-01-28T01:57:12 Z Sakamotoo Boxes with souvenirs (IOI15_boxes) C++14
10 / 100
5 ms 380 KB
#include "boxes.h"
#include<bits/stdc++.h>
using namespace std;

long long delivery(int n, int k, int l, int p[]) {
	long long dp1[n+1],dp2[n+1];
    long long jaw=1e18;
    dp1[0]=0;
    dp2[0]=0;
   // sort(p,p+n);
    for(int i=0; i<n; i++){
    	int x=i-k+1;
		int y=n-i-1;
    	if(x<0){
    		int y=n-i-1;
    		dp1[i+1]=p[i]+min(p[i],l-p[i]);
    		dp2[i+1]=l-p[y]+min(p[y],l-p[y]);
		}else {
			dp1[i+1]=dp1[x]+p[i]+min(p[i],l-p[i]);
			dp2[i+1]=dp2[x]+l-p[y]+min(p[y],l-p[y]);
		}
		//cout<<dp1[i+1]<<' '<<dp2[i+1]<<endl;
	}
	long long bef=1e18;
	for(int i=0; i<=n; i++){
		jaw=min(jaw,dp1[i]+dp2[n-i]);
		if(jaw<bef) bef=jaw;
		else break;
	}
	return jaw;
}

Compilation message

boxes.cpp: In function 'long long int delivery(int, int, int, int*)':
boxes.cpp:15:11: warning: declaration of 'y' shadows a previous local [-Wshadow]
       int y=n-i-1;
           ^
boxes.cpp:13:7: note: shadowed declaration is here
   int y=n-i-1;
       ^
# Verdict Execution time Memory Grader output
1 Correct 5 ms 256 KB Output is correct
2 Correct 5 ms 376 KB Output is correct
3 Correct 5 ms 380 KB Output is correct
4 Correct 5 ms 376 KB Output is correct
5 Correct 5 ms 376 KB Output is correct
6 Correct 5 ms 376 KB Output is correct
7 Correct 5 ms 376 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 5 ms 376 KB Output is correct
2 Correct 5 ms 376 KB Output is correct
3 Incorrect 5 ms 376 KB Output isn't correct
4 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Incorrect 5 ms 256 KB Output isn't correct
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 5 ms 256 KB Output is correct
2 Correct 5 ms 376 KB Output is correct
3 Correct 5 ms 380 KB Output is correct
4 Correct 5 ms 376 KB Output is correct
5 Correct 5 ms 376 KB Output is correct
6 Correct 5 ms 376 KB Output is correct
7 Correct 5 ms 376 KB Output is correct
8 Correct 5 ms 376 KB Output is correct
9 Correct 5 ms 376 KB Output is correct
10 Incorrect 5 ms 376 KB Output isn't correct
11 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 5 ms 256 KB Output is correct
2 Correct 5 ms 376 KB Output is correct
3 Correct 5 ms 380 KB Output is correct
4 Correct 5 ms 376 KB Output is correct
5 Correct 5 ms 376 KB Output is correct
6 Correct 5 ms 376 KB Output is correct
7 Correct 5 ms 376 KB Output is correct
8 Correct 5 ms 376 KB Output is correct
9 Correct 5 ms 376 KB Output is correct
10 Incorrect 5 ms 376 KB Output isn't correct
11 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 5 ms 256 KB Output is correct
2 Correct 5 ms 376 KB Output is correct
3 Correct 5 ms 380 KB Output is correct
4 Correct 5 ms 376 KB Output is correct
5 Correct 5 ms 376 KB Output is correct
6 Correct 5 ms 376 KB Output is correct
7 Correct 5 ms 376 KB Output is correct
8 Correct 5 ms 376 KB Output is correct
9 Correct 5 ms 376 KB Output is correct
10 Incorrect 5 ms 376 KB Output isn't correct
11 Halted 0 ms 0 KB -