Submission #446666

#	Time	Username	Problem	Language	Result	Execution time	Memory
446666		Return_0	Sure Bet (CEOI17_sure)	C++17	100 / 100	115 ms	3688 KiB

sure

#pragma GCC optimize("Ofast,unroll-loops")
// #pragma comment(linker, "/stack:200000000")
// #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,fma,tune=native")

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

using namespace std;
using namespace __gnu_pbds;

typedef int ll;
typedef double ld;
typedef pair <ll, ll> pll;

#ifdef SINA
#define dbg(...) __f(#__VA_ARGS__, __VA_ARGS__)
template <typename Arg1> void __f(const char* name, Arg1&& arg1) { cout << name << " : " << arg1 << std::endl; }
template <typename Arg1, typename... Args> void __f (const char* names, Arg1&& arg1, Args&&... args) {
	const char* comma = strchr(names + 1, ',');cout.write(names, comma - names) << " : " << arg1<<" | ";__f(comma+1, args...); }
#define dbg2(x, j, n) cout<< #x << " : "; output((j), (n), x, 1); cout.flush();
#else
#define dbg(...) 0
#define dbg2(x, j, n) 0
#endif
#define SZ(x) ((ll)((x).size()))
#define File(s, t) freopen(s ".txt", "r", stdin); freopen(t ".txt", "w", stdout);
#define input(j, n, a) for (int _i = (j); _i < (n)+(j); _i++) cin>> a[_i];
#define output(j, n, a, t) for (int _i = (j); _i < (n)+(j); _i++) cout<< a[_i] << (((t) && _i != (n)+(j)-1)? ' ' : '\n');
#define kill(x) return cout<< (x) << endl, 0
#define cl const ll
#define fr first
#define sc second
#define lc (v << 1)
#define rc (lc | 1)
#define mid ((l + r) >> 1)
#define All(x) (x).begin(), (x).end()

cl inf = sizeof(ll) == 4 ? (1e9 + 10) : (3e18), mod = 1e9 + 7, MOD = 998244353;

template <class A,class B> ostream& operator << (ostream& out,const pair<A,B>&a){return out<<'('<<a.first<<", "<<a.second<<')';}
template <class A> ostream& operator << (ostream& out, const vector<A> &a) {
	out<< '['; for (int i = -1; ++i < int(a.size());) out<< a[i] << (i + 1 < int(a.size()) ? ", " : ""); return out<<']'; }
template <class T, typename _t = less <T> > using Tree = tree <T, null_type, _t, rb_tree_tag, tree_order_statistics_node_update>;

cl N = 1e5 + 7;

ll n;
ld a [N], b [N], ans, s1, s2;

int main ()
{
	ios::sync_with_stdio(false); cin.tie(0); cout.tie(0);
	cout<< fixed << setprecision(4);

	cin>> n;
	for (ll i = 1; i <= n; i++) cin>> a[i] >> b[i], a[i] -= 1., b[i] -= 1.;

	sort(a + 1, a + n + 1, greater <ld>());
	sort(b + 1, b + n + 1, greater <ld>());

	for (ll i = 1, j = 0; i <= n; i++) {
		s1 += a[i]; s2 -= 1.;
		ans = max(ans, min(s1, s2));
		for (; s2 < s1 && j < n;) {
			j++;
			s1 -= 1.; s2 += b[j];
			ans = max(ans, min(s1, s2));
		}
	}

	s1 = s2 = 0;
	for (ll i = 1, j = 0; i <= n; i++) {
		s1 += b[i]; s2 -= 1.;
		ans = max(ans, min(s1, s2));
		for (; s2 < s1 && j < n;) {
			j++;
			s1 -= 1.; s2 += a[j];
			ans = max(ans, min(s1, s2));
		}
	}

	kill(ans);

	cerr<< "\nTime elapsed: " << 1000 * clock() / CLOCKS_PER_SEC << "ms\n";

	return 0;
}
/*
4
1.4 3.7
1.2 2
1.6 1.4
1.9 1.5

*/

• Subtask 1: 20 / 20
• Subtask 2: 40 / 40
• Subtask 3: 40 / 40