oj.uz

Submission #307633

# Submission time Handle Problem Language Result Execution time Memory
307633 2020-09-28T21:08:05 Z CaroLinda Wiring (IOI17_wiring) C++14
100 / 100
 64 ms 15736 KB 
#include "wiring.h"
#include <bits/stdc++.h>
 
#define debug printf
#define lp(i,a,b) for(int i = a ; i < b; i++)
#define pb push_back
#define ff first
#define ss second
#define mk make_pair
#define pii pair<int,int>
#define ll long long 
#define all(x) x.begin(),x.end()
#define sz(x) (int)(x.size())
 
const ll inf = 1e15+10 ;
 
using namespace std ;
 
long long min_total_length(vector<int> r, vector<int> b) 
{
	int n = sz(r) ;
	int m = sz(b) ;
 
	vector< pair<long long,int> > loc(n+m) ;
	for(int i = 0 ; i < n ; i++ ) loc[i] = make_pair( r[i] , 0 ) ;
	for(int i = n ; i < n+m ; i++ ) loc[i] = make_pair(b[i-n] , 1 ) ;
	sort(all(loc)) ;
	
	vector<int> ini(n+m,-1) , fim(n+m,-1) , bestIndex(n+m,-1) ; 
	vector< long long > dp(n+m+1, inf ) , minPrefix(n+m, inf) , s(n+m,0) ;
	vector<long long> meuValor(n+m) ;
 
	for(int i = 0 ; i < sz(loc) ; i++ )
	{
		if(ini[i] == -1) ini[i] = i ;
 
		if( i < sz(loc)-1 && loc[i+1].ss == loc[i].ss ) ini[i+1] = ini[i] ; 
		else for(int j = ini[i] ; j <= i ; j++ ) fim[j] = i ;
 
		s[i] = loc[i].ff ;
		if(i) s[i] += s[i-1] ;
 
	}
 
	dp[n+m] = 0LL ;
 
	for(int i = n+m-1 ; i >= 0 ; i-- )
	{
		if( fim[i] == n+m-1 )
		{
			minPrefix[i] = s[i] - s[ ini[i] ] - (ll)( i - ini[i] ) * loc[ ini[i] ].ff + dp[i+1];
			dp[i] = min( dp[i] , dp[i+1] + loc[i].ff - loc[ini[i]-1].ff) ;

			if( i == ini[i] )
				for(int j = i+1 ; j <= fim[i] ; j++ ) minPrefix[j] = min(minPrefix[j] , minPrefix[j-1]) ;

			continue ;
		}
 
		int last = min(fim[i]+1 + fim[i] - i , fim[ fim[i]+1 ] ) ;

		dp[i] = loc[ fim[i] + 1 ].ff * (fim[i] - i + 1) - ( s[ fim[i] ] - ( (i == 0) ? 0 : s[i-1] ) ) + minPrefix[last] ;
		
 		if( ini[i] ) dp[i] = min(dp[i] , loc[i].ff - loc[ ini[i]-1 ].ff + dp[i+1] ) ;

		if(!ini[i] || i != ini[i]) continue ;

		minPrefix[i] = dp[i+1] ;
 
		for(int j = i+1 ; j <= fim[i] ; j++ )
			minPrefix[j] = min(minPrefix[j-1], s[j] - s[i] - (ll)(j-i) * loc[i].ff + dp[j+1] );

 
	}

	return dp[0] ;
}

Subtask #1
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 256 KB Output is correct
2 Correct 0 ms 256 KB Output is correct
3 Correct 1 ms 256 KB Output is correct
4 Correct 0 ms 256 KB Output is correct
5 Correct 1 ms 256 KB Output is correct
6 Correct 0 ms 256 KB Output is correct
7 Correct 1 ms 384 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 1 ms 512 KB Output is correct
10 Correct 1 ms 384 KB Output is correct
11 Correct 1 ms 384 KB Output is correct
12 Correct 1 ms 384 KB Output is correct
13 Correct 0 ms 384 KB Output is correct
14 Correct 1 ms 384 KB Output is correct
15 Correct 1 ms 384 KB Output is correct
16 Correct 1 ms 384 KB Output is correct

