oj.uz

Submission #498375

# Submission time Handle Problem Language Result Execution time Memory
498375 2021-12-25T05:33:00 Z mansur Sure Bet (CEOI17_sure) C++17
100 / 100
 113 ms 3716 KB 
#include<bits/stdc++.h>	
/* 
#pragma optimize ("g",on)
#pragma GCC optimize ("inline")
#pragma GCC optimize ("Ofast")
#pragma GCC optimize ("unroll-loops")
#pragma GCC optimize ("03")
#pragma GCC target ("sse,sse2,sse3,ssse3,sse4,popcnt,abm,avx2,mmx,fma,avx,tune=native")
#pragma comment(linker, "/stack:200000000")
*/ 
//01001101 01100001 01101011 01101000 01100001  01100111 01100001 01111001 
 
using namespace std;
 
#define all(a) a.begin(), a.end()                                                   
#define rall(a) a.rbegin(), a.rend()
#define ll long long
#define pb push_back
#define sz(a) a.size()
#define nl '\n'
#define popb pop_back()                                                                   
#define ld double
#define ull unsigned long long
#define ff first                                         
#define ss second  
#define fix fixed << setprecision
#define pii pair<int, int>                          
#define E exit (0)
#define int long long
 
const int inf = 1e15, N = 2e5 + 5, mod = 998244353;                    
 
vector<pii> dir = {{1, 0}, {0, 1}, {-1, 0}, {0, -1}};

main() {                                                         
	//freopen("triangles.in", "r", stdin);                                                                                     
	//freopen("triangles.out", "w", stdout);                                                                                     
	ios_base::sync_with_stdio(NULL);                                                                                        
	cin.tie(NULL);
	int n;
	cin >> n;
	vector<double> a, b;
	for (int i = 1; i <= n; i++) {
		double x, y;
		cin >> x >> y;
		a.pb(x);
		b.pb(y);
	}
	sort(rall(a));
	sort(rall(b));
	double prefa[n + 1], prefb[n + 1];
	prefa[0] = prefb[0] = 0;
	for (int i = 1; i <= n; i++) {
		prefa[i] = prefa[i - 1] + a[i - 1];
		prefb[i] = prefb[i - 1] + b[i - 1];
	}
	double ans = 0;
	for (int t = 1; t <= n * 2; t++) {
		int l = 0, r = min(n, t);
		double cur = 0;
		while (l <= r) {
			int mid = (l + r) / 2;
			if (prefa[mid] <= prefb[min(n, t - mid)]) {
				l = mid + 1;
				cur = prefa[mid];
			}else r = mid - 1;
        }
        ans = max(ans, cur - t * 1.0);
        l = 0, r = min(n, t);
		cur = 0;
		while (l <= r) {
			int mid = (l + r) / 2;
			if (prefb[mid] <= prefa[min(n, t - mid)]) {
				l = mid + 1;
				cur = prefb[mid];
			}else r = mid - 1;
        }
        ans = max(ans, cur - t * 1.0);
	}
	cout << fix(4) << ans;
}

Compilation message

sure.cpp:35:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   35 | main() {
      | ^~~~

Subtask #1
20.0 / 20.0

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

Subtask #2
40.0 / 40.0

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

Subtask #3
40.0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 0 ms 204 KB Output is correct
4 Correct 0 ms 204 KB Output is correct
5 Correct 0 ms 204 KB Output is correct
6 Correct 0 ms 204 KB Output is correct
7 Correct 0 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 0 ms 204 KB Output is correct
11 Correct 0 ms 204 KB Output is correct
12 Correct 1 ms 332 KB Output is correct
13 Correct 1 ms 332 KB Output is correct
14 Correct 1 ms 332 KB Output is correct
15 Correct 2 ms 332 KB Output is correct
16 Correct 1 ms 332 KB Output is correct
17 Correct 88 ms 3616 KB Output is correct
18 Correct 84 ms 3656 KB Output is correct
19 Correct 93 ms 3588 KB Output is correct
20 Correct 88 ms 3636 KB Output is correct
21 Correct 96 ms 3716 KB Output is correct
22 Correct 85 ms 3636 KB Output is correct
23 Correct 90 ms 3620 KB Output is correct
24 Correct 113 ms 3632 KB Output is correct
25 Correct 90 ms 3632 KB Output is correct
26 Correct 99 ms 3700 KB Output is correct