oj.uz

Submission #290813

# Submission time Handle Problem Language Result Execution time Memory
290813 2020-09-04T13:16:43 Z amoo_safar Wiring (IOI17_wiring) C++17
100 / 100
 456 ms 16744 KB 
#include "wiring.h"

#include <bits/stdc++.h>

#define F first
#define S second
#define pb push_back
#define all(x) x.begin(), x.end()

using namespace std;

typedef long long ll;
typedef pair<int, int> pii;

const int N = 2e5 + 10;
const ll Inf = 1e18;

ll sm[N], ps[N];
vector<pii> V;
ll dp[N];


ll seg[N << 2];
ll lz[N << 2];

void Apply(int id, ll x){
	seg[id] += x;
	lz[id] += x;
}
void Shift(int id){
	Apply(id << 1, lz[id]);
	Apply(id << 1 | 1, lz[id]);
	lz[id] = 0;
}
void Add(int id, ll x, int l, int r, int L, int R){
	
	if(r <= L || R <= l) return ;
	if(l <= L && R <= r){
		Apply(id, x);
		return ;
	}
	Shift(id);
	int mid = (L + R) >> 1;
	Add(id << 1, x, l, r, L, mid);
	Add(id << 1 | 1, x, l, r, mid, R);
	seg[id] = min(seg[id << 1], seg[id << 1 | 1]);
}
ll Get(int id, int l, int r, int L, int R){
	if(r <= L || R <= l) return Inf;
	if(l <= L && R <= r) return seg[id];
	Shift(id);
	int mid = (L + R) >> 1;
	return min(Get(id << 1, l, r, L, mid), Get(id << 1 | 1, l, r, mid, R));
}


ll min_total_length(vector<int> r, vector<int> b) {
	for(int i = 0; i < (int) r.size(); i++)
		V.pb({r[i], 0});
	for(int i = 0; i < (int) b.size(); i++)
		V.pb({b[i], 1});
	
	V.pb({-1, -1});
	sort(all(V));

	int n = ((int) V.size()) - 1;
	
	sm[1] = 1;
	for(int i = 2; i <= n; i++)
		sm[i] = (V[i].S == V[i - 1].S ? sm[i - 1] : i);

	ps[1] = 0;
	for(int i = 2; i <= n + 1; i++) ps[i] = ps[i - 1] + V[i - 1].F;

	int la, la2;
	dp[0] = 0;
	/*
	for(int i = 1; i <= n; i++){
		dp[i] = Inf;
		if(sm[i] == 1)
			continue;
		la = sm[i];
		la2 = sm[la - 1];
		ll sum = ps[i + 1] - ps[la];
		ll dif;
		for(int j = la2; j < la; j++){
			dif = (i - la + 1) - (la - j);
			dp[i] = min(dp[i], min(dp[j], dp[j - 1]) + sum - (ps[la] - ps[j]) + ( dif < 0 ? abs(dif) * V[la].F : abs(dif) * (-V[la - 1].F) ));
		}
	}
	*/
	for(int i = 1; i <= n; i++){
		dp[i] = Inf;
		if(sm[i] == 1){
			Add(1, min(dp[i], dp[i - 1]) + ps[i], i, i + 1, 0, N);
			continue;
		}
		if(V[i].S != V[i - 1].S){
			for(int j = sm[i - 1]; j < i; j++){
				//if(j == 1) cerr << "^^^ " << 1ll * (i - j) * (-V[i].F) << ' ' << Get(1, 1, 2, 0, N) << '\n';
				Add(1, 1ll * (i - j) * (V[i].F), j, j + 1, 0, N);
			}
			if(sm[i - 1] != 1){
				ll pos = sm[i - 1] - 1;
				Add(1, Inf, sm[pos], pos + 1, 0, N);
			}
		}
		ll pos = sm[i] + sm[i] - i;

		la = sm[i];
		la2 = sm[la - 1];
		
		if(la2 < pos)
			Add(1, -V[la].F, la2, pos, 0, N);
		Add(1, -V[la - 1].F, pos, sm[i], 0, N);


		ll sum = ps[i + 1] - ps[la];
		//ll dif;
		


		//for(int j = la2; j < la; j++){
		//	dif = (i - la + 1) - (la - j);
		dp[i] = sum - ps[la] + Get(1, la2, la, 0, N);
			//dp[i] = min(dp[i], min(dp[j], dp[j - 1]) + sum - (ps[la] - ps[j]) + ( dif < 0 ? abs(dif) * V[la].F : abs(dif) * (-V[la - 1].F) ));
		//}
		Add(1, min(dp[i], dp[i - 1]) + ps[i], i, i + 1, 0, N);
		//if(i == 3) break;
	}
	//cerr << "! ";
	//for(int i = 0; i <= n; i++) cerr << dp[i] << ' ';
	//cerr << '\n';
	return dp[n];
}

