oj.uz

Submission #332941

# Submission time Handle Problem Language Result Execution time Memory
332941 2020-12-04T03:24:06 Z Cantfindme Palembang Bridges (APIO15_bridge) C++17
100 / 100
 175 ms 10332 KB 
#include <bits/stdc++.h>
using namespace std;
#define int long long
typedef pair<int,int> pi;
#define f first
#define s second
#define FAST ios_base::sync_with_stdio(0); cin.tie(0);
typedef pair<int, pi> pii;
#define all(x) x.begin(),x.end()

const int maxn = 100010;
const int INF = LLONG_MAX/2;

//If K=1, take median of all points X and Y independently
//Take b_left if x + y < b_right + b_left else take b_right
//Just have to find splitting point 
//If unoptimal (take wrong bridge in wrong group) then whatever.

int pref[maxn];
int suf[maxn];
int k, n;
int bonus;

vector <pi> v;
pi pos[maxn];

priority_queue <int> q1;
priority_queue <int,vector<int>,greater<int>> q2;

int q1sum, q2sum;

void movee(int opt) {
	if (opt and !q1.empty()) {
		int x = q1.top();
		q1.pop();
		q2.push(x);
		q1sum -= x;
		q2sum += x;
	} else if (!opt and !q2.empty()) {
		int x = q2.top();
		q2.pop();
		q1.push(x);
		q2sum -= x;
		q1sum += x;
	}
}

int findMed() {
	if (q1.size() == 0 and q2.size() == 0) return 0;
	if (q1.size() >= q2.size()) {
		return q1.top();
	} else {
		return q2.top();
	}
}

void check() {
	if ((int)q1.size() > (int)q2.size() + 1) movee(1);
	else if ((int)q2.size() > (int)q1.size() + 1) movee(0);
}

void insert(int x) {
	int med = findMed();
	if (x > med) {
		q2.push(x);
		q2sum += x;
	} else {
		q1.push(x);
		q1sum += x;
	}
	check();
}

int32_t main() {
	cin >> k >> n;
	for (int i =0;i<n;i++) {
		char a,b; cin >> a >> pos[i].f >> b >> pos[i].s;
		if (a == b) bonus += abs(pos[i].f - pos[i].s);
		else {
			v.push_back(pi(pos[i].f+pos[i].s,i));
		}
	}
	
	sort(all(v));
	for (int i =0;i<(int)v.size();i++) {
		int x = pos[v[i].s].f, y = pos[v[i].s].s;
		insert(x);
		insert(y);
		int med = findMed();
		pref[i] = (q2sum - med * q2.size()) + (med * q1.size() - q1sum);
	}

	if (k == 1) {
		cout << pref[v.size()-1] + bonus + (int)v.size();
		return 0;
	}
	
	while (!q1.empty()) q1.pop();
	while (!q2.empty()) q2.pop();
	q1sum = q2sum = 0;
	for (int i =(int)v.size()-1;i>=0;i--) {
		int x = pos[v[i].s].f, y = pos[v[i].s].s;
		insert(x);
		insert(y);
		int med = findMed();
		suf[i] = (q2sum - med * q2.size()) + (med * q1.size() - q1sum);
	}

	int ans = suf[0] + bonus + (int) v.size();
	for (int i =0;i<(int)v.size();i++) {
		ans = min(ans, pref[i] + suf[i+1] + bonus + (int)v.size());
	}
	
	cout << ans;
}

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 2 ms 364 KB Output is correct
5 Correct 2 ms 364 KB Output is correct
6 Correct 2 ms 364 KB Output is correct
7 Correct 2 ms 364 KB Output is correct
8 Correct 4 ms 364 KB Output is correct
9 Correct 2 ms 364 KB Output is correct
10 Correct 2 ms 364 KB Output is correct
11 Correct 2 ms 364 KB Output is correct

Subtask #2
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 2 ms 364 KB Output is correct
5 Correct 2 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 2 ms 364 KB Output is correct
8 Correct 2 ms 364 KB Output is correct
9 Correct 2 ms 364 KB Output is correct
10 Correct 2 ms 364 KB Output is correct
11 Correct 2 ms 364 KB Output is correct
12 Correct 66 ms 7900 KB Output is correct
13 Correct 143 ms 9592 KB Output is correct
14 Correct 95 ms 7516 KB Output is correct
15 Correct 76 ms 5728 KB Output is correct
16 Correct 89 ms 8924 KB Output is correct
17 Correct 123 ms 9608 KB Output is correct
18 Correct 105 ms 9180 KB Output is correct
19 Correct 127 ms 9564 KB Output is correct
20 Correct 109 ms 9052 KB Output is correct
21 Correct 119 ms 9308 KB Output is correct

Subtask #3
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 1 ms 364 KB Output is correct
12 Correct 1 ms 364 KB Output is correct

Subtask #4
32.0 / 32.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 1 ms 364 KB Output is correct
12 Correct 1 ms 364 KB Output is correct
13 Correct 1 ms 364 KB Output is correct
14 Correct 2 ms 364 KB Output is correct
15 Correct 2 ms 492 KB Output is correct
16 Correct 1 ms 364 KB Output is correct
17 Correct 1 ms 364 KB Output is correct
18 Correct 1 ms 364 KB Output is correct
19 Correct 2 ms 492 KB Output is correct
20 Correct 2 ms 492 KB Output is correct
21 Correct 2 ms 364 KB Output is correct
22 Correct 2 ms 492 KB Output is correct
23 Correct 2 ms 492 KB Output is correct
24 Correct 2 ms 364 KB Output is correct

Subtask #5
37.0 / 37.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 1 ms 492 KB Output is correct
10 Correct 1 ms 380 KB Output is correct
11 Correct 1 ms 364 KB Output is correct
12 Correct 1 ms 364 KB Output is correct
13 Correct 1 ms 364 KB Output is correct
14 Correct 2 ms 364 KB Output is correct
15 Correct 2 ms 492 KB Output is correct
16 Correct 1 ms 364 KB Output is correct
17 Correct 1 ms 364 KB Output is correct
18 Correct 1 ms 364 KB Output is correct
19 Correct 2 ms 492 KB Output is correct
20 Correct 2 ms 492 KB Output is correct
21 Correct 2 ms 364 KB Output is correct
22 Correct 2 ms 492 KB Output is correct
23 Correct 2 ms 492 KB Output is correct
24 Correct 2 ms 364 KB Output is correct
25 Correct 84 ms 8796 KB Output is correct
26 Correct 131 ms 8668 KB Output is correct
27 Correct 159 ms 9692 KB Output is correct
28 Correct 171 ms 10332 KB Output is correct
29 Correct 175 ms 9820 KB Output is correct
30 Correct 92 ms 5344 KB Output is correct
31 Correct 100 ms 9692 KB Output is correct
32 Correct 147 ms 10332 KB Output is correct
33 Correct 122 ms 9948 KB Output is correct
34 Correct 161 ms 10280 KB Output is correct
35 Correct 122 ms 9820 KB Output is correct
36 Correct 143 ms 10076 KB Output is correct
37 Correct 84 ms 8796 KB Output is correct