oj.uz

Submission #553028

# Submission time Handle Problem Language Result Execution time Memory
553028 2022-04-24T13:09:12 Z Hanksburger Sure Bet (CEOI17_sure) C++17
20 / 100
 1 ms 340 KB 
#include <bits/stdc++.h>
using namespace std;
int a[100005], b[100005], suma[100005], sumb[100005];
int f(int x, int y)
{
	return min(suma[x]-y*10000, sumb[y]-x*10000);
}
int main()
{
	ios::sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);
	int n, ans=0;
	cin >> n;
	for (int i=1; i<=n; i++)
	{
		double x, y;
		cin >> x >> y;
		a[i]=x*10000.0-9999.9;
		b[i]=y*10000.0-9999.9;
	}
	sort(a+1, a+n+1, greater<int>());
	sort(b+1, b+n+1, greater<int>());
	for (int i=1; i<=n; i++)
		suma[i]=suma[i-1]+a[i];
	for (int i=1; i<=n; i++)
		sumb[i]=sumb[i-1]+b[i];
	for (int i=0; i<=n; i++)
	{
		int l=0, r=n;
		while (l<r)
		{
			int mid1=(l*2+r)/3, mid2=(l+r*2+1)/3;
			int res1=f(i, mid1), res2=f(i, mid2);
			if (res1>res2)
				r=mid2-1;
			else if (res1<res2)
				l=mid1+1;
			else
			{
				l=mid1;
				r=mid2-1;
			}
		}
		ans=max(ans, f(i, l));
	}
	cout << fixed << setprecision(4) << ans/10000.0;
	return 0;
}

Subtask #1
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 328 KB Output is correct
5 Correct 1 ms 296 KB Output is correct
6 Correct 1 ms 340 KB Output is correct

Subtask #2
0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 328 KB Output is correct
5 Correct 1 ms 296 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Incorrect 1 ms 340 KB Output isn't correct
17 Halted 0 ms 0 KB -

Subtask #3
0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 ms 340 KB Output is correct
4 Correct 1 ms 328 KB Output is correct
5 Correct 1 ms 296 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 1 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Incorrect 1 ms 340 KB Output isn't correct
17 Halted 0 ms 0 KB -