oj.uz

답안 #134568

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
134568 2019-07-23T04:05:35 Z 20160161simone 선물상자 (IOI15_boxes) C++14
100 / 100
 648 ms 293596 KB 
#include "boxes.h"
#include <bits/stdc++.h>
#define M 10000010
#define inf 0x3f3f3f3f3f3f3f
using namespace std;
long long mi[M],dpl[M],dpr[M];
long long delivery(int N, int K, int L, int p[]) 
{
    if(K==1)
    {
    	long long ans=0;
    	for(int i=0;i<N;i++) ans+=min(abs(L-p[i]),abs(p[i]))*2;
    	return ans;
	}
	if(K==N)
	{
		int li=p[0],lx=p[0],ri=p[N-1],rx=p[N-1];
        for (int i=0;i<N;i++)
		{
            if(p[i]*2<L) lx=p[i];
            if(p[i]*2==L) return L;
            if(p[i]*2>L) 
			{
				ri=p[i];
				break;
			}
        }
        if(li*2>L) return (L-li)*2;//*
		else 
			if(rx*2<L)return rx*2;//*
			else
            	if (L<lx*2+(L-ri)*2) return L;
            	else return lx*2+(L-ri)*2;//*
	}
	dpl[0]=0;
	for(int i=1;i<=N;i++) dpl[i]=dpl[max(i-K,0)]+p[i-1]*2;
	dpr[N+1]=0;
	for(int i=N;i>=1;i--) dpr[i]=dpr[min(N+1,i+K)]+(L-p[i-1])*2;
	long long ans=inf;
	for(int i=1;i<=N+1;i++) ans=min(ans,dpl[i-1]+dpr[i]);
	for(int i=0;i<N;i++)
	{
		if(i+K<=N)
		{
			ans=min(ans,L+dpl[i]+dpr[i+K+1]);
		}
	}
	return ans;
}

Subtask #1
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 256 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 2 ms 256 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 2 ms 380 KB Output is correct
7 Correct 2 ms 376 KB Output is correct

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 2 ms 256 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 2 ms 376 KB Output is correct

Subtask #3
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 2 ms 376 KB Output is correct
8 Correct 2 ms 380 KB Output is correct

Subtask #4
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 256 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 2 ms 256 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 2 ms 380 KB Output is correct
7 Correct 2 ms 376 KB Output is correct
8 Correct 2 ms 376 KB Output is correct
9 Correct 2 ms 376 KB Output is correct
10 Correct 2 ms 376 KB Output is correct
11 Correct 2 ms 376 KB Output is correct
12 Correct 2 ms 256 KB Output is correct
13 Correct 2 ms 376 KB Output is correct
14 Correct 2 ms 376 KB Output is correct
15 Correct 2 ms 376 KB Output is correct
16 Correct 2 ms 376 KB Output is correct
17 Correct 2 ms 376 KB Output is correct
18 Correct 2 ms 376 KB Output is correct
19 Correct 2 ms 376 KB Output is correct
20 Correct 2 ms 376 KB Output is correct
21 Correct 2 ms 376 KB Output is correct
22 Correct 2 ms 380 KB Output is correct
23 Correct 2 ms 376 KB Output is correct
24 Correct 2 ms 376 KB Output is correct
25 Correct 2 ms 376 KB Output is correct
26 Correct 2 ms 376 KB Output is correct
27 Correct 2 ms 376 KB Output is correct
28 Correct 2 ms 376 KB Output is correct
29 Correct 2 ms 376 KB Output is correct
30 Correct 2 ms 376 KB Output is correct
31 Correct 2 ms 376 KB Output is correct
32 Correct 2 ms 376 KB Output is correct

