답안 #136981

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
136981	2019-07-26T19:51:13 Z	arthurconmy	선물상자 (IOI15_boxes)	C++14	70 / 100	521 ms	207940 KB

boxes

#include <bits/stdc++.h>

#ifndef ARTHUR_LOCAL
	#include "boxes.h"
#endif

using namespace std;

using ll = long long;

const int MAXN = 1000001; // increase to 10^7 for last subtask

int locs[2][MAXN]; // the locations of the souvenirs on each side of the start
ll dp[2][MAXN];
int side_count[2];
ll ans[MAXN]; // MAXK == MAXN

ll CEIL(int a, int b)
{
	if(a%b == 0) return ll(a/b);
	return ll(a/b) + 1LL;
}

ll delivery(int n, int k, int l, int P[]) 
{
    // intialise things

    for(int i=0; i<MAXN; i++)
    {
    	locs[0][i]=-1;
    	locs[1][i]=-1;
    	ans[i]=1e18;
    }

    // do things

    if(n==1) return 2LL*ll(min(P[0],l-P[0]));

    side_count[0]=0;
    side_count[1]=0;

    for(int i=0; i<n; i++)
    {
    	if(P[i] <= int(l/2))
    	{
    		locs[0][++side_count[0]] = P[i];
    		//cout << "0: " << P[i] << endl;
    	}
    }

    for(int i=n-1; i>=0; i--)
    {
    	if(P[i] > int(l/2))
    	{
    		locs[1][++side_count[1]] = l-P[i];
    	}
    }

    for(int ind=0; ind<=1; ind++) // compute both sides of the dp
    {    	
    	for(int i=1; i<=side_count[ind]; i++)
    	{
    		// calculating dp[ind][i]

    		dp[ind][i] = 2*locs[ind][i] + dp[ind][max(0,i-k)];
    		//cout << ind << " " << i << " " << dp[ind][i] << endl; 
    	
    		// this easy ???
    	}
    }

    // now we need do the residues (mod k) bit
    // should we add the excess residue here? I think yes

    for(int cut=0; cut<=side_count[0]; cut++)
    {
    	// possibly recalculate a minimum for ans[cut % k]
    
    	ll cur = dp[0][side_count[0]-cut];

    	cur += ll(l)*CEIL(cut,k);

    	// cout << cut << " " << cur << endl;

    	ans[cut%k] = min(ans[cut%k], cur);
    }

    ll ret=1e18;

    int bigk=k;

    while(bigk<1000000 && bigk != 1) bigk*=k; // PROBABLY CHANGE FOR LAST SUBTASK

    if(bigk==1) bigk = 1000000;

    for(int cut2=0; cut2<=side_count[1]; cut2++)
    {
    	ll cur = dp[1][side_count[1]-cut2];

    	cur += ll(l)*ll(int(cut2/k)) + ans[(bigk-cut2)%k];

    	ret = min(ret,cur);
    }

    if(k>=n) ret=min(ret,ll(l));

    return ret;
}

#ifdef ARTHUR_LOCAL

	int A[MAXN];

	int main()
	{
		A[0]=1;
		A[1]=2;
		A[2]=6;
		A[3]=7;


		cout << delivery(4,2,8,A) << endl;
	}

#endif

Subtask #1
10.0 / 10.0

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

Subtask #2
10.0 / 10.0

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

Subtask #3
15.0 / 15.0

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

Subtask #4
15.0 / 15.0

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

Subtask #5
20.0 / 20.0