Subtask #1
7.0 / 7.0

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

Subtask #2
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 1 ms 512 KB Output is correct
3 Correct 213 ms 12620 KB Output is correct
4 Correct 221 ms 12512 KB Output is correct
5 Correct 233 ms 12628 KB Output is correct
6 Correct 313 ms 16484 KB Output is correct
7 Correct 315 ms 16500 KB Output is correct
8 Correct 313 ms 16512 KB Output is correct
9 Correct 319 ms 16552 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 0 ms 384 KB Output is correct
3 Correct 385 ms 16488 KB Output is correct
4 Correct 392 ms 16556 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 1 ms 384 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 384 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 1 ms 384 KB Output is correct
14 Correct 1 ms 384 KB Output is correct
15 Correct 1 ms 512 KB Output is correct
16 Correct 1 ms 512 KB Output is correct
17 Correct 1 ms 512 KB Output is correct
18 Correct 379 ms 16472 KB Output is correct
19 Correct 367 ms 16580 KB Output is correct
20 Correct 397 ms 16488 KB Output is correct
21 Correct 372 ms 16536 KB Output is correct
22 Correct 373 ms 16488 KB Output is correct
23 Correct 369 ms 16744 KB Output is correct
24 Correct 382 ms 16552 KB Output is correct

Subtask #4
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 403 ms 16592 KB Output is correct
3 Correct 361 ms 16616 KB Output is correct
4 Correct 393 ms 16616 KB Output is correct
5 Correct 360 ms 16628 KB Output is correct
6 Correct 1 ms 384 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 384 KB Output is correct
10 Correct 1 ms 416 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 416 KB Output is correct
15 Correct 1 ms 512 KB Output is correct
16 Correct 1 ms 512 KB Output is correct
17 Correct 1 ms 512 KB Output is correct
18 Correct 430 ms 16488 KB Output is correct
19 Correct 415 ms 16488 KB Output is correct
20 Correct 415 ms 16524 KB Output is correct
21 Correct 443 ms 16488 KB Output is correct
22 Correct 371 ms 16616 KB Output is correct
23 Correct 326 ms 16488 KB Output is correct
24 Correct 372 ms 16616 KB Output is correct

