oj.uz

Submission #34681

# Submission time Handle Problem Language Result Execution time Memory
34681 2017-11-15T01:26:17 Z mohammad_kilani Wiring (IOI17_wiring) C++14
100 / 100
 653 ms 21588 KB 
#include "wiring.h"
#include <bits/stdc++.h>
using namespace std;
#define red 1
#define blue 0
const int N = 200010;

long long seg[4 * N] , lazy[4 * N] , dp[N];
vector< pair<int,bool> > v;
int n , nxt[N];

long long getmin(int s,int e,int idx,int l,int r){
	if(s > r || e < l) return 1e18;
	if(s >= l && e <= r) return seg[idx] + lazy[idx];
	lazy[idx*2] += lazy[idx];
	lazy[idx*2+1] += lazy[idx];
	seg[idx] += lazy[idx];
	lazy[idx] = 0;
	return min(getmin(s,(s+e)/2,idx*2,l,r),getmin((s+e)/2+1,e,idx*2+1,l,r));
}

long long update(int s,int e,int idx,int l,int r,long long val){
	if(s > r || e < l) return seg[idx] + lazy[idx];
	if(s >= l && e <= r){
		lazy[idx] += val;
		return seg[idx] + lazy[idx];
	}
	lazy[idx*2] += lazy[idx];
	lazy[idx*2+1] += lazy[idx];
	lazy[idx] =0 ;
	return seg[idx] = min(update(s,(s+e)/2,idx*2,l,r,val),update((s+e)/2+1,e,idx*2+1,l,r,val));
}


long long min_total_length(std::vector<int> r, std::vector<int> b) {
	int j =0 ;
	for(int i=0;i<r.size();i++){
		while(j < b.size() && b[j] < r[i]) v.push_back(make_pair(b[j++],blue));
		v.push_back(make_pair(r[i],red));
	}
	while(j < b.size()) v.push_back(make_pair(b[j++],blue));
	n = v.size();
	nxt[n] = n;
	for(int i=n-1;i>=0;i--){
		if(v[i].second != v[i+1].second) nxt[i] = i + 1; else nxt[i] = nxt[i+1];
	}
	for(int i=n-1;i>=0;i--){
		if(nxt[i] == n){
			dp[i] = 1e18;
			update(0,n,1,i,i,dp[i]);
			continue;
		}
		dp[i] = 1e18;
		if(nxt[i] == i + 1){
			long long sum = 0 ;
			for(int j=i+1;j<nxt[i+1];j++){
				update(0,n,1,j,j,-getmin(0,n,1,j,j));
				update(0,n,1,j,j,sum + dp[j]);
				sum += v[j].first - v[i].first;
			}
			for(int j=nxt[i+1];j<=nxt[nxt[i+1]];j++){
				update(0,n,1,j,j,-getmin(0,n,1,j,j));
				update(0,n,1,j,j,dp[j] + sum);
				if(j < nxt[nxt[i+1]]) sum += v[j].first - v[i+1].first;
			}
			dp[i] = min(dp[i],getmin(0,n,1,i+2,nxt[nxt[i+1]]));
			update(0,n-1,1,i,i,dp[i]);
		}
		else{
			int cur = nxt[i] ; 
			int cur2 = nxt[cur] - 1;
			int num = cur - i;
			long long s = 0 ;
			if(cur2 - cur < num){
				if(cur+1 <= cur2) update(0,n,1,cur+1,cur2,v[cur].first - v[i].first);
			}
			else{
				update(0,n,1,cur+1,cur+num-1,v[cur].first-v[i].first);
				if(cur+num <= cur2){
					update(0,n,1,cur+num,cur2,v[cur-1].first - v[i].first);
				}
			}
			cur2++;
			if(cur2 - cur < num) s = v[cur].first - v[i].first;
			else s = v[cur-1].first - v[i].first;
			update(0,n,1,cur2,nxt[cur2],s);
			dp[i] = getmin(0,n,1,cur+1,nxt[cur2]);
			update(0,n,1,i,i,dp[i]);
		}

	}
	return dp[0];

}

Compilation message

