oj.uz

Submission #207846

# Submission time Handle Problem Language Result Execution time Memory
207846 2020-03-09T09:15:28 Z Siberian Sure Bet (CEOI17_sure) C++14
100 / 100
 56 ms 6776 KB 
#include <bits/stdc++.h>

using namespace std;
using ll = long long;
using ld = long double;
using ull = unsigned long long;
#define all(x) x.begin(), x.end()

template <typename T1, typename T2> inline void chkmin(T1 &x, const T2 & y) {if (x > y) x = y;}
template <typename T1, typename T2> inline void chkmax(T1 &x, const T2 & y) {if (x < y) x = y;}

int Read() {
	string s;
	cin >> s;
	int ans = 0;
	int cnt = 4;
	bool flag = false;
	for (auto i : s) {
		if (i == '.') {
			flag = true;
			continue;
		}
		if (flag) cnt--;
		ans *= 10;
		ans += i - '0';
	}
	while (cnt--)
		ans *= 10;
	return ans;
}

int n;
vector<ll> a, b;

void read() {
	cin >> n;
	a.resize(n);
	b.resize(n);
	for (int i = 0; i < n; i++) {
		a[i] = Read();
		b[i] = Read();
	}
}

ll solve(vector<ll> a, vector<ll> b) {
	ll ans = 0;
	for (int i = 1; i < n; i++) {
		a[i] += a[i - 1];
		b[i] += b[i - 1];
	}
	for (int i = 0; i < n; i++) {
		ll pos = lower_bound(all(b), a[i]) - b.begin();
		if (pos == n) break;
		chkmax(ans, a[i] - (i + 1) * 10000 - (pos + 1) * 10000);
	}
	return ans;
}

ll ans;

void run() {
	sort(all(a));
	reverse(all(a));
	sort(all(b));
	reverse(all(b));
	ans = max(solve(a, b), solve(b, a));
}

string get(ll ans) {
	string fans = "";
	for (int i = 0; i < 4; i++) {
		fans += '0' + ans % 10;
		ans /= 10;
	}
	fans += ".";
	if (ans == 0) {
		fans += "0";
	}
	else {
		while (ans) {
			fans += '0' + ans % 10;
			ans /= 10;
		}
	}
	reverse(all(fans));
	return fans;
}

void write() {
	cout << get(ans) << endl;
}

signed main() {
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);
	read();
	run();
	write();
	return 0;
}

Subtask #1
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 376 KB Output is correct
2 Correct 5 ms 380 KB Output is correct
3 Correct 4 ms 376 KB Output is correct
4 Correct 5 ms 376 KB Output is correct
5 Correct 5 ms 376 KB Output is correct
6 Correct 5 ms 380 KB Output is correct

Subtask #2
40.0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 376 KB Output is correct
2 Correct 5 ms 380 KB Output is correct
3 Correct 4 ms 376 KB Output is correct
4 Correct 5 ms 376 KB Output is correct
5 Correct 5 ms 376 KB Output is correct
6 Correct 5 ms 380 KB Output is correct
7 Correct 5 ms 376 KB Output is correct
8 Correct 5 ms 376 KB Output is correct
9 Correct 5 ms 376 KB Output is correct
10 Correct 5 ms 376 KB Output is correct
11 Correct 5 ms 376 KB Output is correct
12 Correct 5 ms 376 KB Output is correct
13 Correct 5 ms 376 KB Output is correct
14 Correct 5 ms 376 KB Output is correct
15 Correct 6 ms 504 KB Output is correct
16 Correct 5 ms 376 KB Output is correct

Subtask #3
40.0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 376 KB Output is correct
2 Correct 5 ms 380 KB Output is correct
3 Correct 4 ms 376 KB Output is correct
4 Correct 5 ms 376 KB Output is correct
5 Correct 5 ms 376 KB Output is correct
6 Correct 5 ms 380 KB Output is correct
7 Correct 5 ms 376 KB Output is correct
8 Correct 5 ms 376 KB Output is correct
9 Correct 5 ms 376 KB Output is correct
10 Correct 5 ms 376 KB Output is correct
11 Correct 5 ms 376 KB Output is correct
12 Correct 5 ms 376 KB Output is correct
13 Correct 5 ms 376 KB Output is correct
14 Correct 5 ms 376 KB Output is correct
15 Correct 6 ms 504 KB Output is correct
16 Correct 5 ms 376 KB Output is correct
17 Correct 51 ms 6364 KB Output is correct
18 Correct 54 ms 6392 KB Output is correct
19 Correct 54 ms 6392 KB Output is correct
20 Correct 56 ms 6520 KB Output is correct
21 Correct 56 ms 6776 KB Output is correct
22 Correct 54 ms 6392 KB Output is correct
23 Correct 54 ms 6392 KB Output is correct
24 Correct 54 ms 6396 KB Output is correct
25 Correct 52 ms 6392 KB Output is correct
26 Correct 55 ms 6776 KB Output is correct