Subtask #5
45.0 / 45.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Output is correct
2 Correct 1 ms 384 KB Output is correct
3 Correct 1 ms 384 KB Output is correct
4 Correct 1 ms 384 KB Output is correct
5 Correct 1 ms 384 KB Output is correct
6 Correct 1 ms 384 KB Output is correct
7 Correct 2 ms 512 KB Output is correct
8 Correct 1 ms 512 KB Output is correct
9 Correct 1 ms 512 KB Output is correct
10 Correct 1 ms 512 KB Output is correct
11 Correct 1 ms 512 KB Output is correct
12 Correct 1 ms 512 KB Output is correct
13 Correct 2 ms 512 KB Output is correct
14 Correct 1 ms 512 KB Output is correct
15 Correct 1 ms 512 KB Output is correct
16 Correct 1 ms 512 KB Output is correct
17 Correct 1 ms 384 KB Output is correct
18 Correct 1 ms 512 KB Output is correct
19 Correct 213 ms 12620 KB Output is correct
20 Correct 221 ms 12512 KB Output is correct
21 Correct 233 ms 12628 KB Output is correct
22 Correct 313 ms 16484 KB Output is correct
23 Correct 315 ms 16500 KB Output is correct
24 Correct 313 ms 16512 KB Output is correct
25 Correct 319 ms 16552 KB Output is correct
26 Correct 1 ms 384 KB Output is correct
27 Correct 0 ms 384 KB Output is correct
28 Correct 385 ms 16488 KB Output is correct
29 Correct 392 ms 16556 KB Output is correct
30 Correct 1 ms 384 KB Output is correct
31 Correct 1 ms 384 KB Output is correct
32 Correct 1 ms 384 KB Output is correct
33 Correct 1 ms 384 KB Output is correct
34 Correct 1 ms 384 KB Output is correct
35 Correct 1 ms 384 KB Output is correct
36 Correct 1 ms 384 KB Output is correct
37 Correct 1 ms 384 KB Output is correct
38 Correct 1 ms 384 KB Output is correct
39 Correct 1 ms 384 KB Output is correct
40 Correct 1 ms 512 KB Output is correct
41 Correct 1 ms 512 KB Output is correct
42 Correct 1 ms 512 KB Output is correct
43 Correct 379 ms 16472 KB Output is correct
44 Correct 367 ms 16580 KB Output is correct
45 Correct 397 ms 16488 KB Output is correct
46 Correct 372 ms 16536 KB Output is correct
47 Correct 373 ms 16488 KB Output is correct
48 Correct 369 ms 16744 KB Output is correct
49 Correct 382 ms 16552 KB Output is correct
50 Correct 1 ms 384 KB Output is correct
51 Correct 403 ms 16592 KB Output is correct
52 Correct 361 ms 16616 KB Output is correct
53 Correct 393 ms 16616 KB Output is correct
54 Correct 360 ms 16628 KB Output is correct
55 Correct 1 ms 384 KB Output is correct
56 Correct 1 ms 384 KB Output is correct
57 Correct 1 ms 384 KB Output is correct
58 Correct 1 ms 384 KB Output is correct
59 Correct 1 ms 416 KB Output is correct
60 Correct 1 ms 384 KB Output is correct
61 Correct 1 ms 384 KB Output is correct
62 Correct 0 ms 384 KB Output is correct
63 Correct 1 ms 416 KB Output is correct
64 Correct 1 ms 512 KB Output is correct
65 Correct 1 ms 512 KB Output is correct
66 Correct 1 ms 512 KB Output is correct
67 Correct 430 ms 16488 KB Output is correct
68 Correct 415 ms 16488 KB Output is correct
69 Correct 415 ms 16524 KB Output is correct
70 Correct 443 ms 16488 KB Output is correct
71 Correct 371 ms 16616 KB Output is correct
72 Correct 326 ms 16488 KB Output is correct
73 Correct 372 ms 16616 KB Output is correct
74 Correct 354 ms 16456 KB Output is correct
75 Correct 369 ms 16444 KB Output is correct
76 Correct 366 ms 16588 KB Output is correct
77 Correct 444 ms 16616 KB Output is correct
78 Correct 369 ms 16580 KB Output is correct
79 Correct 395 ms 16448 KB Output is correct
80 Correct 376 ms 16492 KB Output is correct
81 Correct 294 ms 16488 KB Output is correct
82 Correct 305 ms 16644 KB Output is correct
83 Correct 323 ms 16672 KB Output is correct
84 Correct 304 ms 16488 KB Output is correct
85 Correct 378 ms 16488 KB Output is correct
86 Correct 368 ms 16488 KB Output is correct
87 Correct 384 ms 16492 KB Output is correct
88 Correct 374 ms 16448 KB Output is correct
89 Correct 391 ms 16644 KB Output is correct
90 Correct 456 ms 16464 KB Output is correct
91 Correct 346 ms 16488 KB Output is correct
92 Correct 409 ms 16616 KB Output is correct
93 Correct 384 ms 16488 KB Output is correct
94 Correct 399 ms 16520 KB Output is correct
95 Correct 431 ms 16528 KB Output is correct
96 Correct 344 ms 16488 KB Output is correct
97 Correct 358 ms 16488 KB Output is correct
98 Correct 368 ms 16616 KB Output is correct
99 Correct 369 ms 16556 KB Output is correct
100 Correct 444 ms 16616 KB Output is correct
101 Correct 363 ms 16456 KB Output is correct
102 Correct 360 ms 16744 KB Output is correct