oj.uz

답안 #238965

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
238965 2020-06-13T19:30:52 Z Fasho 선물상자 (IOI15_boxes) C++14
100 / 100
 583 ms 245112 KB 
#include <bits/stdc++.h>
#define TT 10000005
#define ll long long int 	
#define MP make_pair
#define pb push_back
#define ppb pop_back
#define sp " "
#define endl "\n"
#define fi first
#define se second
#define ii pair<int,int>
#define lli pair<ll,ll>
#define fast cin.tie(0);cout.tie(0);ios_base::sync_with_stdio(false)
#define fast2 freopen ("in.txt","r",stdin);freopen ("out.txt","w",stdout);
#define mod 1000000007
#define fs(x,y) for(ll i=1;i<=y;i++) cin>>x[i]
#define fo(i,x,y) for(ll i=x;i<=y;i++)
#define INF 1000000000005
#define ull unsigned long long int
#include "boxes.h"
using namespace std;

int ar[TT],n;
ll tut1[TT],tut2[TT];

int bos[TT];
ll sum=1e18;;


long long delivery(int m, int k, int l, int p[]) {

	n=m;
	// fo(i,0,n-1)
	// 	p[i]=ar[i];
	fo(i,0,n-1)
		ar[i]=p[i];
	fo(i,0,n-1)
	{
		if(i<k)
			tut1[i]=ar[i]*2;
		else
			tut1[i]=tut1[i-k]+ar[i]*2;
	}
	for(int i=n-1;i>=0;i--)
	{
		if(n-i+1<k)
			tut2[i]=(l-ar[i])*2;
		else
			tut2[i]=tut2[i+k]+(l-ar[i])*2;
	}

    fo(i,0,n-2)
    	sum=min(sum,tut1[i]+tut2[i+1]);
    sum=min(sum,tut2[0]);
    sum=min(sum,tut1[n-1]);

    fo(i,0,n-1)
    {
    	ll x=i+k;
    	// if(x>=n)
    	// 	break;
    	ll top=l;
    	if(i>0)
    		top+=tut1[i-1];
    	if(x<n)
    		top+=tut2[x];
    	sum=min(sum,top);
    }


    return sum;
}

// int main()
// {
// 	fast2;
// 	fast;
// 	int a,b;
// 	cin>>n>>a>>b;
// 	fo(i,0,n-1)
// 	cin>>ar[i];
// 	cout<<delivery(n,a,b,bos);
// }

Subtask #1
10.0 / 10.0

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

Subtask #2
10.0 / 10.0

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

Subtask #3
15.0 / 15.0

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

Subtask #4
15.0 / 15.0

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

Subtask #5
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 384 KB Output is correct
2 Correct 5 ms 384 KB Output is correct
3 Correct 5 ms 384 KB Output is correct
4 Correct 5 ms 384 KB Output is correct
5 Correct 4 ms 384 KB Output is correct
6 Correct 5 ms 384 KB Output is correct
7 Correct 5 ms 384 KB Output is correct
8 Correct 5 ms 384 KB Output is correct
9 Correct 4 ms 384 KB Output is correct
10 Correct 4 ms 384 KB Output is correct
11 Correct 5 ms 384 KB Output is correct
12 Correct 5 ms 384 KB Output is correct
13 Correct 5 ms 384 KB Output is correct
14 Correct 4 ms 384 KB Output is correct
15 Correct 5 ms 384 KB Output is correct
16 Correct 5 ms 384 KB Output is correct
17 Correct 4 ms 384 KB Output is correct
18 Correct 5 ms 384 KB Output is correct
19 Correct 5 ms 384 KB Output is correct
20 Correct 5 ms 384 KB Output is correct
21 Correct 4 ms 384 KB Output is correct
22 Correct 4 ms 384 KB Output is correct
23 Correct 5 ms 384 KB Output is correct
24 Correct 4 ms 384 KB Output is correct
25 Correct 5 ms 384 KB Output is correct
26 Correct 5 ms 384 KB Output is correct
27 Correct 4 ms 384 KB Output is correct
28 Correct 5 ms 384 KB Output is correct
29 Correct 4 ms 384 KB Output is correct
30 Correct 5 ms 384 KB Output is correct
31 Correct 5 ms 384 KB Output is correct
32 Correct 5 ms 384 KB Output is correct
33 Correct 63 ms 28792 KB Output is correct
34 Correct 29 ms 25728 KB Output is correct
35 Correct 32 ms 26240 KB Output is correct
36 Correct 63 ms 28796 KB Output is correct
37 Correct 64 ms 28920 KB Output is correct
38 Correct 63 ms 28792 KB Output is correct
39 Correct 61 ms 28792 KB Output is correct
40 Correct 37 ms 27512 KB Output is correct
41 Correct 63 ms 28920 KB Output is correct
42 Correct 41 ms 27768 KB Output is correct

Subtask #6
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 384 KB Output is correct
2 Correct 5 ms 384 KB Output is correct
3 Correct 5 ms 384 KB Output is correct
4 Correct 5 ms 384 KB Output is correct
5 Correct 4 ms 384 KB Output is correct
6 Correct 5 ms 384 KB Output is correct
7 Correct 5 ms 384 KB Output is correct
8 Correct 5 ms 384 KB Output is correct
9 Correct 4 ms 384 KB Output is correct
10 Correct 4 ms 384 KB Output is correct
11 Correct 5 ms 384 KB Output is correct
12 Correct 5 ms 384 KB Output is correct
13 Correct 5 ms 384 KB Output is correct
14 Correct 4 ms 384 KB Output is correct
15 Correct 5 ms 384 KB Output is correct
16 Correct 5 ms 384 KB Output is correct
17 Correct 4 ms 384 KB Output is correct
18 Correct 5 ms 384 KB Output is correct
19 Correct 5 ms 384 KB Output is correct
20 Correct 5 ms 384 KB Output is correct
21 Correct 4 ms 384 KB Output is correct
22 Correct 4 ms 384 KB Output is correct
23 Correct 5 ms 384 KB Output is correct
24 Correct 4 ms 384 KB Output is correct
25 Correct 5 ms 384 KB Output is correct
26 Correct 5 ms 384 KB Output is correct
27 Correct 4 ms 384 KB Output is correct
28 Correct 5 ms 384 KB Output is correct
29 Correct 4 ms 384 KB Output is correct
30 Correct 5 ms 384 KB Output is correct
31 Correct 5 ms 384 KB Output is correct
32 Correct 5 ms 384 KB Output is correct
33 Correct 63 ms 28792 KB Output is correct
34 Correct 29 ms 25728 KB Output is correct
35 Correct 32 ms 26240 KB Output is correct
36 Correct 63 ms 28796 KB Output is correct
37 Correct 64 ms 28920 KB Output is correct
38 Correct 63 ms 28792 KB Output is correct
39 Correct 61 ms 28792 KB Output is correct
40 Correct 37 ms 27512 KB Output is correct
41 Correct 63 ms 28920 KB Output is correct
42 Correct 41 ms 27768 KB Output is correct
43 Correct 564 ms 237432 KB Output is correct
44 Correct 245 ms 237816 KB Output is correct
45 Correct 272 ms 237896 KB Output is correct
46 Correct 563 ms 237356 KB Output is correct
47 Correct 583 ms 237368 KB Output is correct
48 Correct 558 ms 237176 KB Output is correct
49 Correct 515 ms 237304 KB Output is correct
50 Correct 332 ms 243576 KB Output is correct
51 Correct 570 ms 237204 KB Output is correct
52 Correct 328 ms 245112 KB Output is correct