Subtask #2
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 256 KB Output is correct
2 Correct 0 ms 384 KB Output is correct
3 Correct 33 ms 10360 KB Output is correct
4 Correct 33 ms 10360 KB Output is correct
5 Correct 36 ms 10360 KB Output is correct
6 Correct 44 ms 13688 KB Output is correct
7 Correct 43 ms 13688 KB Output is correct
8 Correct 44 ms 13688 KB Output is correct
9 Correct 43 ms 13688 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 256 KB Output is correct
2 Correct 0 ms 256 KB Output is correct
3 Correct 61 ms 13816 KB Output is correct
4 Correct 57 ms 15224 KB Output is correct
5 Correct 0 ms 256 KB Output is correct
6 Correct 1 ms 256 KB Output is correct
7 Correct 0 ms 256 KB Output is correct
8 Correct 1 ms 256 KB Output is correct
9 Correct 0 ms 256 KB Output is correct
10 Correct 1 ms 256 KB Output is correct
11 Correct 1 ms 256 KB Output is correct
12 Correct 0 ms 256 KB Output is correct
13 Correct 0 ms 256 KB Output is correct
14 Correct 0 ms 256 KB Output is correct
15 Correct 1 ms 384 KB Output is correct
16 Correct 1 ms 384 KB Output is correct
17 Correct 1 ms 256 KB Output is correct
18 Correct 59 ms 15608 KB Output is correct
19 Correct 58 ms 15608 KB Output is correct
20 Correct 62 ms 15608 KB Output is correct
21 Correct 58 ms 15480 KB Output is correct
22 Correct 60 ms 15640 KB Output is correct
23 Correct 64 ms 15608 KB Output is correct
24 Correct 61 ms 15612 KB Output is correct

Subtask #4
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 256 KB Output is correct
2 Correct 47 ms 13688 KB Output is correct
3 Correct 52 ms 14968 KB Output is correct
4 Correct 52 ms 14968 KB Output is correct
5 Correct 51 ms 14968 KB Output is correct
6 Correct 0 ms 256 KB Output is correct
7 Correct 1 ms 256 KB Output is correct
8 Correct 0 ms 256 KB Output is correct
9 Correct 1 ms 256 KB Output is correct
10 Correct 1 ms 384 KB Output is correct
11 Correct 0 ms 256 KB Output is correct
12 Correct 1 ms 256 KB Output is correct
13 Correct 0 ms 256 KB Output is correct
14 Correct 0 ms 256 KB Output is correct
15 Correct 1 ms 384 KB Output is correct
16 Correct 0 ms 384 KB Output is correct
17 Correct 0 ms 256 KB Output is correct
18 Correct 48 ms 14968 KB Output is correct
19 Correct 50 ms 14972 KB Output is correct
20 Correct 49 ms 14968 KB Output is correct
21 Correct 45 ms 14968 KB Output is correct
22 Correct 49 ms 14968 KB Output is correct
23 Correct 41 ms 14968 KB Output is correct
24 Correct 42 ms 14968 KB Output is correct

