#include "wiring.h"
#include <bits/stdc++.h>
using namespace std;
#define form2(i, a, b) for (int i = (a); i < (b); ++i)
#define ford2(i, a, b) for (int i = (a-1); i >= (b); --i)
#define form(i, n) form2(i, 0, n)
#define ford(i, n) ford2(i, n, 0)
#define chmax(x, v) x = max(x, (v))
#define chmin(x, v) x = min(x, (v))
#define fi first
#define se second
#define vsz(x) (int)(x.size())
const long long BIG = 1000000000000000000LL;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
int nbGroupes;
vector<int> groupes;
vector<int> beg;
vector<int> rouges, bleus;
vector<ll> redSom, blueSom;
vector<vector<ll>> dp;
void propag(int groupesProc, int restants, vector<int> &prevPos, vector<int> &curPos, vector<ll> &prevSom, vector<ll> &curSom)
{
//cout << groupesProc << " " << restants << " " << dp[groupesProc][restants] << endl << flush;
assert(dp[groupesProc][restants] != BIG);
int prev = groupesProc-1, cur = groupesProc;
int relLeft = groupes[prev] - restants;
assert(prevPos[beg[prev]] < curPos[beg[cur]]);
assert(prevPos[beg[prev]+groupes[prev]-1] < curPos[beg[cur]]);
// Transition 1 : prendre le plus à gauche des restants
if (restants) {
int relLeft = groupes[prev] - restants;
int posLeft = prevPos[beg[prev] + relLeft];
int posAx = curPos[beg[cur]];
chmin(dp[groupesProc][restants-1], dp[groupesProc][restants] + posAx - posLeft);
}
// Transition 2 : prendre tous les restants, et les mettre avec nous
if (restants > 0 && restants <= groupes[cur] && groupesProc < nbGroupes) {
ll spCur = curSom[beg[cur] + restants] - curSom[beg[cur]];
ll spPrev = prevSom[beg[prev] + groupes[prev]] - prevSom[beg[prev] + relLeft];
assert(spCur > spPrev);
chmin(dp[groupesProc+1][groupes[cur] - restants], dp[groupesProc][restants] + spCur - spPrev);
}
// Transition 3 : finir le groupe courant sur le groupe précédent, à la propagInit
if (restants == 0) {
chmin(dp[groupesProc+1][groupes[cur]], dp[groupesProc][0]);
for (int now = groupes[cur]; now > 0; --now) {
int lstPrev = prevPos[beg[prev] + groupes[prev]-1];
int posAx = curPos[beg[cur] + groupes[cur]-now];
chmin(dp[groupesProc+1][now-1], dp[groupesProc+1][now] + abs(lstPrev - posAx));
}
}
}
void propagInit()
{
dp[1][groupes[0]] = 0;
for (int now = groupes[0]; now > 0; --now) {
chmin(dp[1][now-1], dp[1][now] + bleus[0] - rouges[groupes[0]-now]);
}
}
void buildSom(vector<int> &pos, vector<ll> &som)
{
som.resize(pos.size() + 1U);
som[0] = 0;
form(i, vsz(pos)) {
som[i+1] = som[i] + pos[i];
}
}
ll min_total_length(std::vector<int> r, std::vector<int> b) {
if (r.front() > b.front()) swap(r, b);
int n = r.size(), m = b.size();
int i = 0, j = 0;
while (i < n && j < m) {
groupes.push_back(0);
if (r[i] < b[j]) {
beg.push_back(i);
while (i < n && r[i] < b[j]) { ++groupes.back(); ++i; }
} else {
beg.push_back(j);
while (j < m && b[j] < r[i]) { ++groupes.back(); ++j; }
}
}
if (i < n) {
beg.push_back(i);
groupes.push_back(n-i);
}
if (j < m) {
beg.push_back(j);
groupes.push_back(m-j);
}
rouges = r; bleus = b;
nbGroupes = groupes.size();
buildSom(rouges, redSom);
buildSom(bleus, blueSom);
/*for (int x : groupes) cout << x << " ";
cout << endl;
for (int x : beg) cout << x << " ";
cout << endl;*/
dp.resize(nbGroupes+1);
form(i, nbGroupes) dp[i+1].assign(groupes[i]+1, BIG);
propagInit();
form2(groupesProc, 1, nbGroupes) {
ford(restants, groupes[groupesProc-1]+1) {
if (groupesProc % 2 == 1) propag(groupesProc, restants, rouges, bleus, redSom, blueSom);
else propag(groupesProc, restants, bleus, rouges, blueSom, redSom);
}
}
return dp[nbGroupes][0];
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
2 ms |
256 KB |
Output is correct |
2 |
Correct |
3 ms |
384 KB |
Output is correct |
3 |
Correct |
2 ms |
256 KB |
Output is correct |
4 |
Correct |
2 ms |
384 KB |
Output is correct |
5 |
Correct |
2 ms |
256 KB |
Output is correct |
6 |
Correct |
2 ms |
256 KB |
Output is correct |
7 |
Correct |
3 ms |
384 KB |
Output is correct |
8 |
Correct |
3 ms |
256 KB |
Output is correct |
9 |
Correct |
2 ms |
384 KB |
Output is correct |
10 |
Correct |
2 ms |
256 KB |
Output is correct |
11 |
Correct |
2 ms |
256 KB |
Output is correct |
12 |
Correct |
2 ms |
384 KB |
Output is correct |
13 |
Correct |
2 ms |
256 KB |
Output is correct |
14 |
Correct |
2 ms |
384 KB |
Output is correct |
15 |
Correct |
3 ms |
384 KB |
Output is correct |
16 |
Correct |
2 ms |
256 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
3 ms |
256 KB |
Output is correct |
2 |
Correct |
2 ms |
256 KB |
Output is correct |
3 |
Correct |
34 ms |
4472 KB |
Output is correct |
4 |
Correct |
51 ms |
5928 KB |
Output is correct |
5 |
Correct |
36 ms |
5884 KB |
Output is correct |
6 |
Correct |
53 ms |
7800 KB |
Output is correct |
7 |
Correct |
42 ms |
7772 KB |
Output is correct |
8 |
Correct |
51 ms |
7776 KB |
Output is correct |
9 |
Correct |
43 ms |
7800 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
2 ms |
428 KB |
Output is correct |
2 |
Correct |
2 ms |
384 KB |
Output is correct |
3 |
Correct |
46 ms |
8868 KB |
Output is correct |
4 |
Correct |
41 ms |
8964 KB |
Output is correct |
5 |
Correct |
2 ms |
256 KB |
Output is correct |
6 |
Correct |
5 ms |
256 KB |
Output is correct |
7 |
Correct |
3 ms |
356 KB |
Output is correct |
8 |
Correct |
3 ms |
256 KB |
Output is correct |
9 |
Correct |
3 ms |
256 KB |
Output is correct |
10 |
Correct |
2 ms |
256 KB |
Output is correct |
11 |
Correct |
3 ms |
384 KB |
Output is correct |
12 |
Correct |
2 ms |
256 KB |
Output is correct |
13 |
Correct |
2 ms |
384 KB |
Output is correct |
14 |
Correct |
2 ms |
256 KB |
Output is correct |
15 |
Correct |
2 ms |
384 KB |
Output is correct |
16 |
Correct |
2 ms |
256 KB |
Output is correct |
17 |
Correct |
3 ms |
384 KB |
Output is correct |
18 |
Correct |
64 ms |
10656 KB |
Output is correct |
19 |
Correct |
54 ms |
10656 KB |
Output is correct |
20 |
Correct |
52 ms |
9376 KB |
Output is correct |
21 |
Correct |
57 ms |
10704 KB |
Output is correct |
22 |
Correct |
57 ms |
10276 KB |
Output is correct |
23 |
Correct |
44 ms |
10400 KB |
Output is correct |
24 |
Correct |
52 ms |
10272 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
2 ms |
256 KB |
Output is correct |
2 |
Correct |
35 ms |
5888 KB |
Output is correct |
3 |
Correct |
56 ms |
6904 KB |
Output is correct |
4 |
Correct |
42 ms |
5888 KB |
Output is correct |
5 |
Correct |
39 ms |
6776 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 |
256 KB |
Output is correct |
9 |
Correct |
2 ms |
384 KB |
Output is correct |
10 |
Correct |
2 ms |
384 KB |
Output is correct |
11 |
Correct |
2 ms |
384 KB |
Output is correct |
12 |
Correct |
2 ms |
384 KB |
Output is correct |
13 |
Correct |
3 ms |
384 KB |
Output is correct |
14 |
Correct |
2 ms |
256 KB |
Output is correct |
15 |
Correct |
2 ms |
256 KB |
Output is correct |
16 |
Correct |
2 ms |
256 KB |
Output is correct |
17 |
Correct |
2 ms |
384 KB |
Output is correct |
18 |
Correct |
30 ms |
5764 KB |
Output is correct |
19 |
Correct |
40 ms |
7032 KB |
Output is correct |
20 |
Correct |
33 ms |
7160 KB |
Output is correct |
21 |
Correct |
35 ms |
7080 KB |
Output is correct |
22 |
Correct |
31 ms |
7160 KB |
Output is correct |
23 |
Correct |
48 ms |
7160 KB |
Output is correct |
24 |
Correct |
33 ms |
7160 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
2 ms |
256 KB |
Output is correct |
2 |
Correct |
3 ms |
384 KB |
Output is correct |
3 |
Correct |
2 ms |
256 KB |
Output is correct |
4 |
Correct |
2 ms |
384 KB |
Output is correct |
5 |
Correct |
2 ms |
256 KB |
Output is correct |
6 |
Correct |
2 ms |
256 KB |
Output is correct |
7 |
Correct |
3 ms |
384 KB |
Output is correct |
8 |
Correct |
3 ms |
256 KB |
Output is correct |
9 |
Correct |
2 ms |
384 KB |
Output is correct |
10 |
Correct |
2 ms |
256 KB |
Output is correct |
11 |
Correct |
2 ms |
256 KB |
Output is correct |
12 |
Correct |
2 ms |
384 KB |
Output is correct |
13 |
Correct |
2 ms |
256 KB |
Output is correct |
14 |
Correct |
2 ms |
384 KB |
Output is correct |
15 |
Correct |
3 ms |
384 KB |
Output is correct |
16 |
Correct |
2 ms |
256 KB |
Output is correct |
17 |
Correct |
3 ms |
256 KB |
Output is correct |
18 |
Correct |
2 ms |
256 KB |
Output is correct |
19 |
Correct |
34 ms |
4472 KB |
Output is correct |
20 |
Correct |
51 ms |
5928 KB |
Output is correct |
21 |
Correct |
36 ms |
5884 KB |
Output is correct |
22 |
Correct |
53 ms |
7800 KB |
Output is correct |
23 |
Correct |
42 ms |
7772 KB |
Output is correct |
24 |
Correct |
51 ms |
7776 KB |
Output is correct |
25 |
Correct |
43 ms |
7800 KB |
Output is correct |
26 |
Correct |
2 ms |
428 KB |
Output is correct |
27 |
Correct |
2 ms |
384 KB |
Output is correct |
28 |
Correct |
46 ms |
8868 KB |
Output is correct |
29 |
Correct |
41 ms |
8964 KB |
Output is correct |
30 |
Correct |
2 ms |
256 KB |
Output is correct |
31 |
Correct |
5 ms |
256 KB |
Output is correct |
32 |
Correct |
3 ms |
356 KB |
Output is correct |
33 |
Correct |
3 ms |
256 KB |
Output is correct |
34 |
Correct |
3 ms |
256 KB |
Output is correct |
35 |
Correct |
2 ms |
256 KB |
Output is correct |
36 |
Correct |
3 ms |
384 KB |
Output is correct |
37 |
Correct |
2 ms |
256 KB |
Output is correct |
38 |
Correct |
2 ms |
384 KB |
Output is correct |
39 |
Correct |
2 ms |
256 KB |
Output is correct |
40 |
Correct |
2 ms |
384 KB |
Output is correct |
41 |
Correct |
2 ms |
256 KB |
Output is correct |
42 |
Correct |
3 ms |
384 KB |
Output is correct |
43 |
Correct |
64 ms |
10656 KB |
Output is correct |
44 |
Correct |
54 ms |
10656 KB |
Output is correct |
45 |
Correct |
52 ms |
9376 KB |
Output is correct |
46 |
Correct |
57 ms |
10704 KB |
Output is correct |
47 |
Correct |
57 ms |
10276 KB |
Output is correct |
48 |
Correct |
44 ms |
10400 KB |
Output is correct |
49 |
Correct |
52 ms |
10272 KB |
Output is correct |
50 |
Correct |
2 ms |
256 KB |
Output is correct |
51 |
Correct |
35 ms |
5888 KB |
Output is correct |
52 |
Correct |
56 ms |
6904 KB |
Output is correct |
53 |
Correct |
42 ms |
5888 KB |
Output is correct |
54 |
Correct |
39 ms |
6776 KB |
Output is correct |
55 |
Correct |
2 ms |
384 KB |
Output is correct |
56 |
Correct |
3 ms |
384 KB |
Output is correct |
57 |
Correct |
2 ms |
256 KB |
Output is correct |
58 |
Correct |
2 ms |
384 KB |
Output is correct |
59 |
Correct |
2 ms |
384 KB |
Output is correct |
60 |
Correct |
2 ms |
384 KB |
Output is correct |
61 |
Correct |
2 ms |
384 KB |
Output is correct |
62 |
Correct |
3 ms |
384 KB |
Output is correct |
63 |
Correct |
2 ms |
256 KB |
Output is correct |
64 |
Correct |
2 ms |
256 KB |
Output is correct |
65 |
Correct |
2 ms |
256 KB |
Output is correct |
66 |
Correct |
2 ms |
384 KB |
Output is correct |
67 |
Correct |
30 ms |
5764 KB |
Output is correct |
68 |
Correct |
40 ms |
7032 KB |
Output is correct |
69 |
Correct |
33 ms |
7160 KB |
Output is correct |
70 |
Correct |
35 ms |
7080 KB |
Output is correct |
71 |
Correct |
31 ms |
7160 KB |
Output is correct |
72 |
Correct |
48 ms |
7160 KB |
Output is correct |
73 |
Correct |
33 ms |
7160 KB |
Output is correct |
74 |
Correct |
44 ms |
8028 KB |
Output is correct |
75 |
Correct |
66 ms |
7416 KB |
Output is correct |
76 |
Correct |
51 ms |
7800 KB |
Output is correct |
77 |
Correct |
42 ms |
7288 KB |
Output is correct |
78 |
Correct |
44 ms |
7160 KB |
Output is correct |
79 |
Correct |
32 ms |
7160 KB |
Output is correct |
80 |
Correct |
43 ms |
7160 KB |
Output is correct |
81 |
Correct |
34 ms |
7324 KB |
Output is correct |
82 |
Correct |
35 ms |
7288 KB |
Output is correct |
83 |
Correct |
33 ms |
7416 KB |
Output is correct |
84 |
Correct |
40 ms |
7800 KB |
Output is correct |
85 |
Correct |
48 ms |
7844 KB |
Output is correct |
86 |
Correct |
44 ms |
7800 KB |
Output is correct |
87 |
Correct |
47 ms |
7800 KB |
Output is correct |
88 |
Correct |
62 ms |
7928 KB |
Output is correct |
89 |
Correct |
74 ms |
7800 KB |
Output is correct |
90 |
Correct |
44 ms |
7800 KB |
Output is correct |
91 |
Correct |
49 ms |
7800 KB |
Output is correct |
92 |
Correct |
70 ms |
7928 KB |
Output is correct |
93 |
Correct |
38 ms |
7840 KB |
Output is correct |
94 |
Correct |
44 ms |
7800 KB |
Output is correct |
95 |
Correct |
47 ms |
7928 KB |
Output is correct |
96 |
Correct |
44 ms |
7800 KB |
Output is correct |
97 |
Correct |
44 ms |
7800 KB |
Output is correct |
98 |
Correct |
43 ms |
7800 KB |
Output is correct |
99 |
Correct |
42 ms |
7800 KB |
Output is correct |
100 |
Correct |
56 ms |
7900 KB |
Output is correct |
101 |
Correct |
52 ms |
7900 KB |
Output is correct |
102 |
Correct |
45 ms |
7800 KB |
Output is correct |