oj.uz

Submission #110031

# Submission time Handle Problem Language Result Execution time Memory
110031 2019-05-09T00:33:01 Z CaroLinda Boxes with souvenirs (IOI15_boxes) C++14
100 / 100
 1795 ms 333184 KB 
#include <bits/stdc++.h>
 
#define lp(i,a,b) for(int i = a ; i < b ; i++)
#define ll long long
#define ff first
#define ss second
 
const int MAXN = 1e7 + 5;
const ll inf = 1e9 + 10 ;
 
using namespace std ;
 
//Declaracoes
int N , K ;
ll L ;
int pos[MAXN] ;
ll dp1[MAXN] , dp2[MAXN] ;
 
//Funcao principal
ll delivery(int n , int k , int l , int positions[] )
{
	//Globalizacao
	N = n ; K = k ; L= l * 1LL ;
	lp(i,0,n) pos[i] = positions[i] ;
	
	lp(i,0,n)
		if( pos[i] == 0 ) pos[i] = inf , N-- ;
		
	sort( pos , pos + n ) ;
	n = N ;
	
	lp(i,0,n)
	{
		dp1[i] = pos[i] * 2 ;
		if( i - k >= 0 ) dp1[i] += dp1[i-k] ; 
	}
	
	for( int i = n-1 ; i >= 0 ; i-- )
	{
		dp2[i] = ( L - pos[i]) * 2 ;
		if( i + k < n ) dp2[i] += dp2[i+k] ;
	}
	
	ll best =  inf * MAXN ;
	
	lp(i,0,n-2)
		best = min( best , dp1[i] + dp2[i+1] ) ;
	
	best = min( best , dp1[n-1] ) ;
	best = min( best , dp2[0] ) ;
	
	lp(i,0,n)
	{
		ll x = 0;
		if( i + k < n ) x = dp2[i+k] ;
		ll y = 0 ;
		if( i-1 >= 0 ) y = dp1[i-1] ;
		best = min( best , y + x + L ) ;
	} 
	
	return best ;
}

Subtask #1
10.0 / 10.0

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

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 384 KB Output is correct
2 Correct 2 ms 384 KB Output is correct
3 Correct 3 ms 384 KB Output is correct
4 Correct 2 ms 256 KB Output is correct
5 Correct 2 ms 252 KB Output is correct
6 Correct 2 ms 384 KB Output is correct
7 Correct 2 ms 384 KB Output is correct

Subtask #3
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 300 KB Output is correct
2 Correct 2 ms 384 KB Output is correct
3 Correct 2 ms 384 KB Output is correct
4 Correct 2 ms 384 KB Output is correct
5 Correct 2 ms 384 KB Output is correct
6 Correct 2 ms 384 KB Output is correct
7 Correct 3 ms 384 KB Output is correct
8 Correct 2 ms 384 KB Output is correct

Subtask #4
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 384 KB Output is correct
2 Correct 2 ms 384 KB Output is correct
3 Correct 2 ms 356 KB Output is correct
4 Correct 2 ms 384 KB Output is correct
5 Correct 2 ms 384 KB Output is correct
6 Correct 3 ms 384 KB Output is correct
7 Correct 3 ms 384 KB Output is correct
8 Correct 2 ms 384 KB Output is correct
9 Correct 2 ms 384 KB Output is correct
10 Correct 3 ms 384 KB Output is correct
11 Correct 2 ms 256 KB Output is correct
12 Correct 2 ms 252 KB Output is correct
13 Correct 2 ms 384 KB Output is correct
14 Correct 2 ms 384 KB Output is correct
15 Correct 2 ms 300 KB Output is correct
16 Correct 2 ms 384 KB Output is correct
17 Correct 2 ms 384 KB Output is correct
18 Correct 2 ms 384 KB Output is correct
19 Correct 2 ms 384 KB Output is correct
20 Correct 2 ms 384 KB Output is correct
21 Correct 3 ms 384 KB Output is correct
22 Correct 2 ms 384 KB Output is correct
23 Correct 2 ms 384 KB Output is correct
24 Correct 3 ms 384 KB Output is correct
25 Correct 2 ms 384 KB Output is correct
26 Correct 2 ms 384 KB Output is correct
27 Correct 4 ms 412 KB Output is correct
28 Correct 2 ms 384 KB Output is correct
29 Correct 3 ms 384 KB Output is correct
30 Correct 3 ms 384 KB Output is correct
31 Correct 3 ms 384 KB Output is correct
32 Correct 2 ms 384 KB Output is correct