wiring.cpp: In function 'long long int min_total_length(std::vector<int>, std::vector<int>)':
wiring.cpp:37:15: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for(int i=0;i<r.size();i++){
               ^
wiring.cpp:38:11: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   while(j < b.size() && b[j] < r[i]) v.push_back(make_pair(b[j++],blue));
           ^
wiring.cpp:41:10: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  while(j < b.size()) v.push_back(make_pair(b[j++],blue));
          ^

Subtask #1
7.0 / 7.0

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

Subtask #2
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 16864 KB Output is correct
2 Correct 0 ms 16864 KB Output is correct
3 Correct 226 ms 21196 KB Output is correct
4 Correct 233 ms 21196 KB Output is correct
5 Correct 233 ms 21196 KB Output is correct
6 Correct 336 ms 21588 KB Output is correct
7 Correct 319 ms 21588 KB Output is correct
8 Correct 289 ms 21588 KB Output is correct
9 Correct 269 ms 21588 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 16864 KB Output is correct
2 Correct 0 ms 16864 KB Output is correct
3 Correct 606 ms 21588 KB Output is correct
4 Correct 593 ms 21588 KB Output is correct
5 Correct 0 ms 16864 KB Output is correct
6 Correct 0 ms 16864 KB Output is correct
7 Correct 0 ms 16864 KB Output is correct
8 Correct 0 ms 16864 KB Output is correct
9 Correct 0 ms 16864 KB Output is correct
10 Correct 0 ms 16864 KB Output is correct
11 Correct 0 ms 16864 KB Output is correct
12 Correct 0 ms 16864 KB Output is correct
13 Correct 0 ms 16864 KB Output is correct
14 Correct 0 ms 16864 KB Output is correct
15 Correct 0 ms 16864 KB Output is correct
16 Correct 0 ms 16864 KB Output is correct
17 Correct 0 ms 16864 KB Output is correct
18 Correct 573 ms 21588 KB Output is correct
19 Correct 576 ms 21588 KB Output is correct
20 Correct 619 ms 21588 KB Output is correct
21 Correct 553 ms 21588 KB Output is correct
22 Correct 589 ms 21588 KB Output is correct
23 Correct 583 ms 21588 KB Output is correct
24 Correct 616 ms 21588 KB Output is correct

Subtask #4
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 16864 KB Output is correct
2 Correct 653 ms 21588 KB Output is correct
3 Correct 559 ms 21588 KB Output is correct
4 Correct 609 ms 21588 KB Output is correct
5 Correct 589 ms 21588 KB Output is correct
6 Correct 0 ms 16864 KB Output is correct
7 Correct 0 ms 16864 KB Output is correct
8 Correct 0 ms 16864 KB Output is correct
9 Correct 0 ms 16864 KB Output is correct
10 Correct 0 ms 16864 KB Output is correct
11 Correct 0 ms 16864 KB Output is correct
12 Correct 0 ms 16864 KB Output is correct
13 Correct 0 ms 16864 KB Output is correct
14 Correct 0 ms 16864 KB Output is correct
15 Correct 0 ms 16864 KB Output is correct
16 Correct 0 ms 16864 KB Output is correct
17 Correct 0 ms 16864 KB Output is correct
18 Correct 533 ms 21588 KB Output is correct
19 Correct 603 ms 21588 KB Output is correct
20 Correct 633 ms 21588 KB Output is correct
21 Correct 613 ms 21588 KB Output is correct
22 Correct 449 ms 21588 KB Output is correct
23 Correct 369 ms 21588 KB Output is correct
24 Correct 426 ms 21588 KB Output is correct

Subtask #5
45.0 / 45.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 16864 KB Output is correct
2 Correct 0 ms 16864 KB Output is correct
3 Correct 0 ms 16864 KB Output is correct
4 Correct 0 ms 16864 KB Output is correct
5 Correct 0 ms 16864 KB Output is correct
6 Correct 0 ms 16864 KB Output is correct
7 Correct 0 ms 16864 KB Output is correct
8 Correct 0 ms 16864 KB Output is correct
9 Correct 0 ms 16864 KB Output is correct
10 Correct 0 ms 16864 KB Output is correct
11 Correct 0 ms 16864 KB Output is correct
12 Correct 0 ms 16864 KB Output is correct
13 Correct 0 ms 16864 KB Output is correct
14 Correct 0 ms 16864 KB Output is correct
15 Correct 0 ms 16864 KB Output is correct
16 Correct 0 ms 16864 KB Output is correct
17 Correct 0 ms 16864 KB Output is correct
18 Correct 0 ms 16864 KB Output is correct
19 Correct 226 ms 21196 KB Output is correct
20 Correct 233 ms 21196 KB Output is correct
21 Correct 233 ms 21196 KB Output is correct
22 Correct 336 ms 21588 KB Output is correct
23 Correct 319 ms 21588 KB Output is correct
24 Correct 289 ms 21588 KB Output is correct
25 Correct 269 ms 21588 KB Output is correct
26 Correct 0 ms 16864 KB Output is correct
27 Correct 0 ms 16864 KB Output is correct
28 Correct 606 ms 21588 KB Output is correct
29 Correct 593 ms 21588 KB Output is correct
30 Correct 0 ms 16864 KB Output is correct
31 Correct 0 ms 16864 KB Output is correct
32 Correct 0 ms 16864 KB Output is correct
33 Correct 0 ms 16864 KB Output is correct
34 Correct 0 ms 16864 KB Output is correct
35 Correct 0 ms 16864 KB Output is correct
36 Correct 0 ms 16864 KB Output is correct
37 Correct 0 ms 16864 KB Output is correct
38 Correct 0 ms 16864 KB Output is correct
39 Correct 0 ms 16864 KB Output is correct
40 Correct 0 ms 16864 KB Output is correct
41 Correct 0 ms 16864 KB Output is correct
42 Correct 0 ms 16864 KB Output is correct
43 Correct 573 ms 21588 KB Output is correct
44 Correct 576 ms 21588 KB Output is correct
45 Correct 619 ms 21588 KB Output is correct
46 Correct 553 ms 21588 KB Output is correct
47 Correct 589 ms 21588 KB Output is correct
48 Correct 583 ms 21588 KB Output is correct
49 Correct 616 ms 21588 KB Output is correct
50 Correct 0 ms 16864 KB Output is correct
51 Correct 653 ms 21588 KB Output is correct
52 Correct 559 ms 21588 KB Output is correct
53 Correct 609 ms 21588 KB Output is correct
54 Correct 589 ms 21588 KB Output is correct
55 Correct 0 ms 16864 KB Output is correct
56 Correct 0 ms 16864 KB Output is correct
57 Correct 0 ms 16864 KB Output is correct
58 Correct 0 ms 16864 KB Output is correct
59 Correct 0 ms 16864 KB Output is correct
60 Correct 0 ms 16864 KB Output is correct
61 Correct 0 ms 16864 KB Output is correct
62 Correct 0 ms 16864 KB Output is correct
63 Correct 0 ms 16864 KB Output is correct
64 Correct 0 ms 16864 KB Output is correct
65 Correct 0 ms 16864 KB Output is correct
66 Correct 0 ms 16864 KB Output is correct
67 Correct 533 ms 21588 KB Output is correct
68 Correct 603 ms 21588 KB Output is correct
69 Correct 633 ms 21588 KB Output is correct
70 Correct 613 ms 21588 KB Output is correct
71 Correct 449 ms 21588 KB Output is correct
72 Correct 369 ms 21588 KB Output is correct
73 Correct 426 ms 21588 KB Output is correct
74 Correct 449 ms 21588 KB Output is correct
75 Correct 519 ms 21588 KB Output is correct
76 Correct 549 ms 21588 KB Output is correct
77 Correct 606 ms 21588 KB Output is correct
78 Correct 516 ms 21588 KB Output is correct
79 Correct 649 ms 21588 KB Output is correct
80 Correct 496 ms 21588 KB Output is correct
81 Correct 439 ms 21588 KB Output is correct
82 Correct 403 ms 21588 KB Output is correct
83 Correct 409 ms 21588 KB Output is correct
84 Correct 409 ms 21588 KB Output is correct
85 Correct 579 ms 21588 KB Output is correct
86 Correct 459 ms 21588 KB Output is correct
87 Correct 469 ms 21588 KB Output is correct
88 Correct 523 ms 21588 KB Output is correct
89 Correct 516 ms 21588 KB Output is correct
90 Correct 606 ms 21588 KB Output is correct
91 Correct 499 ms 21588 KB Output is correct
92 Correct 619 ms 21588 KB Output is correct
93 Correct 493 ms 21588 KB Output is correct
94 Correct 593 ms 21588 KB Output is correct
95 Correct 603 ms 21588 KB Output is correct
96 Correct 436 ms 21588 KB Output is correct
97 Correct 439 ms 21588 KB Output is correct
98 Correct 483 ms 21588 KB Output is correct
99 Correct 473 ms 21588 KB Output is correct
100 Correct 629 ms 21588 KB Output is correct
101 Correct 476 ms 21588 KB Output is correct
102 Correct 549 ms 21588 KB Output is correct