#include <bits/stdc++.h>
#define int long long
#define sz(x) (long long)(x.size())
using namespace std;
struct traj{
int l, r;
long double mid;
};
vector <traj> a;
signed main() {
int K, N; cin >> K >> N;
int ans(0);
for (int i(0); i < N; i++) {
char riv1, riv2;
int pos1, pos2;
cin >> riv1 >> pos1 >> riv2 >> pos2;
if (pos2 < pos1) swap(pos1, pos2);
if (riv1 != riv2) {
ans++;
a.push_back ({pos1, pos2, (long double)( (pos1 + pos2) / 2)});
}
else ans += pos2 - pos1;
}
if (sz(a) == 0){
cout << ans << '\n';
return 0;
}
sort (a.begin(), a.end(), [](traj &A, traj &B){return A.mid < B.mid;});
priority_queue <int> gaucheoudroitejesaisplus;
priority_queue <int, vector<int>, greater <int>> droiteougauchejesaisplus;
vector <int> pleindepointtropcool (sz(a)), pleindepointtropcool2 (sz(a));
int letrucdumilieu = a[0].l;
gaucheoudroitejesaisplus.push(a[0].l);
droiteougauchejesaisplus.push(a[0].r);
pleindepointtropcool[0] = a[0].r - a[0].l;
for (int i(1); i < sz(a); i++) {
pleindepointtropcool[i] = pleindepointtropcool[i - 1] + abs(a[i].l - letrucdumilieu) + abs(a[i].r - letrucdumilieu);
if (a[i].l > gaucheoudroitejesaisplus.top()) droiteougauchejesaisplus.push(a[i].l);
else gaucheoudroitejesaisplus.push(a[i].l);
if (a[i].r <= gaucheoudroitejesaisplus.top()) gaucheoudroitejesaisplus.push(a[i].r);
else droiteougauchejesaisplus.push(a[i].r);
int szL = sz(gaucheoudroitejesaisplus), szR = sz(droiteougauchejesaisplus);
while (gaucheoudroitejesaisplus.size() > droiteougauchejesaisplus.size()) {
droiteougauchejesaisplus.push(gaucheoudroitejesaisplus.top());
gaucheoudroitejesaisplus.pop();
}
while (gaucheoudroitejesaisplus.size() < droiteougauchejesaisplus.size()) {
gaucheoudroitejesaisplus.push(droiteougauchejesaisplus.top());
droiteougauchejesaisplus.pop();
}
int newletrucdumilieu = gaucheoudroitejesaisplus.top();
if (newletrucdumilieu > letrucdumilieu) {
pleindepointtropcool[i] += szL * (newletrucdumilieu - letrucdumilieu);
pleindepointtropcool[i] -= szR * (newletrucdumilieu - letrucdumilieu);
}
else {
pleindepointtropcool[i] -= (szL -1) * (letrucdumilieu - newletrucdumilieu);
pleindepointtropcool[i] += (szR + 1) * (letrucdumilieu - newletrucdumilieu);
}
letrucdumilieu = newletrucdumilieu;
}
if (K == 1) {
cout << ans + pleindepointtropcool[sz(a) - 1] << '\n';
return 0;
}
while (!gaucheoudroitejesaisplus.empty()) gaucheoudroitejesaisplus.pop();
while(!droiteougauchejesaisplus.empty()) droiteougauchejesaisplus.pop();
letrucdumilieu = a[sz(a) - 1].l;
gaucheoudroitejesaisplus.push(a[sz(a) - 1].l);
droiteougauchejesaisplus.push(a[sz(a) - 1].r);
pleindepointtropcool2[sz(a) - 1] = (a[sz(a) - 1].r - letrucdumilieu);
int best = min(pleindepointtropcool[sz(a) - 1], pleindepointtropcool[sz(a) - 2] + pleindepointtropcool2[sz(a) - 1]);
for (int i(sz(a) - 2); i > 0; i--) {
pleindepointtropcool2[i] = pleindepointtropcool2[i + 1] + abs(a[i].l - letrucdumilieu) + abs(a[i].r - letrucdumilieu);
if (a[i].l > gaucheoudroitejesaisplus.top()) droiteougauchejesaisplus.push(a[i].l);
else gaucheoudroitejesaisplus.push(a[i].l);
if (a[i].r <= gaucheoudroitejesaisplus.top()) gaucheoudroitejesaisplus.push(a[i].r);
else droiteougauchejesaisplus.push(a[i].r);
int szL = sz(gaucheoudroitejesaisplus), szR = sz(droiteougauchejesaisplus);
while (gaucheoudroitejesaisplus.size() > droiteougauchejesaisplus.size()) {
droiteougauchejesaisplus.push(gaucheoudroitejesaisplus.top());
gaucheoudroitejesaisplus.pop();
}
while (gaucheoudroitejesaisplus.size() < droiteougauchejesaisplus.size()) {
gaucheoudroitejesaisplus.push(droiteougauchejesaisplus.top());
droiteougauchejesaisplus.pop();
}
int newletrucdumilieu = gaucheoudroitejesaisplus.top();
if (newletrucdumilieu > letrucdumilieu) {
pleindepointtropcool2[i] += szL * (newletrucdumilieu - letrucdumilieu);
pleindepointtropcool2[i] -= szR * (newletrucdumilieu - letrucdumilieu);
}
else {
pleindepointtropcool2[i] -= (szL - 1) * (letrucdumilieu - newletrucdumilieu);
pleindepointtropcool2[i] += (szR + 1) * (letrucdumilieu - newletrucdumilieu);
}
letrucdumilieu = newletrucdumilieu;
best = min(best, pleindepointtropcool[i - 1] + pleindepointtropcool2[i]);
}
cout << best + ans << '\n';
return 0;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
344 KB |
Output is correct |
2 |
Correct |
0 ms |
348 KB |
Output is correct |
3 |
Correct |
1 ms |
348 KB |
Output is correct |
4 |
Correct |
1 ms |
348 KB |
Output is correct |
5 |
Correct |
1 ms |
348 KB |
Output is correct |
6 |
Correct |
1 ms |
348 KB |
Output is correct |
7 |
Correct |
1 ms |
348 KB |
Output is correct |
8 |
Correct |
1 ms |
348 KB |
Output is correct |
9 |
Correct |
1 ms |
344 KB |
Output is correct |
10 |
Correct |
1 ms |
348 KB |
Output is correct |
11 |
Correct |
1 ms |
356 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
348 KB |
Output is correct |
2 |
Correct |
1 ms |
348 KB |
Output is correct |
3 |
Correct |
1 ms |
348 KB |
Output is correct |
4 |
Correct |
1 ms |
348 KB |
Output is correct |
5 |
Correct |
1 ms |
348 KB |
Output is correct |
6 |
Correct |
1 ms |
348 KB |
Output is correct |
7 |
Correct |
1 ms |
348 KB |
Output is correct |
8 |
Correct |
1 ms |
348 KB |
Output is correct |
9 |
Correct |
1 ms |
344 KB |
Output is correct |
10 |
Correct |
2 ms |
344 KB |
Output is correct |
11 |
Correct |
1 ms |
344 KB |
Output is correct |
12 |
Correct |
45 ms |
8128 KB |
Output is correct |
13 |
Correct |
89 ms |
9400 KB |
Output is correct |
14 |
Correct |
72 ms |
7860 KB |
Output is correct |
15 |
Correct |
60 ms |
5252 KB |
Output is correct |
16 |
Correct |
59 ms |
8232 KB |
Output is correct |
17 |
Correct |
78 ms |
8172 KB |
Output is correct |
18 |
Correct |
66 ms |
9268 KB |
Output is correct |
19 |
Correct |
110 ms |
8684 KB |
Output is correct |
20 |
Correct |
68 ms |
8784 KB |
Output is correct |
21 |
Correct |
78 ms |
8380 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
348 KB |
Output is correct |
2 |
Correct |
0 ms |
348 KB |
Output is correct |
3 |
Correct |
0 ms |
348 KB |
Output is correct |
4 |
Correct |
0 ms |
348 KB |
Output is correct |
5 |
Correct |
0 ms |
348 KB |
Output is correct |
6 |
Correct |
0 ms |
348 KB |
Output is correct |
7 |
Correct |
0 ms |
348 KB |
Output is correct |
8 |
Correct |
0 ms |
348 KB |
Output is correct |
9 |
Correct |
0 ms |
348 KB |
Output is correct |
10 |
Correct |
1 ms |
348 KB |
Output is correct |
11 |
Correct |
0 ms |
348 KB |
Output is correct |
12 |
Correct |
0 ms |
344 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
348 KB |
Output is correct |
2 |
Correct |
1 ms |
348 KB |
Output is correct |
3 |
Correct |
0 ms |
348 KB |
Output is correct |
4 |
Correct |
0 ms |
348 KB |
Output is correct |
5 |
Correct |
0 ms |
348 KB |
Output is correct |
6 |
Correct |
1 ms |
348 KB |
Output is correct |
7 |
Correct |
0 ms |
348 KB |
Output is correct |
8 |
Correct |
0 ms |
348 KB |
Output is correct |
9 |
Correct |
1 ms |
344 KB |
Output is correct |
10 |
Correct |
1 ms |
348 KB |
Output is correct |
11 |
Correct |
1 ms |
348 KB |
Output is correct |
12 |
Correct |
0 ms |
348 KB |
Output is correct |
13 |
Correct |
1 ms |
348 KB |
Output is correct |
14 |
Correct |
1 ms |
348 KB |
Output is correct |
15 |
Correct |
2 ms |
348 KB |
Output is correct |
16 |
Correct |
1 ms |
348 KB |
Output is correct |
17 |
Correct |
1 ms |
344 KB |
Output is correct |
18 |
Correct |
1 ms |
348 KB |
Output is correct |
19 |
Correct |
1 ms |
348 KB |
Output is correct |
20 |
Correct |
1 ms |
348 KB |
Output is correct |
21 |
Correct |
1 ms |
492 KB |
Output is correct |
22 |
Correct |
1 ms |
432 KB |
Output is correct |
23 |
Correct |
1 ms |
344 KB |
Output is correct |
24 |
Correct |
2 ms |
348 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
344 KB |
Output is correct |
2 |
Correct |
1 ms |
348 KB |
Output is correct |
3 |
Correct |
0 ms |
348 KB |
Output is correct |
4 |
Correct |
1 ms |
348 KB |
Output is correct |
5 |
Correct |
1 ms |
504 KB |
Output is correct |
6 |
Correct |
0 ms |
348 KB |
Output is correct |
7 |
Correct |
1 ms |
348 KB |
Output is correct |
8 |
Correct |
0 ms |
348 KB |
Output is correct |
9 |
Correct |
1 ms |
348 KB |
Output is correct |
10 |
Correct |
1 ms |
344 KB |
Output is correct |
11 |
Correct |
1 ms |
600 KB |
Output is correct |
12 |
Correct |
0 ms |
348 KB |
Output is correct |
13 |
Correct |
1 ms |
348 KB |
Output is correct |
14 |
Correct |
1 ms |
348 KB |
Output is correct |
15 |
Correct |
2 ms |
348 KB |
Output is correct |
16 |
Correct |
1 ms |
348 KB |
Output is correct |
17 |
Correct |
1 ms |
344 KB |
Output is correct |
18 |
Correct |
1 ms |
348 KB |
Output is correct |
19 |
Correct |
1 ms |
344 KB |
Output is correct |
20 |
Correct |
1 ms |
348 KB |
Output is correct |
21 |
Correct |
1 ms |
348 KB |
Output is correct |
22 |
Correct |
1 ms |
348 KB |
Output is correct |
23 |
Correct |
1 ms |
460 KB |
Output is correct |
24 |
Correct |
1 ms |
348 KB |
Output is correct |
25 |
Correct |
50 ms |
7872 KB |
Output is correct |
26 |
Correct |
72 ms |
7972 KB |
Output is correct |
27 |
Correct |
100 ms |
8532 KB |
Output is correct |
28 |
Correct |
130 ms |
9152 KB |
Output is correct |
29 |
Correct |
110 ms |
7552 KB |
Output is correct |
30 |
Correct |
59 ms |
4668 KB |
Output is correct |
31 |
Correct |
63 ms |
8372 KB |
Output is correct |
32 |
Correct |
100 ms |
9136 KB |
Output is correct |
33 |
Correct |
93 ms |
8956 KB |
Output is correct |
34 |
Correct |
109 ms |
8984 KB |
Output is correct |
35 |
Correct |
78 ms |
8280 KB |
Output is correct |
36 |
Correct |
99 ms |
8076 KB |
Output is correct |
37 |
Correct |
47 ms |
8188 KB |
Output is correct |