#include "wiring.h"
#include <bits/stdc++.h>
#ifdef GUDEB
#define D(x) cerr << #x << ": " << (x) << '\n';
#define ifdeb if(true)
#else
#define D(x) ;
#define ifdeb if(false)
#endif
#define all(x) begin(x), end(x)
using namespace std;
using ull = unsigned long long;
using ll = long long;
// #define int ll;
ll it[400000];
ll itl[400000];
int s = 1;
int n;
int m;
void radd(int l, int r, ll a, int u = 1, int ul = 0, int ur = s) {
if(r <= ul || ur <= l) return;
if(l <= ul && ur <= r) {
itl[u] += a;
it[u] += a;
return;
}
if(itl[u]) {
itl[2*u] += itl[u];
it[2*u] += itl[u];
itl[2*u+1] += itl[u];
it[2*u+1] += itl[u];
itl[u] = 0;
}
int um = (ul + ur)/2;
radd(l, r, a, 2*u , ul, um);
radd(l, r, a, 2*u+1, um, ur);
it[u] = min(it[2*u], it[2*u+1]);
return;
}
ll rmin(int l, int r, int u = 1, int ul = 0, int ur = s) {
if(r <= ul || ur <= l) return 1ll << 60;
if(l <= ul && ur <= r) {
return it[u];
}
if(itl[u]) {
itl[2*u] += itl[u];
it[2*u] += itl[u];
itl[2*u+1] += itl[u];
it[2*u+1] += itl[u];
itl[u] = 0;
}
int um = (ul + ur)/2;
return min(rmin(l, r, 2*u, ul, um), rmin(l, r, 2*u+1, um, ur));
}
ll min_total_length(vector<int> r, vector<int> b) {
n = r.size();
m = b.size();
vector<vector<int>> blocks;
{
int i = 0;
int j = 0;
while(i < n && j < m) {
if(r[i] < b[j]) {
blocks.push_back({});
while(i < n && r[i] < b[j]) {
blocks.back().push_back(r[i]);
++i;
}
} else {
blocks.push_back({});
while(j < m && b[j] < r[i]) {
blocks.back().push_back(b[j]);
j++;
}
}
}
if(i < n) {
blocks.push_back({});
while(i < n) {
blocks.back().push_back(r[i]);
++i;
}
}
if(j < m) {
blocks.push_back({});
while(j < m) {
blocks.back().push_back(b[j]);
++j;
}
}
}
int bc = blocks.size();
vector<vector<ll>> dp(bc);
for(int i = 0; i < bc; ++i) {
int bs = blocks[i].size();
assert(bs != 0);
dp[i].resize(bs+1);
vector<ll> ld(bs+1);
vector<ll> rd(bs+1);
for(int j = 1; j < bs; ++j) {
ld[j] = ld[j-1] + blocks[i][j] - blocks[i][0];
}
for(int j = bs-2; j >= 0; --j) {
rd[j] = rd[j+1] + blocks[i][bs-1] - blocks[i][j];
}
dp[i][0] = rd[0];
dp[i][bs] = ld[bs-1];
for(int j = 1; j < bs; ++j) {
dp[i][j] = rd[j] + ld[j-1];
}
}
for(int i = 1; i < dp[0].size(); ++i) {
dp[0][i] = 1ll << 60;
}
ifdeb {
cout << "\n\n";
for(auto b : dp) {
for(auto a : b) {
cout << a << ' ';
}
cout << '\n';
}
cout << "\n";
}
for(int i = 1; i < bc; ++i) {
D(i)
ll lds = dp[i-1].size();
ll ds = dp[i].size();
s = 1;
ll dist = blocks[i].front() - blocks[i-1].back();
D(dist)
while(s < lds) s *= 2;
for(int j = 0; j < lds; ++j) {
it[s+j] = dp[i-1][j] + (lds-j-1)*dist;
D(it[s+j]);
itl[s+j] = 0;
}
for(int j = lds; j < s; ++j) {
it[s+j] = 1ll << 60;
itl[s+j] = 0;
}
for(int j = s-1; j > 0; --j) {
it[j] = min(it[2*j], it[2*j+1]);
itl[j] = 0;
}
for(int j = 0; j < ds; ++j) {
radd(max(lds-j, 0ll), lds, dist);
dp[i][j] += rmin(0, lds);
D(dp[i][j]);
}
}
ifdeb {
cout << "\n\n";
for(auto b : blocks) {
for(auto a : b) {
cout << a << ' ';
}
cout << '\n';
}
cout << "\n";
for(auto b : dp) {
for(auto a : b) {
cout << a << ' ';
}
cout << '\n';
}
cout << "\n";
}
return dp.back().back();
}
Compilation message
wiring.cpp: In function 'll min_total_length(std::vector<int>, std::vector<int>)':
wiring.cpp:122:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
122 | for(int i = 1; i < dp[0].size(); ++i) {
| ~~^~~~~~~~~~~~~~
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
212 KB |
Output is correct |
2 |
Correct |
0 ms |
212 KB |
Output is correct |
3 |
Correct |
0 ms |
212 KB |
Output is correct |
4 |
Correct |
0 ms |
212 KB |
Output is correct |
5 |
Correct |
0 ms |
212 KB |
Output is correct |
6 |
Correct |
0 ms |
212 KB |
Output is correct |
7 |
Correct |
0 ms |
340 KB |
Output is correct |
8 |
Correct |
0 ms |
212 KB |
Output is correct |
9 |
Correct |
1 ms |
212 KB |
Output is correct |
10 |
Correct |
0 ms |
212 KB |
Output is correct |
11 |
Correct |
0 ms |
340 KB |
Output is correct |
12 |
Correct |
0 ms |
212 KB |
Output is correct |
13 |
Correct |
0 ms |
340 KB |
Output is correct |
14 |
Correct |
0 ms |
340 KB |
Output is correct |
15 |
Correct |
0 ms |
340 KB |
Output is correct |
16 |
Correct |
0 ms |
340 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
212 KB |
Output is correct |
2 |
Correct |
1 ms |
212 KB |
Output is correct |
3 |
Correct |
36 ms |
8288 KB |
Output is correct |
4 |
Correct |
32 ms |
9856 KB |
Output is correct |
5 |
Correct |
34 ms |
6896 KB |
Output is correct |
6 |
Correct |
53 ms |
10332 KB |
Output is correct |
7 |
Correct |
53 ms |
10364 KB |
Output is correct |
8 |
Correct |
65 ms |
10364 KB |
Output is correct |
9 |
Correct |
52 ms |
10360 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
212 KB |
Output is correct |
2 |
Correct |
0 ms |
212 KB |
Output is correct |
3 |
Correct |
37 ms |
9284 KB |
Output is correct |
4 |
Correct |
34 ms |
7112 KB |
Output is correct |
5 |
Correct |
1 ms |
212 KB |
Output is correct |
6 |
Correct |
0 ms |
212 KB |
Output is correct |
7 |
Correct |
0 ms |
212 KB |
Output is correct |
8 |
Correct |
0 ms |
212 KB |
Output is correct |
9 |
Correct |
0 ms |
212 KB |
Output is correct |
10 |
Correct |
0 ms |
212 KB |
Output is correct |
11 |
Correct |
0 ms |
212 KB |
Output is correct |
12 |
Correct |
1 ms |
212 KB |
Output is correct |
13 |
Correct |
0 ms |
212 KB |
Output is correct |
14 |
Correct |
0 ms |
212 KB |
Output is correct |
15 |
Correct |
0 ms |
212 KB |
Output is correct |
16 |
Correct |
0 ms |
212 KB |
Output is correct |
17 |
Correct |
0 ms |
212 KB |
Output is correct |
18 |
Correct |
43 ms |
9216 KB |
Output is correct |
19 |
Correct |
40 ms |
9220 KB |
Output is correct |
20 |
Correct |
37 ms |
7128 KB |
Output is correct |
21 |
Correct |
37 ms |
9332 KB |
Output is correct |
22 |
Correct |
37 ms |
8580 KB |
Output is correct |
23 |
Correct |
36 ms |
8576 KB |
Output is correct |
24 |
Correct |
39 ms |
8608 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
212 KB |
Output is correct |
2 |
Correct |
56 ms |
4960 KB |
Output is correct |
3 |
Correct |
34 ms |
6148 KB |
Output is correct |
4 |
Correct |
45 ms |
4692 KB |
Output is correct |
5 |
Correct |
31 ms |
6088 KB |
Output is correct |
6 |
Correct |
0 ms |
212 KB |
Output is correct |
7 |
Correct |
1 ms |
212 KB |
Output is correct |
8 |
Correct |
0 ms |
212 KB |
Output is correct |
9 |
Correct |
0 ms |
212 KB |
Output is correct |
10 |
Correct |
0 ms |
212 KB |
Output is correct |
11 |
Correct |
0 ms |
212 KB |
Output is correct |
12 |
Correct |
0 ms |
212 KB |
Output is correct |
13 |
Correct |
1 ms |
212 KB |
Output is correct |
14 |
Correct |
0 ms |
212 KB |
Output is correct |
15 |
Correct |
0 ms |
212 KB |
Output is correct |
16 |
Correct |
0 ms |
212 KB |
Output is correct |
17 |
Correct |
0 ms |
212 KB |
Output is correct |
18 |
Correct |
65 ms |
6760 KB |
Output is correct |
19 |
Correct |
48 ms |
4408 KB |
Output is correct |
20 |
Correct |
53 ms |
4692 KB |
Output is correct |
21 |
Correct |
60 ms |
5532 KB |
Output is correct |
22 |
Correct |
63 ms |
9048 KB |
Output is correct |
23 |
Correct |
50 ms |
10424 KB |
Output is correct |
24 |
Correct |
60 ms |
10072 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
212 KB |
Output is correct |
2 |
Correct |
0 ms |
212 KB |
Output is correct |
3 |
Correct |
0 ms |
212 KB |
Output is correct |
4 |
Correct |
0 ms |
212 KB |
Output is correct |
5 |
Correct |
0 ms |
212 KB |
Output is correct |
6 |
Correct |
0 ms |
212 KB |
Output is correct |
7 |
Correct |
0 ms |
340 KB |
Output is correct |
8 |
Correct |
0 ms |
212 KB |
Output is correct |
9 |
Correct |
1 ms |
212 KB |
Output is correct |
10 |
Correct |
0 ms |
212 KB |
Output is correct |
11 |
Correct |
0 ms |
340 KB |
Output is correct |
12 |
Correct |
0 ms |
212 KB |
Output is correct |
13 |
Correct |
0 ms |
340 KB |
Output is correct |
14 |
Correct |
0 ms |
340 KB |
Output is correct |
15 |
Correct |
0 ms |
340 KB |
Output is correct |
16 |
Correct |
0 ms |
340 KB |
Output is correct |
17 |
Correct |
0 ms |
212 KB |
Output is correct |
18 |
Correct |
1 ms |
212 KB |
Output is correct |
19 |
Correct |
36 ms |
8288 KB |
Output is correct |
20 |
Correct |
32 ms |
9856 KB |
Output is correct |
21 |
Correct |
34 ms |
6896 KB |
Output is correct |
22 |
Correct |
53 ms |
10332 KB |
Output is correct |
23 |
Correct |
53 ms |
10364 KB |
Output is correct |
24 |
Correct |
65 ms |
10364 KB |
Output is correct |
25 |
Correct |
52 ms |
10360 KB |
Output is correct |
26 |
Correct |
0 ms |
212 KB |
Output is correct |
27 |
Correct |
0 ms |
212 KB |
Output is correct |
28 |
Correct |
37 ms |
9284 KB |
Output is correct |
29 |
Correct |
34 ms |
7112 KB |
Output is correct |
30 |
Correct |
1 ms |
212 KB |
Output is correct |
31 |
Correct |
0 ms |
212 KB |
Output is correct |
32 |
Correct |
0 ms |
212 KB |
Output is correct |
33 |
Correct |
0 ms |
212 KB |
Output is correct |
34 |
Correct |
0 ms |
212 KB |
Output is correct |
35 |
Correct |
0 ms |
212 KB |
Output is correct |
36 |
Correct |
0 ms |
212 KB |
Output is correct |
37 |
Correct |
1 ms |
212 KB |
Output is correct |
38 |
Correct |
0 ms |
212 KB |
Output is correct |
39 |
Correct |
0 ms |
212 KB |
Output is correct |
40 |
Correct |
0 ms |
212 KB |
Output is correct |
41 |
Correct |
0 ms |
212 KB |
Output is correct |
42 |
Correct |
0 ms |
212 KB |
Output is correct |
43 |
Correct |
43 ms |
9216 KB |
Output is correct |
44 |
Correct |
40 ms |
9220 KB |
Output is correct |
45 |
Correct |
37 ms |
7128 KB |
Output is correct |
46 |
Correct |
37 ms |
9332 KB |
Output is correct |
47 |
Correct |
37 ms |
8580 KB |
Output is correct |
48 |
Correct |
36 ms |
8576 KB |
Output is correct |
49 |
Correct |
39 ms |
8608 KB |
Output is correct |
50 |
Correct |
0 ms |
212 KB |
Output is correct |
51 |
Correct |
56 ms |
4960 KB |
Output is correct |
52 |
Correct |
34 ms |
6148 KB |
Output is correct |
53 |
Correct |
45 ms |
4692 KB |
Output is correct |
54 |
Correct |
31 ms |
6088 KB |
Output is correct |
55 |
Correct |
0 ms |
212 KB |
Output is correct |
56 |
Correct |
1 ms |
212 KB |
Output is correct |
57 |
Correct |
0 ms |
212 KB |
Output is correct |
58 |
Correct |
0 ms |
212 KB |
Output is correct |
59 |
Correct |
0 ms |
212 KB |
Output is correct |
60 |
Correct |
0 ms |
212 KB |
Output is correct |
61 |
Correct |
0 ms |
212 KB |
Output is correct |
62 |
Correct |
1 ms |
212 KB |
Output is correct |
63 |
Correct |
0 ms |
212 KB |
Output is correct |
64 |
Correct |
0 ms |
212 KB |
Output is correct |
65 |
Correct |
0 ms |
212 KB |
Output is correct |
66 |
Correct |
0 ms |
212 KB |
Output is correct |
67 |
Correct |
65 ms |
6760 KB |
Output is correct |
68 |
Correct |
48 ms |
4408 KB |
Output is correct |
69 |
Correct |
53 ms |
4692 KB |
Output is correct |
70 |
Correct |
60 ms |
5532 KB |
Output is correct |
71 |
Correct |
63 ms |
9048 KB |
Output is correct |
72 |
Correct |
50 ms |
10424 KB |
Output is correct |
73 |
Correct |
60 ms |
10072 KB |
Output is correct |
74 |
Correct |
52 ms |
11256 KB |
Output is correct |
75 |
Correct |
48 ms |
8184 KB |
Output is correct |
76 |
Correct |
52 ms |
10592 KB |
Output is correct |
77 |
Correct |
64 ms |
8312 KB |
Output is correct |
78 |
Correct |
60 ms |
9796 KB |
Output is correct |
79 |
Correct |
60 ms |
8296 KB |
Output is correct |
80 |
Correct |
54 ms |
10492 KB |
Output is correct |
81 |
Correct |
52 ms |
10000 KB |
Output is correct |
82 |
Correct |
44 ms |
10396 KB |
Output is correct |
83 |
Correct |
49 ms |
11052 KB |
Output is correct |
84 |
Correct |
46 ms |
11360 KB |
Output is correct |
85 |
Correct |
54 ms |
8384 KB |
Output is correct |
86 |
Correct |
61 ms |
10844 KB |
Output is correct |
87 |
Correct |
58 ms |
11100 KB |
Output is correct |
88 |
Correct |
51 ms |
8520 KB |
Output is correct |
89 |
Correct |
56 ms |
8448 KB |
Output is correct |
90 |
Correct |
73 ms |
9032 KB |
Output is correct |
91 |
Correct |
56 ms |
11088 KB |
Output is correct |
92 |
Correct |
59 ms |
10332 KB |
Output is correct |
93 |
Correct |
57 ms |
10412 KB |
Output is correct |
94 |
Correct |
63 ms |
10544 KB |
Output is correct |
95 |
Correct |
68 ms |
8504 KB |
Output is correct |
96 |
Correct |
53 ms |
11212 KB |
Output is correct |
97 |
Correct |
59 ms |
10520 KB |
Output is correct |
98 |
Correct |
58 ms |
10956 KB |
Output is correct |
99 |
Correct |
58 ms |
10944 KB |
Output is correct |
100 |
Correct |
67 ms |
10392 KB |
Output is correct |
101 |
Correct |
54 ms |
10320 KB |
Output is correct |
102 |
Correct |
51 ms |
10828 KB |
Output is correct |