oj.uz

Submission #39515

# Submission time Handle Problem Language Result Execution time Memory
39515 2018-01-16T09:09:46 Z qoo2p5 Palembang Bridges (APIO15_bridge) C++14
0 / 100
 9 ms 4696 KB 
#include <bits/stdc++.h>

using namespace std;

typedef long long ll;

const int INF = (int) 1e9 + 123;
const ll LINF = (ll) 1e18 + 123;

#define rep(i, s, t) for (auto i = (s); i < (t); ++(i))
#define per(i, s, t) for (auto i = (s); i >= (t); --(i))
#define sz(x) ((int) (x).size())
#define mp make_pair
#define pb push_back
#define all(x) (x).begin(), (x).end()

bool mini(auto &x, const auto &y) {
	if (y < x) {
		x = y;
		return 1;
	}
	return 0;
}

bool maxi(auto &x, const auto &y) {
	if (y < x) {
		x = y;
		return 1;
	}
	return 0;
}

void run();

int main() {
	ios::sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);
	run();
	return 0;
}

const int N = (int) 1e5 + 123;

struct Fenwick {
	unordered_map<int, ll> f;
	
	void add(int x, ll y) {
		x++;
		for (; x < INF; x += x & (-x)) {
			f[x] += y;
		}
	}
	
	ll get(int r) {
		ll res = 0;
		r++;
		for (; r > 0; r -= r & (-r)) {
			if (f.count(r)) res += f[r];
		}
		return res;
	}
	
	ll get(int l, int r) {
		return get(r) - get(l - 1);
	}
};

int k, n;
vector<pair<ll, ll>> a;
vector<ll> cool;
ll total;
ll pref[N], suff[N];

void solve1() {
	/*vector<ll> p;
	{
		for (auto &it : a) {
			p.pb(it.first);
			p.pb(it.second);
		}
		sort(all(p));
	}
	
	int k = sz(p) / 2;
	ll x = p[k];
	ll ans = 0;
	for (ll y : p) ans += abs(x - y);*/	{
		multiset<ll> q;
		Fenwick f_sum, f_cnt;
		rep(i, 0, n) {
			f_sum.add(a[i].first, a[i].first);
			f_cnt.add(a[i].first, 1);
			f_sum.add(a[i].second, a[i].second);
			f_cnt.add(a[i].second, 1);
			
			q.insert(a[i].first);
			q.insert(a[i].second);
			while (sz(q) > i + 1) {
				q.erase(q.find(*q.rbegin()));
			}
			ll mid = *q.rbegin();
			ll sum_l = f_sum.get(0, mid);
			ll sum_r = f_sum.get(mid + 1, INF);
			ll cnt_l = f_cnt.get(0, mid);
			ll cnt_r = f_cnt.get(mid + 1, INF);
			pref[i] = (mid * cnt_l - sum_l) + (sum_r - mid * cnt_r);
		}
	}
	ll ans = pref[n - 1];
	
	ans += total;
	cout << ans << "\n";
}

ll solve() {
	sort(all(a), [] (const pair<ll, ll> &x, const pair<ll, ll> &y) {
		return x.first + x.second < y.first + y.second;
	});
	
	{
		multiset<ll> q;
		Fenwick f_sum, f_cnt;
		rep(i, 0, n) {
			f_sum.add(a[i].first, a[i].first);
			f_cnt.add(a[i].first, 1);
			f_sum.add(a[i].second, a[i].second);
			f_cnt.add(a[i].second, 1);
			
			q.insert(a[i].first);
			q.insert(a[i].second);
			while (sz(q) > i + 1) {
				q.erase(q.find(*q.rbegin()));
			}
			ll mid = *q.rbegin();
			ll sum_l = f_sum.get(0, mid);
			ll sum_r = f_sum.get(mid + 1, INF);
			ll cnt_l = f_cnt.get(0, mid);
			ll cnt_r = f_cnt.get(mid + 1, INF);
			pref[i] = (mid * cnt_l - sum_l) + (sum_r - mid * cnt_r);
		}
	}
	
	{
		multiset<ll> q;
		Fenwick f_sum, f_cnt;
		per(i, n - 1, 0) {
			f_sum.add(a[i].first, a[i].first);
			f_cnt.add(a[i].first, 1);
			f_sum.add(a[i].second, a[i].second);
			f_cnt.add(a[i].second, 1);
			
			q.insert(a[i].first);
			q.insert(a[i].second);
			while (sz(q) > n - i) {
				q.erase(q.find(*q.rbegin()));
			}
			ll mid = *q.rbegin();
			ll sum_l = f_sum.get(0, mid);
			ll sum_r = f_sum.get(mid + 1, INF);
			ll cnt_l = f_cnt.get(0, mid);
			ll cnt_r = f_cnt.get(mid + 1, INF);
			suff[i] = (mid * cnt_l - sum_l) + (sum_r - mid * cnt_r);
		}
	}
	
	ll ans = suff[0];
	rep(i, 0, n) {
		mini(ans, pref[i] + suff[i + 1]);
	}
	return ans;
}

void run() {
	cin >> k >> n;
	rep(i, 0, n) {
		char t1, t2;
		ll x1, x2;
		cin >> t1 >> x1 >> t2 >> x2;
		if (t1 == t2) {
			total += abs(x1 - x2);
		} else {
			if (x1 > x2) {
				swap(t1, t2);
				swap(x1, x2);
			}
			a.pb({x1, x2});
			cool.pb(x1);
			cool.pb(x2);
		}
	}
	sort(all(cool));
	cool.resize(unique(all(cool)) - cool.begin());
	sort(all(a));
	n = sz(a);
	total += n;
	if (k == 1) {
		solve1();
		return;
	}
	if (n == 0) {
		cout << total << "\n";
		return;
	}
	
	ll ans = solve();
	
	ans += total;
	cout << ans << "\n";
}

Subtask #1
0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 3760 KB Output is correct
2 Correct 0 ms 3760 KB Output is correct
3 Correct 3 ms 3760 KB Output is correct
4 Incorrect 6 ms 4696 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #2
0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 3760 KB Output is correct
2 Correct 0 ms 3760 KB Output is correct
3 Correct 3 ms 3760 KB Output is correct
4 Incorrect 9 ms 4696 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #3
0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 3760 KB Output is correct
2 Correct 0 ms 3760 KB Output is correct
3 Correct 0 ms 3760 KB Output is correct
4 Incorrect 0 ms 3892 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #4
0 / 32.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 3760 KB Output is correct
2 Correct 0 ms 3760 KB Output is correct
3 Correct 0 ms 3760 KB Output is correct
4 Incorrect 3 ms 3892 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #5
0 / 37.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 3760 KB Output is correct
2 Correct 0 ms 3760 KB Output is correct
3 Correct 0 ms 3760 KB Output is correct
4 Incorrect 0 ms 3892 KB Output isn't correct
5 Halted 0 ms 0 KB -