Submission #198896

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
198896	2020-01-28T02:11:33 Z	Sakamotoo	Boxes with souvenirs (IOI15_boxes)	C++14	70 / 100	2000 ms	292600 KB

boxes

#include "boxes.h"
#include<bits/stdc++.h>
#pragma comment(linker, "/stack:200000000")
#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
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=LLONG_MAX;
    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;
	int cnt=0;
	for(int i=0; i<=n; i++){
		jaw=min(jaw,dp1[i]+dp2[n-i]);
		if(jaw<bef) {
			bef=jaw;
			cnt=0;
		}else {
			cnt++;
			if(cnt>1000000) break;
		}
	}
	return jaw;
}

Compilation message

boxes.cpp:3:0: warning: ignoring #pragma comment  [-Wunknown-pragmas]
 #pragma comment(linker, "/stack:200000000")
 
boxes.cpp: In function 'long long int delivery(int, int, int, int*)':
boxes.cpp:18:11: warning: declaration of 'y' shadows a previous local [-Wshadow]
       int y=n-i-1;
           ^
boxes.cpp:16:7: note: shadowed declaration is here
   int y=n-i-1;
       ^

Subtask #1

10.0 / 10.0

#	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	Correct	5 ms	376 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

Subtask #2

10.0 / 10.0

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

Subtask #3

15.0 / 15.0

#	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	Correct	5 ms	256 KB	Output is correct
4	Correct	5 ms	256 KB	Output is correct
5	Correct	5 ms	256 KB	Output is correct
6	Correct	5 ms	256 KB	Output is correct
7	Correct	5 ms	256 KB	Output is correct
8	Correct	5 ms	256 KB	Output is correct

Subtask #4

15.0 / 15.0

#	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	Correct	5 ms	376 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	504 KB	Output is correct
10	Correct	5 ms	376 KB	Output is correct
11	Correct	5 ms	380 KB	Output is correct
12	Correct	5 ms	376 KB	Output is correct
13	Correct	5 ms	376 KB	Output is correct
14	Correct	6 ms	376 KB	Output is correct
15	Correct	5 ms	376 KB	Output is correct
16	Correct	5 ms	376 KB	Output is correct
17	Correct	5 ms	256 KB	Output is correct
18	Correct	5 ms	256 KB	Output is correct
19	Correct	5 ms	256 KB	Output is correct
20	Correct	5 ms	256 KB	Output is correct
21	Correct	5 ms	256 KB	Output is correct
22	Correct	5 ms	256 KB	Output is correct
23	Correct	5 ms	376 KB	Output is correct
24	Correct	5 ms	376 KB	Output is correct
25	Correct	5 ms	376 KB	Output is correct
26	Correct	5 ms	376 KB	Output is correct
27	Correct	5 ms	376 KB	Output is correct
28	Correct	5 ms	376 KB	Output is correct
29	Correct	5 ms	376 KB	Output is correct
30	Correct	5 ms	376 KB	Output is correct
31	Correct	6 ms	504 KB	Output is correct
32	Correct	5 ms	376 KB	Output is correct

Subtask #5

20.0 / 20.0

#	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	Correct	5 ms	376 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	504 KB	Output is correct
10	Correct	5 ms	376 KB	Output is correct
11	Correct	5 ms	380 KB	Output is correct
12	Correct	5 ms	376 KB	Output is correct
13	Correct	5 ms	376 KB	Output is correct
14	Correct	6 ms	376 KB	Output is correct
15	Correct	5 ms	376 KB	Output is correct
16	Correct	5 ms	376 KB	Output is correct
17	Correct	5 ms	256 KB	Output is correct
18	Correct	5 ms	256 KB	Output is correct
19	Correct	5 ms	256 KB	Output is correct
20	Correct	5 ms	256 KB	Output is correct
21	Correct	5 ms	256 KB	Output is correct
22	Correct	5 ms	256 KB	Output is correct
23	Correct	5 ms	376 KB	Output is correct
24	Correct	5 ms	376 KB	Output is correct
25	Correct	5 ms	376 KB	Output is correct
26	Correct	5 ms	376 KB	Output is correct
27	Correct	5 ms	376 KB	Output is correct
28	Correct	5 ms	376 KB	Output is correct
29	Correct	5 ms	376 KB	Output is correct
30	Correct	5 ms	376 KB	Output is correct
31	Correct	6 ms	504 KB	Output is correct
32	Correct	5 ms	376 KB	Output is correct
33	Correct	65 ms	19832 KB	Output is correct
34	Correct	29 ms	19832 KB	Output is correct
35	Correct	30 ms	19832 KB	Output is correct
36	Correct	61 ms	19960 KB	Output is correct
37	Correct	62 ms	19832 KB	Output is correct
38	Correct	59 ms	19832 KB	Output is correct
39	Correct	55 ms	19832 KB	Output is correct
40	Correct	36 ms	19832 KB	Output is correct
41	Correct	62 ms	19832 KB	Output is correct
42	Correct	37 ms	19960 KB	Output is correct

Subtask #6

0 / 30.0

#	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	Correct	5 ms	376 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	504 KB	Output is correct
10	Correct	5 ms	376 KB	Output is correct
11	Correct	5 ms	380 KB	Output is correct
12	Correct	5 ms	376 KB	Output is correct
13	Correct	5 ms	376 KB	Output is correct
14	Correct	6 ms	376 KB	Output is correct
15	Correct	5 ms	376 KB	Output is correct
16	Correct	5 ms	376 KB	Output is correct
17	Correct	5 ms	256 KB	Output is correct
18	Correct	5 ms	256 KB	Output is correct
19	Correct	5 ms	256 KB	Output is correct
20	Correct	5 ms	256 KB	Output is correct
21	Correct	5 ms	256 KB	Output is correct
22	Correct	5 ms	256 KB	Output is correct
23	Correct	5 ms	376 KB	Output is correct
24	Correct	5 ms	376 KB	Output is correct
25	Correct	5 ms	376 KB	Output is correct
26	Correct	5 ms	376 KB	Output is correct
27	Correct	5 ms	376 KB	Output is correct
28	Correct	5 ms	376 KB	Output is correct
29	Correct	5 ms	376 KB	Output is correct
30	Correct	5 ms	376 KB	Output is correct
31	Correct	6 ms	504 KB	Output is correct
32	Correct	5 ms	376 KB	Output is correct
33	Correct	65 ms	19832 KB	Output is correct
34	Correct	29 ms	19832 KB	Output is correct
35	Correct	30 ms	19832 KB	Output is correct
36	Correct	61 ms	19960 KB	Output is correct
37	Correct	62 ms	19832 KB	Output is correct
38	Correct	59 ms	19832 KB	Output is correct
39	Correct	55 ms	19832 KB	Output is correct
40	Correct	36 ms	19832 KB	Output is correct
41	Correct	62 ms	19832 KB	Output is correct
42	Correct	37 ms	19960 KB	Output is correct
43	Correct	552 ms	196048 KB	Output is correct
44	Correct	222 ms	196088 KB	Output is correct
45	Correct	240 ms	195960 KB	Output is correct
46	Correct	551 ms	195964 KB	Output is correct
47	Correct	541 ms	195960 KB	Output is correct
48	Correct	529 ms	196088 KB	Output is correct
49	Correct	513 ms	195964 KB	Output is correct
50	Correct	997 ms	232440 KB	Output is correct
51	Execution timed out	2326 ms	292600 KB	Time limit exceeded
52	Halted	0 ms	0 KB	-