//from duckindog wth depression
#include<bits/stdc++.h>
using namespace std;
#define int long long
const int N = 100'000 + 10;
int k, n;
long long bridge(vector<pair<int, int>> x) {
int n = x.size();
if (!n) return 0;
set<int> pos;
vector<int> a(n + 1), b(n + 1);
for (int i = 1; i <= n; ++i) {
a[i] = x[i - 1].first;
b[i] = x[i - 1].second;
pos.insert(a[i]); pos.insert(b[i]);
}
sort(a.begin(), a.end()); sort(b.begin(), b.end());
vector<long long> da(n + 1), db(n + 1);
for (int i = 1; i <= n; ++i) {
da[i] = da[i - 1] + a[i];
db[i] = db[i - 1] + b[i];
}
auto cal = [&](int i) {
auto itA = upper_bound(a.begin(), a.end(), i) - a.begin() - 1,
itB = upper_bound(b.begin(), b.end(), i) - b.begin() - 1;
long long ret = 0;
ret += 1ll * itA * i - da[itA] + da[n] - da[itA] - 1ll * i * (n - itA);
ret += 1ll * itB * i - db[itB] + db[n] - db[itB] - 1ll * i * (n - itB);
return ret;
};
long long ret = 1'000'000'000'000'000;
for (const auto& i : pos) {
if (i == *pos.begin()) continue;
int l = *prev(pos.lower_bound(i));
int r = i, it = l;
while (l <= r) {
int mid = l + r >> 1;
if (cal(mid) >= cal(mid + 1)) l = it = mid + 1;
else r = mid - 1;
}
ret = min(ret, cal(it));
}
if (n == 1) return abs(a[1] - b[1]);
return ret;
}
pair<int, int> x[N];
int32_t main() {
cin.tie(0)->sync_with_stdio(0);
if (fopen("duck.inp", "r")) {
freopen("duck.inp", "r", stdin);
freopen("duck.out", "w", stdout);
}
cin >> k >> n;
long long answer = 0;
for (int i = 1; i <= n; ++i) {
char A, B;
cin >> A >> x[i].first >> B >> x[i].second;
if (A != B) continue;
answer += abs(x[i].first - x[i].second);
i -= 1; n -= 1;
}
if (!n) {
cout << answer << "\n";
return 0;
}
sort(x + 1, x + n + 1);
if (k == 1) {
cout << bridge(vector<pair<int, int>>(x + 1, x + n + 1)) + answer + n << "\n";
return 0;
}
long long ret = 1'000'000'000'000'000;
for (int i = 1; i <= n; ++i) {
vector<pair<int, int>> lt(x + 1, x + i + 1),
rt(x + i + 1, x + n + 1);
ret = min(ret, bridge(lt) + bridge(rt));
}
cout << ret + answer + n << "\n";
}
Compilation message
bridge.cpp: In function 'long long int bridge(std::vector<std::pair<long long int, long long int> >)':
bridge.cpp:45:19: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
45 | int mid = l + r >> 1;
| ~~^~~
bridge.cpp: In function 'int32_t main()':
bridge.cpp:61:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
61 | freopen("duck.inp", "r", stdin);
| ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
bridge.cpp:62:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
62 | freopen("duck.out", "w", stdout);
| ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
# |
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 |
1 ms |
348 KB |
Output is correct |
4 |
Correct |
2 ms |
604 KB |
Output is correct |
5 |
Correct |
3 ms |
604 KB |
Output is correct |
6 |
Correct |
0 ms |
348 KB |
Output is correct |
7 |
Correct |
4 ms |
604 KB |
Output is correct |
8 |
Correct |
1 ms |
600 KB |
Output is correct |
9 |
Correct |
2 ms |
604 KB |
Output is correct |
10 |
Correct |
1 ms |
348 KB |
Output is correct |
11 |
Correct |
1 ms |
604 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
348 KB |
Output is correct |
2 |
Correct |
0 ms |
348 KB |
Output is correct |
3 |
Correct |
1 ms |
344 KB |
Output is correct |
4 |
Correct |
2 ms |
604 KB |
Output is correct |
5 |
Correct |
3 ms |
604 KB |
Output is correct |
6 |
Correct |
1 ms |
348 KB |
Output is correct |
7 |
Correct |
3 ms |
604 KB |
Output is correct |
8 |
Correct |
1 ms |
604 KB |
Output is correct |
9 |
Correct |
2 ms |
604 KB |
Output is correct |
10 |
Correct |
1 ms |
348 KB |
Output is correct |
11 |
Correct |
1 ms |
604 KB |
Output is correct |
12 |
Correct |
19 ms |
6492 KB |
Output is correct |
13 |
Correct |
302 ms |
16112 KB |
Output is correct |
14 |
Correct |
43 ms |
6492 KB |
Output is correct |
15 |
Correct |
169 ms |
9560 KB |
Output is correct |
16 |
Correct |
23 ms |
6540 KB |
Output is correct |
17 |
Correct |
261 ms |
16112 KB |
Output is correct |
18 |
Correct |
126 ms |
16116 KB |
Output is correct |
19 |
Correct |
199 ms |
15416 KB |
Output is correct |
20 |
Correct |
24 ms |
6744 KB |
Output is correct |
21 |
Correct |
123 ms |
16040 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 |
1 ms |
348 KB |
Output is correct |
4 |
Incorrect |
16 ms |
496 KB |
Output isn't correct |
5 |
Halted |
0 ms |
0 KB |
- |
# |
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 |
1 ms |
348 KB |
Output is correct |
4 |
Incorrect |
17 ms |
344 KB |
Output isn't correct |
5 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
344 KB |
Output is correct |
2 |
Correct |
1 ms |
344 KB |
Output is correct |
3 |
Correct |
1 ms |
348 KB |
Output is correct |
4 |
Incorrect |
17 ms |
348 KB |
Output isn't correct |
5 |
Halted |
0 ms |
0 KB |
- |