#	결과	실행 시간	메모리	Grader output
1	Correct	16 ms	15992 KB	Output is correct
2	Correct	16 ms	15992 KB	Output is correct
3	Correct	16 ms	15992 KB	Output is correct
4	Correct	16 ms	15992 KB	Output is correct
5	Correct	16 ms	15992 KB	Output is correct
6	Correct	20 ms	15992 KB	Output is correct
7	Correct	16 ms	15992 KB	Output is correct
8	Correct	16 ms	15992 KB	Output is correct
9	Correct	16 ms	15992 KB	Output is correct
10	Correct	16 ms	15992 KB	Output is correct
11	Correct	16 ms	15992 KB	Output is correct
12	Correct	16 ms	15992 KB	Output is correct
13	Correct	16 ms	15964 KB	Output is correct
14	Correct	24 ms	15992 KB	Output is correct
15	Correct	16 ms	15992 KB	Output is correct
16	Correct	16 ms	15992 KB	Output is correct
17	Correct	16 ms	15992 KB	Output is correct
18	Correct	16 ms	15992 KB	Output is correct
19	Correct	16 ms	15992 KB	Output is correct
20	Correct	19 ms	15996 KB	Output is correct
21	Correct	16 ms	15992 KB	Output is correct
22	Correct	16 ms	15992 KB	Output is correct
23	Correct	16 ms	15992 KB	Output is correct
24	Correct	16 ms	15992 KB	Output is correct
25	Correct	16 ms	15992 KB	Output is correct
26	Correct	19 ms	15988 KB	Output is correct
27	Correct	16 ms	15992 KB	Output is correct
28	Correct	16 ms	15992 KB	Output is correct
29	Correct	16 ms	15992 KB	Output is correct
30	Correct	16 ms	15992 KB	Output is correct
31	Correct	16 ms	15992 KB	Output is correct
32	Correct	16 ms	15992 KB	Output is correct
33	Correct	80 ms	28676 KB	Output is correct
34	Correct	43 ms	28664 KB	Output is correct
35	Correct	46 ms	28664 KB	Output is correct
36	Correct	76 ms	28664 KB	Output is correct
37	Correct	75 ms	28664 KB	Output is correct
38	Correct	78 ms	28664 KB	Output is correct
39	Correct	71 ms	28608 KB	Output is correct
40	Correct	55 ms	28580 KB	Output is correct
41	Correct	76 ms	28540 KB	Output is correct
42	Correct	52 ms	28536 KB	Output is correct

Subtask #6
0 / 30.0

#	결과	실행 시간	메모리	Grader output
1	Correct	16 ms	15992 KB	Output is correct
2	Correct	16 ms	15992 KB	Output is correct
3	Correct	16 ms	15992 KB	Output is correct
4	Correct	16 ms	15992 KB	Output is correct
5	Correct	16 ms	15992 KB	Output is correct
6	Correct	20 ms	15992 KB	Output is correct
7	Correct	16 ms	15992 KB	Output is correct
8	Correct	16 ms	15992 KB	Output is correct
9	Correct	16 ms	15992 KB	Output is correct
10	Correct	16 ms	15992 KB	Output is correct
11	Correct	16 ms	15992 KB	Output is correct
12	Correct	16 ms	15992 KB	Output is correct
13	Correct	16 ms	15964 KB	Output is correct
14	Correct	24 ms	15992 KB	Output is correct
15	Correct	16 ms	15992 KB	Output is correct
16	Correct	16 ms	15992 KB	Output is correct
17	Correct	16 ms	15992 KB	Output is correct
18	Correct	16 ms	15992 KB	Output is correct
19	Correct	16 ms	15992 KB	Output is correct
20	Correct	19 ms	15996 KB	Output is correct
21	Correct	16 ms	15992 KB	Output is correct
22	Correct	16 ms	15992 KB	Output is correct
23	Correct	16 ms	15992 KB	Output is correct
24	Correct	16 ms	15992 KB	Output is correct
25	Correct	16 ms	15992 KB	Output is correct
26	Correct	19 ms	15988 KB	Output is correct
27	Correct	16 ms	15992 KB	Output is correct
28	Correct	16 ms	15992 KB	Output is correct
29	Correct	16 ms	15992 KB	Output is correct
30	Correct	16 ms	15992 KB	Output is correct
31	Correct	16 ms	15992 KB	Output is correct
32	Correct	16 ms	15992 KB	Output is correct
33	Correct	80 ms	28676 KB	Output is correct
34	Correct	43 ms	28664 KB	Output is correct
35	Correct	46 ms	28664 KB	Output is correct
36	Correct	76 ms	28664 KB	Output is correct
37	Correct	75 ms	28664 KB	Output is correct
38	Correct	78 ms	28664 KB	Output is correct
39	Correct	71 ms	28608 KB	Output is correct
40	Correct	55 ms	28580 KB	Output is correct
41	Correct	76 ms	28540 KB	Output is correct
42	Correct	52 ms	28536 KB	Output is correct
43	Runtime error	521 ms	207940 KB	Execution killed with signal 11 (could be triggered by violating memory limits)
44	Halted	0 ms	0 KB	-

답안 #136981

Compilation message

Subtask #1 10.0 / 10.0

Subtask #2 10.0 / 10.0

Subtask #3 15.0 / 15.0

Subtask #4 15.0 / 15.0

Subtask #5 20.0 / 20.0

Subtask #6 0 / 30.0

Subtask #1
10.0 / 10.0

Subtask #2
10.0 / 10.0

Subtask #3
15.0 / 15.0

Subtask #4
15.0 / 15.0

Subtask #5
20.0 / 20.0

Subtask #6
0 / 30.0