Subtask #5
45.0 / 45.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 256 KB Output is correct
2 Correct 0 ms 256 KB Output is correct
3 Correct 1 ms 256 KB Output is correct
4 Correct 0 ms 256 KB Output is correct
5 Correct 1 ms 256 KB Output is correct
6 Correct 0 ms 256 KB Output is correct
7 Correct 1 ms 384 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 1 ms 512 KB Output is correct
10 Correct 1 ms 384 KB Output is correct
11 Correct 1 ms 384 KB Output is correct
12 Correct 1 ms 384 KB Output is correct
13 Correct 0 ms 384 KB Output is correct
14 Correct 1 ms 384 KB Output is correct
15 Correct 1 ms 384 KB Output is correct
16 Correct 1 ms 384 KB Output is correct
17 Correct 1 ms 256 KB Output is correct
18 Correct 0 ms 384 KB Output is correct
19 Correct 33 ms 10360 KB Output is correct
20 Correct 33 ms 10360 KB Output is correct
21 Correct 36 ms 10360 KB Output is correct
22 Correct 44 ms 13688 KB Output is correct
23 Correct 43 ms 13688 KB Output is correct
24 Correct 44 ms 13688 KB Output is correct
25 Correct 43 ms 13688 KB Output is correct
26 Correct 0 ms 256 KB Output is correct
27 Correct 0 ms 256 KB Output is correct
28 Correct 61 ms 13816 KB Output is correct
29 Correct 57 ms 15224 KB Output is correct
30 Correct 0 ms 256 KB Output is correct
31 Correct 1 ms 256 KB Output is correct
32 Correct 0 ms 256 KB Output is correct
33 Correct 1 ms 256 KB Output is correct
34 Correct 0 ms 256 KB Output is correct
35 Correct 1 ms 256 KB Output is correct
36 Correct 1 ms 256 KB Output is correct
37 Correct 0 ms 256 KB Output is correct
38 Correct 0 ms 256 KB Output is correct
39 Correct 0 ms 256 KB Output is correct
40 Correct 1 ms 384 KB Output is correct
41 Correct 1 ms 384 KB Output is correct
42 Correct 1 ms 256 KB Output is correct
43 Correct 59 ms 15608 KB Output is correct
44 Correct 58 ms 15608 KB Output is correct
45 Correct 62 ms 15608 KB Output is correct
46 Correct 58 ms 15480 KB Output is correct
47 Correct 60 ms 15640 KB Output is correct
48 Correct 64 ms 15608 KB Output is correct
49 Correct 61 ms 15612 KB Output is correct
50 Correct 0 ms 256 KB Output is correct
51 Correct 47 ms 13688 KB Output is correct
52 Correct 52 ms 14968 KB Output is correct
53 Correct 52 ms 14968 KB Output is correct
54 Correct 51 ms 14968 KB Output is correct
55 Correct 0 ms 256 KB Output is correct
56 Correct 1 ms 256 KB Output is correct
57 Correct 0 ms 256 KB Output is correct
58 Correct 1 ms 256 KB Output is correct
59 Correct 1 ms 384 KB Output is correct
60 Correct 0 ms 256 KB Output is correct
61 Correct 1 ms 256 KB Output is correct
62 Correct 0 ms 256 KB Output is correct
63 Correct 0 ms 256 KB Output is correct
64 Correct 1 ms 384 KB Output is correct
65 Correct 0 ms 384 KB Output is correct
66 Correct 0 ms 256 KB Output is correct
67 Correct 48 ms 14968 KB Output is correct
68 Correct 50 ms 14972 KB Output is correct
69 Correct 49 ms 14968 KB Output is correct
70 Correct 45 ms 14968 KB Output is correct
71 Correct 49 ms 14968 KB Output is correct
72 Correct 41 ms 14968 KB Output is correct
73 Correct 42 ms 14968 KB Output is correct
74 Correct 46 ms 15612 KB Output is correct
75 Correct 53 ms 15224 KB Output is correct
76 Correct 56 ms 15640 KB Output is correct
77 Correct 49 ms 15096 KB Output is correct
78 Correct 47 ms 14976 KB Output is correct
79 Correct 49 ms 14968 KB Output is correct
80 Correct 43 ms 14968 KB Output is correct
81 Correct 47 ms 15096 KB Output is correct
82 Correct 41 ms 15064 KB Output is correct
83 Correct 41 ms 15224 KB Output is correct
84 Correct 45 ms 15608 KB Output is correct
85 Correct 56 ms 15608 KB Output is correct
86 Correct 48 ms 15612 KB Output is correct
87 Correct 50 ms 15736 KB Output is correct
88 Correct 51 ms 15608 KB Output is correct
89 Correct 49 ms 15608 KB Output is correct
90 Correct 58 ms 15608 KB Output is correct
91 Correct 48 ms 15608 KB Output is correct
92 Correct 51 ms 15640 KB Output is correct
93 Correct 52 ms 15736 KB Output is correct
94 Correct 51 ms 15608 KB Output is correct
95 Correct 53 ms 15608 KB Output is correct
96 Correct 47 ms 15608 KB Output is correct
97 Correct 47 ms 15608 KB Output is correct
98 Correct 51 ms 15736 KB Output is correct
99 Correct 51 ms 15608 KB Output is correct
100 Correct 56 ms 15612 KB Output is correct
101 Correct 49 ms 15608 KB Output is correct
102 Correct 56 ms 15608 KB Output is correct