Subtask #5
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 384 KB Output is correct
2 Correct 2 ms 384 KB Output is correct
3 Correct 2 ms 356 KB Output is correct
4 Correct 2 ms 384 KB Output is correct
5 Correct 2 ms 384 KB Output is correct
6 Correct 3 ms 384 KB Output is correct
7 Correct 3 ms 384 KB Output is correct
8 Correct 2 ms 384 KB Output is correct
9 Correct 2 ms 384 KB Output is correct
10 Correct 3 ms 384 KB Output is correct
11 Correct 2 ms 256 KB Output is correct
12 Correct 2 ms 252 KB Output is correct
13 Correct 2 ms 384 KB Output is correct
14 Correct 2 ms 384 KB Output is correct
15 Correct 2 ms 300 KB Output is correct
16 Correct 2 ms 384 KB Output is correct
17 Correct 2 ms 384 KB Output is correct
18 Correct 2 ms 384 KB Output is correct
19 Correct 2 ms 384 KB Output is correct
20 Correct 2 ms 384 KB Output is correct
21 Correct 3 ms 384 KB Output is correct
22 Correct 2 ms 384 KB Output is correct
23 Correct 2 ms 384 KB Output is correct
24 Correct 3 ms 384 KB Output is correct
25 Correct 2 ms 384 KB Output is correct
26 Correct 2 ms 384 KB Output is correct
27 Correct 4 ms 412 KB Output is correct
28 Correct 2 ms 384 KB Output is correct
29 Correct 3 ms 384 KB Output is correct
30 Correct 3 ms 384 KB Output is correct
31 Correct 3 ms 384 KB Output is correct
32 Correct 2 ms 384 KB Output is correct
33 Correct 81 ms 33576 KB Output is correct
34 Correct 51 ms 22656 KB Output is correct
35 Correct 55 ms 25592 KB Output is correct
36 Correct 81 ms 33656 KB Output is correct
37 Correct 80 ms 33608 KB Output is correct
38 Correct 71 ms 33656 KB Output is correct
39 Correct 145 ms 32120 KB Output is correct
40 Correct 126 ms 27524 KB Output is correct
41 Correct 76 ms 33628 KB Output is correct
42 Correct 52 ms 27780 KB Output is correct

Subtask #6
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 384 KB Output is correct
2 Correct 2 ms 384 KB Output is correct
3 Correct 2 ms 356 KB Output is correct
4 Correct 2 ms 384 KB Output is correct
5 Correct 2 ms 384 KB Output is correct
6 Correct 3 ms 384 KB Output is correct
7 Correct 3 ms 384 KB Output is correct
8 Correct 2 ms 384 KB Output is correct
9 Correct 2 ms 384 KB Output is correct
10 Correct 3 ms 384 KB Output is correct
11 Correct 2 ms 256 KB Output is correct
12 Correct 2 ms 252 KB Output is correct
13 Correct 2 ms 384 KB Output is correct
14 Correct 2 ms 384 KB Output is correct
15 Correct 2 ms 300 KB Output is correct
16 Correct 2 ms 384 KB Output is correct
17 Correct 2 ms 384 KB Output is correct
18 Correct 2 ms 384 KB Output is correct
19 Correct 2 ms 384 KB Output is correct
20 Correct 2 ms 384 KB Output is correct
21 Correct 3 ms 384 KB Output is correct
22 Correct 2 ms 384 KB Output is correct
23 Correct 2 ms 384 KB Output is correct
24 Correct 3 ms 384 KB Output is correct
25 Correct 2 ms 384 KB Output is correct
26 Correct 2 ms 384 KB Output is correct
27 Correct 4 ms 412 KB Output is correct
28 Correct 2 ms 384 KB Output is correct
29 Correct 3 ms 384 KB Output is correct
30 Correct 3 ms 384 KB Output is correct
31 Correct 3 ms 384 KB Output is correct
32 Correct 2 ms 384 KB Output is correct
33 Correct 81 ms 33576 KB Output is correct
34 Correct 51 ms 22656 KB Output is correct
35 Correct 55 ms 25592 KB Output is correct
36 Correct 81 ms 33656 KB Output is correct
37 Correct 80 ms 33608 KB Output is correct
38 Correct 71 ms 33656 KB Output is correct
39 Correct 145 ms 32120 KB Output is correct
40 Correct 126 ms 27524 KB Output is correct
41 Correct 76 ms 33628 KB Output is correct
42 Correct 52 ms 27780 KB Output is correct
43 Correct 989 ms 332048 KB Output is correct
44 Correct 499 ms 223388 KB Output is correct
45 Correct 813 ms 259540 KB Output is correct
46 Correct 965 ms 333184 KB Output is correct
47 Correct 931 ms 332992 KB Output is correct
48 Correct 984 ms 333116 KB Output is correct
49 Correct 1795 ms 317824 KB Output is correct
50 Correct 1705 ms 271316 KB Output is correct
51 Correct 1004 ms 333180 KB Output is correct
52 Correct 701 ms 274280 KB Output is correct