Subtask #5
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 256 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 2 ms 256 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 2 ms 380 KB Output is correct
7 Correct 2 ms 376 KB Output is correct
8 Correct 2 ms 376 KB Output is correct
9 Correct 2 ms 376 KB Output is correct
10 Correct 2 ms 376 KB Output is correct
11 Correct 2 ms 376 KB Output is correct
12 Correct 2 ms 256 KB Output is correct
13 Correct 2 ms 376 KB Output is correct
14 Correct 2 ms 376 KB Output is correct
15 Correct 2 ms 376 KB Output is correct
16 Correct 2 ms 376 KB Output is correct
17 Correct 2 ms 376 KB Output is correct
18 Correct 2 ms 376 KB Output is correct
19 Correct 2 ms 376 KB Output is correct
20 Correct 2 ms 376 KB Output is correct
21 Correct 2 ms 376 KB Output is correct
22 Correct 2 ms 380 KB Output is correct
23 Correct 2 ms 376 KB Output is correct
24 Correct 2 ms 376 KB Output is correct
25 Correct 2 ms 376 KB Output is correct
26 Correct 2 ms 376 KB Output is correct
27 Correct 2 ms 376 KB Output is correct
28 Correct 2 ms 376 KB Output is correct
29 Correct 2 ms 376 KB Output is correct
30 Correct 2 ms 376 KB Output is correct
31 Correct 2 ms 376 KB Output is correct
32 Correct 2 ms 376 KB Output is correct
33 Correct 64 ms 29620 KB Output is correct
34 Correct 33 ms 21880 KB Output is correct
35 Correct 33 ms 22392 KB Output is correct
36 Correct 65 ms 29648 KB Output is correct
37 Correct 63 ms 29688 KB Output is correct
38 Correct 63 ms 29688 KB Output is correct
39 Correct 56 ms 28152 KB Output is correct
40 Correct 37 ms 23544 KB Output is correct
41 Correct 62 ms 29816 KB Output is correct
42 Correct 38 ms 23928 KB Output is correct

Subtask #6
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 256 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 2 ms 256 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 2 ms 380 KB Output is correct
7 Correct 2 ms 376 KB Output is correct
8 Correct 2 ms 376 KB Output is correct
9 Correct 2 ms 376 KB Output is correct
10 Correct 2 ms 376 KB Output is correct
11 Correct 2 ms 376 KB Output is correct
12 Correct 2 ms 256 KB Output is correct
13 Correct 2 ms 376 KB Output is correct
14 Correct 2 ms 376 KB Output is correct
15 Correct 2 ms 376 KB Output is correct
16 Correct 2 ms 376 KB Output is correct
17 Correct 2 ms 376 KB Output is correct
18 Correct 2 ms 376 KB Output is correct
19 Correct 2 ms 376 KB Output is correct
20 Correct 2 ms 376 KB Output is correct
21 Correct 2 ms 376 KB Output is correct
22 Correct 2 ms 380 KB Output is correct
23 Correct 2 ms 376 KB Output is correct
24 Correct 2 ms 376 KB Output is correct
25 Correct 2 ms 376 KB Output is correct
26 Correct 2 ms 376 KB Output is correct
27 Correct 2 ms 376 KB Output is correct
28 Correct 2 ms 376 KB Output is correct
29 Correct 2 ms 376 KB Output is correct
30 Correct 2 ms 376 KB Output is correct
31 Correct 2 ms 376 KB Output is correct
32 Correct 2 ms 376 KB Output is correct
33 Correct 64 ms 29620 KB Output is correct
34 Correct 33 ms 21880 KB Output is correct
35 Correct 33 ms 22392 KB Output is correct
36 Correct 65 ms 29648 KB Output is correct
37 Correct 63 ms 29688 KB Output is correct
38 Correct 63 ms 29688 KB Output is correct
39 Correct 56 ms 28152 KB Output is correct
40 Correct 37 ms 23544 KB Output is correct
41 Correct 62 ms 29816 KB Output is correct
42 Correct 38 ms 23928 KB Output is correct
43 Correct 611 ms 292672 KB Output is correct
44 Correct 286 ms 215700 KB Output is correct
45 Correct 314 ms 223404 KB Output is correct
46 Correct 631 ms 293408 KB Output is correct
47 Correct 614 ms 293028 KB Output is correct
48 Correct 616 ms 293596 KB Output is correct
49 Correct 560 ms 277892 KB Output is correct
50 Correct 396 ms 232440 KB Output is correct
51 Correct 648 ms 292344 KB Output is correct
52 Correct 369 ms 235172 KB Output is correct