oj.uz

Submission #39473

# Submission time Handle Problem Language Result Execution time Memory
39473 2018-01-15T16:26:53 Z qoo2p5 Palembang Bridges (APIO15_bridge) C++14
22 / 100
 126 ms 14512 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;

int k, n;
vector<pair<ll, ll>> a;
vector<ll> cool;
ll total;

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);
	
	ans += total;
	cout << ans << "\n";
}

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 (t1 > t2) {
				swap(t1, t2);
				swap(x1, x2);
			}
			a.pb({x1, x2});
			cool.pb(x1);
			cool.pb(x2);
		}
	}
	sort(all(cool));
	vector<ll> tmp;
	rep(i, 0, sz(cool) - 1) tmp.pb((cool[i] + cool[i + 1]) / 2);
	for (ll x : tmp) cool.pb(x);
	sort(all(cool));
	cool.resize(unique(all(cool)) - cool.begin());
	sort(all(a));
	n = sz(a);
	total += n;
	if (k == 1) {
		solve1();
		return;
	}
	
	ll ans = LINF;
	
	for (ll x1 : cool) {
		for (ll x2 : cool) {
			ll cur = 0;
			
			for (auto &it : a) {
				ll best = LINF;
				mini(best, abs(it.first - x1) + abs(it.second - x1));
				mini(best, abs(it.first - x2) + abs(it.second - x2));
				cur += best;
			}
			
			mini(ans, cur);
		}
	}
	
	ans += total;
	cout << ans << "\n";
}

Subtask #1
8.0 / 8.0

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

Subtask #2
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 2180 KB Output is correct
2 Correct 0 ms 2180 KB Output is correct
3 Correct 0 ms 2312 KB Output is correct
4 Correct 0 ms 2312 KB Output is correct
5 Correct 0 ms 2312 KB Output is correct
6 Correct 0 ms 2312 KB Output is correct
7 Correct 0 ms 2312 KB Output is correct
8 Correct 0 ms 2312 KB Output is correct
9 Correct 0 ms 2312 KB Output is correct
10 Correct 0 ms 2312 KB Output is correct
11 Correct 0 ms 2312 KB Output is correct
12 Correct 43 ms 14512 KB Output is correct
13 Correct 126 ms 14512 KB Output is correct
14 Correct 93 ms 14512 KB Output is correct
15 Correct 66 ms 8368 KB Output is correct
16 Correct 39 ms 14512 KB Output is correct
17 Correct 93 ms 14512 KB Output is correct
18 Correct 109 ms 14512 KB Output is correct
19 Correct 106 ms 14512 KB Output is correct
20 Correct 43 ms 14512 KB Output is correct
21 Correct 96 ms 14512 KB Output is correct

Subtask #3
0 / 9.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 2180 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 32.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 2180 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 37.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 2180 KB Output isn't correct
2 Halted 0 ms 0 KB -