oj.uz

답안 #46387

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
46387 2018-04-20T04:37:18 Z RockyB Sure Bet (CEOI17_sure) C++17
100 / 100
 431 ms 16880 KB 
/// In The Name Of God
 
#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
 
#include <bits/stdc++.h>
 
#define f first
#define s second
 
#define pb push_back
#define pp pop_back
#define mp make_pair
 
#define sz(x) (int)x.size()
#define sqr(x) ((x) * 1ll * (x))
#define all(x) x.begin(), x.end()
 
#define Kazakhstan ios_base :: sync_with_stdio(0), cin.tie(0), cout.tie(0);
 
#define nl '\n'
#define ioi exit(0);
 
typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
 
const int N = (int)5e5 + 7;
const int inf = (int)1e9 + 7;
const int mod = (int)1e9 + 7;
const ll linf = (ll)1e18 + 7;
const ld eps = 1e-4;

const int dx[] = {-1, 0, 1, 0, 1, -1, -1, 1};
const int dy[] = {0, 1, 0, -1, 1, -1, 1, -1};
 
using namespace std;
 
int n;

double a[N], b[N];
double s1[N], s2[N];
 
int main() {
	#ifdef IOI2018
		freopen ("in.txt", "r", stdin);
		freopen ("B.out", "w", stdout);
	#endif
	Kazakhstan
	cin >> n;
	for (int i = 1; i <= n; i++) {
		cin >> a[i] >> b[i];
	}
	sort(a + 1, a + 1 + n);
	sort(b + 1, b + 1 + n);
	for (int i = 1; i <= n; i++) {
		s1[i] = s1[i - 1] + a[n - i + 1];
		s2[i] = s2[i - 1] + b[n - i + 1];
	}
	for (int i = 1; i <= n; i++) {
		s1[i] -= i, s2[i] -= i;
		//cerr << s1[i] << ' ' << s2[i] << nl;
	}
	double ans = 0;
	for (int i = 0; i <= n; i++) {
		double l = 0, r = inf, res = 0;
		for (int t = 1; t <= 200; t++) {
			double x = (l + r) / 2;
			int j = s1[i] - x;
			if (j >= 0 && s2[min(j, n)] - i >= x) res = x, l = x;
			else r = x;
		}
		ans = max(ans, res);
	}
	cout << setprecision(4) << fixed << ans;
	ioi
}

Subtask #1
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 432 KB Output is correct
4 Correct 2 ms 448 KB Output is correct
5 Correct 2 ms 448 KB Output is correct
6 Correct 2 ms 448 KB Output is correct

Subtask #2
40.0 / 40.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 432 KB Output is correct
4 Correct 2 ms 448 KB Output is correct
5 Correct 2 ms 448 KB Output is correct
6 Correct 2 ms 448 KB Output is correct
7 Correct 2 ms 508 KB Output is correct
8 Correct 2 ms 636 KB Output is correct
9 Correct 2 ms 688 KB Output is correct
10 Correct 2 ms 688 KB Output is correct
11 Correct 2 ms 688 KB Output is correct
12 Correct 6 ms 700 KB Output is correct
13 Correct 6 ms 700 KB Output is correct
14 Correct 7 ms 700 KB Output is correct
15 Correct 6 ms 700 KB Output is correct
16 Correct 6 ms 700 KB Output is correct

Subtask #3
40.0 / 40.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 432 KB Output is correct
4 Correct 2 ms 448 KB Output is correct
5 Correct 2 ms 448 KB Output is correct
6 Correct 2 ms 448 KB Output is correct
7 Correct 2 ms 508 KB Output is correct
8 Correct 2 ms 636 KB Output is correct
9 Correct 2 ms 688 KB Output is correct
10 Correct 2 ms 688 KB Output is correct
11 Correct 2 ms 688 KB Output is correct
12 Correct 6 ms 700 KB Output is correct
13 Correct 6 ms 700 KB Output is correct
14 Correct 7 ms 700 KB Output is correct
15 Correct 6 ms 700 KB Output is correct
16 Correct 6 ms 700 KB Output is correct
17 Correct 399 ms 3836 KB Output is correct
18 Correct 391 ms 5196 KB Output is correct
19 Correct 393 ms 6672 KB Output is correct
20 Correct 400 ms 8008 KB Output is correct
21 Correct 429 ms 9796 KB Output is correct
22 Correct 397 ms 11136 KB Output is correct
23 Correct 403 ms 12456 KB Output is correct
24 Correct 401 ms 13892 KB Output is correct
25 Correct 398 ms 15204 KB Output is correct
26 Correct 431 ms 16880 KB Output is correct