Submission #953353

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
953353	2024-03-25T20:56:32 Z	seriouslyFlawed	Palembang Bridges (APIO15_bridge)	C++17	100 / 100	77 ms	5652 KB

bridge

#include <bits/stdc++.h>
#define FOR(i, x, y) for (int i = x; i < y; i++)
typedef long long ll;
using namespace std;

bool cmp(pair<int, int> a, pair<int, int> b) {
	return a.first + a.second < b.first + b.second;
}

priority_queue<int> lpq;
priority_queue<int, vector<int>, greater<int>> rpq;
ll lsum, rsum;

void insert(int x) {
	int median = (lpq.size() ? lpq.top() : 1000000001);
	if (x <= median) {
		lpq.push(x);
		lsum += x;
	} else {
		rpq.push(x);
		rsum += x;
	}

	if (rpq.size() + 1 < lpq.size()) {
		int nxt = lpq.top();
		lpq.pop();
		rpq.push(nxt);
		lsum -= nxt;
		rsum += nxt;
	} else if (lpq.size() < rpq.size()) {
		int nxt = rpq.top();
		rpq.pop();
		lpq.push(nxt);
		rsum -= nxt;
		lsum += nxt;
	}
}

ll pref[100001];

int main() {
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	int k, n;
	ll same_side = 0;
	vector<pair<int, int>> v = {{0, 0}};
	cin >> k >> n;
	FOR(i, 0, n) {
		char a, b;
		int x, y;
		cin >> a >> x >> b >> y;
		if (a == b) same_side += abs(x - y);
		else v.push_back({x, y});
	}
	sort(v.begin(), v.end(), cmp);
	n = v.size() - 1;
	same_side += n;

	lsum = rsum = 0;
	FOR(i, 1, n + 1) {
		insert(v[i].first);
		insert(v[i].second);
		pref[i] = rsum - lsum;
	}

	ll ans = pref[n];

	if (k == 2) {
		while (lpq.size()) lpq.pop();
		while (rpq.size()) rpq.pop();
		lsum = rsum = 0;

		for (int i = n; i; i--) {
			insert(v[i].first);
			insert(v[i].second);
			ans = min(ans, rsum - lsum + pref[i - 1]);
		}
	}
	cout << same_side + ans;
	return 0;
}

Subtask #1
8.0 / 8.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	348 KB	Output is correct
2	Correct	0 ms	468 KB	Output is correct
3	Correct	1 ms	348 KB	Output is correct
4	Correct	1 ms	476 KB	Output is correct
5	Correct	1 ms	344 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	348 KB	Output is correct
10	Correct	1 ms	348 KB	Output is correct
11	Correct	1 ms	348 KB	Output is correct

Subtask #2
14.0 / 14.0

#	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	Correct	1 ms	348 KB	Output is correct
5	Correct	1 ms	472 KB	Output is correct
6	Correct	1 ms	344 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	480 KB	Output is correct
11	Correct	1 ms	348 KB	Output is correct
12	Correct	20 ms	4004 KB	Output is correct
13	Correct	42 ms	5584 KB	Output is correct
14	Correct	33 ms	4564 KB	Output is correct
15	Correct	24 ms	3536 KB	Output is correct
16	Correct	25 ms	4820 KB	Output is correct
17	Correct	33 ms	5324 KB	Output is correct
18	Correct	33 ms	5324 KB	Output is correct
19	Correct	38 ms	5448 KB	Output is correct
20	Correct	28 ms	5576 KB	Output is correct
21	Correct	36 ms	5196 KB	Output is correct

Subtask #3
9.0 / 9.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	344 KB	Output is correct
2	Correct	0 ms	348 KB	Output is correct
3	Correct	0 ms	472 KB	Output is correct
4	Correct	1 ms	348 KB	Output is correct
5	Correct	1 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	1 ms	348 KB	Output is correct
10	Correct	0 ms	348 KB	Output is correct
11	Correct	1 ms	348 KB	Output is correct
12	Correct	0 ms	348 KB	Output is correct

Subtask #4
32.0 / 32.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	348 KB	Output is correct
2	Correct	1 ms	468 KB	Output is correct
3	Correct	1 ms	464 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	444 KB	Output is correct
12	Correct	1 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	1 ms	348 KB	Output is correct
16	Correct	1 ms	348 KB	Output is correct
17	Correct	1 ms	348 KB	Output is correct
18	Correct	1 ms	344 KB	Output is correct
19	Correct	1 ms	348 KB	Output is correct
20	Correct	1 ms	344 KB	Output is correct
21	Correct	1 ms	344 KB	Output is correct
22	Correct	1 ms	476 KB	Output is correct
23	Correct	1 ms	348 KB	Output is correct
24	Correct	1 ms	348 KB	Output is correct

Subtask #5
37.0 / 37.0

#	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	356 KB	Output is correct
7	Correct	0 ms	356 KB	Output is correct
8	Correct	0 ms	356 KB	Output is correct
9	Correct	0 ms	356 KB	Output is correct
10	Correct	0 ms	356 KB	Output is correct
11	Correct	1 ms	356 KB	Output is correct
12	Correct	0 ms	356 KB	Output is correct
13	Correct	1 ms	356 KB	Output is correct
14	Correct	1 ms	348 KB	Output is correct
15	Correct	1 ms	360 KB	Output is correct
16	Correct	0 ms	360 KB	Output is correct
17	Correct	1 ms	352 KB	Output is correct
18	Correct	1 ms	360 KB	Output is correct
19	Correct	1 ms	352 KB	Output is correct
20	Correct	1 ms	420 KB	Output is correct
21	Correct	1 ms	356 KB	Output is correct
22	Correct	1 ms	360 KB	Output is correct
23	Correct	1 ms	604 KB	Output is correct
24	Correct	1 ms	360 KB	Output is correct
25	Correct	29 ms	3924 KB	Output is correct
26	Correct	54 ms	4564 KB	Output is correct
27	Correct	68 ms	5076 KB	Output is correct
28	Correct	77 ms	5652 KB	Output is correct
29	Correct	71 ms	5532 KB	Output is correct
30	Correct	36 ms	2780 KB	Output is correct
31	Correct	32 ms	4520 KB	Output is correct
32	Correct	56 ms	4972 KB	Output is correct
33	Correct	54 ms	4816 KB	Output is correct
34	Correct	68 ms	5068 KB	Output is correct
35	Correct	39 ms	5068 KB	Output is correct
36	Correct	56 ms	5068 KB	Output is correct
37	Correct	23 ms	3772 KB	Output is correct

Submission #953353

Compilation message

Subtask #1 8.0 / 8.0

Subtask #2 14.0 / 14.0

Subtask #3 9.0 / 9.0

Subtask #4 32.0 / 32.0

Subtask #5 37.0 / 37.0

Subtask #1
8.0 / 8.0

Subtask #2
14.0 / 14.0

Subtask #3
9.0 / 9.0

Subtask #4
32.0 / 32.0

Subtask #5
37.0 / 37.0