oj.uz

Submission #915734

# Submission time Handle Problem Language Result Execution time Memory
915734 2024-01-24T15:56:29 Z perohero Palembang Bridges (APIO15_bridge) C++17
100 / 100
 71 ms 6592 KB 
#include <iostream>
#include <complex>
#include <vector>
#include <string>
#include <algorithm>
#include <cstdio>
#include <numeric>
#include <cstring>
#include <ctime>
#include <cstdlib>
#include <set>
#include <map>
#include <unordered_map>
#include <unordered_set>
#include <list>
#include <cmath>
#include <bitset>
#include <cassert>
#include <queue>
#include <stack>
#include <deque>
#include <random>
 
using namespace std;
template<typename T1, typename T2> inline void chkmin(T1 &a, T2 b) {if (a > b) a = b;}
template<typename T1, typename T2> inline void chkmax(T1 &a, T2 b) {if (a < b) a = b;}
#define files(FILENAME) read(FILENAME); write(FILENAME)
#define read(FILENAME) freopen((FILENAME + ".in").c_str(), "r", stdin)
#define write(FILENAME) freopen((FILENAME + ".out").c_str(), "w", stdout)
#define all(c) (c).begin(), (c).end()
#define sz(c) (int)(c).size()
#define left left228
#define right right228
#define y1 y1228
#define mp make_pair
#define pb push_back
#define y2 y2228
#define rank rank228
using ll = long long;
using ld = long double; 
const string FILENAME = "input";
 
int main() {
	ios_base::sync_with_stdio(false);
	cin.tie(0);
	cout.tie(0);
	//read(FILENAME);
	int k, n;
	cin >> k >> n;
	ll add = 0;
	vector<pair<int, int>> v;
	vector<int> points;
	int cnt = 0;
	for (int i = 1; i <= n; i++) {
		char p, q;
		int s, t;
		cin >> p >> s >> q >> t;
		if (p == q) {
			add += abs(s - t);
		} else {
			points.pb(s);
			points.pb(t);
			v.pb(mp(s, t));
			cnt++;
		}
	}
	if (k == 1) {
		sort(all(points));
		auto f = [&](int bridge) {
			ll res = 0;
			for (auto i: points) {
				res += abs(i - bridge);
			}
			res += cnt;
			return res;
		};
		
		int med = (sz(points) + 1) / 2;
		cout << f(points[med - 1]) + add << '\n';
	} else {
		sort(all(v), [&](pair<int, int> a, pair<int, int> b) {
			return a.first + a.second < b.first + b.second;
		});		
		priority_queue<int> pql;
		priority_queue<int, vector<int>, greater<int>> pqr;
		ll lsum = 0, rsum = 0;
		auto insert = [&](int x) {
			int med = (pql.size() ? pql.top() : 1e9 + 10);
			if (x <= med) {
				pql.push(x);
				lsum += x;
			} else {
				pqr.push(x);
				rsum += x;
			}
			
			if (pqr.size() + 1 < pql.size()) {
				int nxt = pql.top();
				pql.pop();
				pqr.push(nxt);
				lsum -= nxt;
				rsum += nxt;
			} else if (pql.size() < pqr.size()) {
				int nxt = pqr.top();
				pqr.pop();
				pql.push(nxt);
				rsum -= nxt;
				lsum += nxt;
			}
		};
		vector<ll> pref(sz(v) + 1);
		for (int i = 1; i <= sz(v); i++) {
			insert(v[i - 1].first);
			insert(v[i - 1].second);
			pref[i] = rsum - lsum;
		}
		while (!pql.empty()) {
			pql.pop();
		}
		while (!pqr.empty()) {
			pqr.pop();
		}
		lsum = 0;
		rsum = 0;
		ll ans = pref[sz(v)];
		for (int i = sz(v); i >= 1; i--) {
			insert(v[i - 1].first);
			insert(v[i - 1].second);
			chkmin(ans, rsum - lsum + pref[i - 1]);
		}
		cout << ans + add + cnt << '\n';
	}
	return 0;
}

Subtask #1
8.0 / 8.0

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

Subtask #2
14.0 / 14.0

# 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 348 KB Output is correct
4 Correct 1 ms 348 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
12 Correct 16 ms 2248 KB Output is correct
13 Correct 34 ms 2084 KB Output is correct
14 Correct 23 ms 2252 KB Output is correct
15 Correct 21 ms 1616 KB Output is correct
16 Correct 20 ms 2244 KB Output is correct
17 Correct 24 ms 2236 KB Output is correct
18 Correct 26 ms 2068 KB Output is correct
19 Correct 30 ms 2244 KB Output is correct
20 Correct 21 ms 2248 KB Output is correct
21 Correct 27 ms 2248 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 600 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 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 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 1 ms 604 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct

Subtask #4
32.0 / 32.0

# 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 1 ms 344 KB Output is correct
5 Correct 0 ms 452 KB Output is correct
6 Correct 1 ms 600 KB Output is correct
7 Correct 0 ms 344 KB Output is correct
8 Correct 1 ms 600 KB Output is correct
9 Correct 1 ms 600 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 1 ms 344 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 344 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 1 ms 460 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 344 KB Output is correct
22 Correct 1 ms 348 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 1 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 1 ms 452 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 1 ms 348 KB Output is correct
11 Correct 1 ms 348 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 464 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 348 KB Output is correct
19 Correct 1 ms 468 KB Output is correct
20 Correct 1 ms 352 KB Output is correct
21 Correct 1 ms 348 KB Output is correct
22 Correct 1 ms 352 KB Output is correct
23 Correct 1 ms 464 KB Output is correct
24 Correct 1 ms 348 KB Output is correct
25 Correct 29 ms 4808 KB Output is correct
26 Correct 54 ms 5184 KB Output is correct
27 Correct 69 ms 5820 KB Output is correct
28 Correct 70 ms 6592 KB Output is correct
29 Correct 71 ms 6332 KB Output is correct
30 Correct 38 ms 3536 KB Output is correct
31 Correct 34 ms 5824 KB Output is correct
32 Correct 64 ms 6356 KB Output is correct
33 Correct 56 ms 6164 KB Output is correct
34 Correct 59 ms 6336 KB Output is correct
35 Correct 37 ms 6340 KB Output is correct
36 Correct 60 ms 6080 KB Output is correct
37 Correct 27 ms 4808 KB Output is correct