#include <bits/stdc++.h>
using namespace std;
#define Task "APIO15_bridge"
#define int long long
#define fi first
#define se second
#define pb push_back
#define mp make_pair
#define foru(i, l, r) for(int i = l; i <= r; i++)
#define ford(i, r, l) for(int i = r; i >= l; i--)
#define __TIME (1.0 * clock() / CLOCKS_PER_SEC)
#define sz(v) ((int)(v).size())
typedef pair<int, int> ii;
typedef pair<ii, int> iii;
typedef pair<ii, ii> iiii;
const int MAXN = 1e6+5;
const int mod = 1e9 + 7;
int K, N, M;
long long D[MAXN], E[MAXN];
struct Z {
int a, b;
} A[MAXN];
void proc(long long V[])
{
if (!N) return;
long long val = abs(A[1].a - A[1].b);
priority_queue <int> p, q;
int mid = A[1].a;
if (A[1].b < mid) p.push(A[1].b);
else q.push(-A[1].b);
V[1] = val;
for (int i = 2; i <= N; i++) {
val += abs(mid - A[i].a) + abs(mid - A[i].b);
if (A[i].a < mid) p.push(A[i].a);
else q.push(-A[i].a);
if (A[i].b < mid) p.push(A[i].b);
else q.push(-A[i].b);
while (sz(p) < sz(q)) {
int nxt = -q.top(); q.pop();
p.push(mid);
val += (long long)(nxt - mid) * sz(p) - (long long)(nxt - mid) * (sz(q) + 1);
mid = nxt;
}
while (sz(p) > sz(q) + 1) {
int nxt = p.top(); p.pop();
q.push(-mid);
val += (long long)(mid - nxt) * sz(q) - (long long)(mid - nxt) * (sz(p) + 1);
mid = nxt;
}
V[i] = val;
}
}
int process() {
cin >> K >> M;
vector <int> arr;
long long def = 0;
while (M--) {
char p, q; int a, b;
cin >> p >> a >> q >> b;
if (p == q) { def += abs(a - b); continue; }
A[++N] = {a, b};
}
sort(A + 1, A + N + 1, [](const Z & a, const Z & b) {
return a.a + a.b < b.a + b.b;
});
proc(D);
if (K == 1) { cout << D[N] + def + N; return 0; }
reverse(A + 1, A + N + 1);
proc(E);
long long ans = 1e18;
for (int i = 0; i <= N; i++) ans = min(ans, def + D[i] + E[N - i] + N);
cout << ans;
}
signed main() {
cin.tie(0)->sync_with_stdio(false);
if (fopen(Task".INP", "r")) {
freopen(Task".INP", "r", stdin);
freopen(Task".OUT", "w", stdout);
}
process();
cerr << "Time elapsed: " << __TIME << " s.\n";
return 0;
}
// dont stop
Compilation message
bridge.cpp: In function 'long long int process()':
bridge.cpp:63:15: warning: control reaches end of non-void function [-Wreturn-type]
63 | vector <int> arr;
| ^~~
bridge.cpp: In function 'int main()':
bridge.cpp:86:10: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
86 | freopen(Task".INP", "r", stdin);
| ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
bridge.cpp:87:10: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
87 | freopen(Task".OUT", "w", stdout);
| ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~
# |
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 |
2396 KB |
Output is correct |
4 |
Correct |
1 ms |
2396 KB |
Output is correct |
5 |
Correct |
1 ms |
2392 KB |
Output is correct |
6 |
Correct |
1 ms |
2396 KB |
Output is correct |
7 |
Correct |
2 ms |
2396 KB |
Output is correct |
8 |
Correct |
1 ms |
2396 KB |
Output is correct |
9 |
Correct |
1 ms |
2396 KB |
Output is correct |
10 |
Correct |
1 ms |
2396 KB |
Output is correct |
11 |
Correct |
1 ms |
2396 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 |
2520 KB |
Output is correct |
4 |
Correct |
1 ms |
2396 KB |
Output is correct |
5 |
Correct |
1 ms |
2396 KB |
Output is correct |
6 |
Correct |
1 ms |
2396 KB |
Output is correct |
7 |
Correct |
1 ms |
2396 KB |
Output is correct |
8 |
Correct |
1 ms |
2396 KB |
Output is correct |
9 |
Correct |
1 ms |
2396 KB |
Output is correct |
10 |
Correct |
1 ms |
2396 KB |
Output is correct |
11 |
Correct |
1 ms |
2396 KB |
Output is correct |
12 |
Correct |
18 ms |
6352 KB |
Output is correct |
13 |
Correct |
34 ms |
6284 KB |
Output is correct |
14 |
Correct |
27 ms |
6196 KB |
Output is correct |
15 |
Correct |
23 ms |
5648 KB |
Output is correct |
16 |
Correct |
17 ms |
6392 KB |
Output is correct |
17 |
Correct |
30 ms |
6352 KB |
Output is correct |
18 |
Correct |
24 ms |
6352 KB |
Output is correct |
19 |
Correct |
33 ms |
6352 KB |
Output is correct |
20 |
Correct |
23 ms |
6596 KB |
Output is correct |
21 |
Correct |
31 ms |
6352 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Runtime error |
3 ms |
604 KB |
Execution killed with signal 11 |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Runtime error |
3 ms |
604 KB |
Execution killed with signal 11 |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Runtime error |
3 ms |
604 KB |
Execution killed with signal 11 |
2 |
Halted |
0 ms |
0 KB |
- |