oj.uz

Submission #570841

# Submission time Handle Problem Language Result Execution time Memory
570841 2022-05-31T10:57:36 Z BackNoob Sure Bet (CEOI17_sure) C++14
100 / 100
 86 ms 2840 KB 
#include <bits/stdc++.h>
#define ll long long
#define fi first
#define se second
#define endl '\n'
#define MASK(i) (1LL << (i))
#define ull unsigned long long
#define ld long double
#define pb push_back
#define all(x) (x).begin() , (x).end()
#define BIT(x , i) ((x >> (i)) & 1) 
#define TASK "task"
#define sz(s) (int) (s).size()
 
using namespace std;
const int mxN = 3e5 + 227;
const int inf = 1e9 + 277;
const int mod = 24211007;
const ll infll = 1e18 + 7;
const int base = 307;
const int LOG = 20;
 
template <typename T1, typename T2> bool minimize(T1 &a, T2 b) {
	if (a > b) {a = b; return true;} return false;
}
template <typename T1, typename T2> bool maximize(T1 &a, T2 b) {
	if (a < b) {a = b; return true;} return false;
}

int n;
double a[mxN];
double b[mxN];
 
void solve()
{	
	cin >> n;	
	for(int i = 1; i <= n; i++) cin >> a[i] >> b[i];

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

	double s1 = 0, s2 = 0;
	double res = 0;
	int pos = 1;
	for(int i = 1; i <= n; i++) {
		s1 += a[i];
		while(pos <= n && min(s1 - i - pos + 1, s2 - i - pos + 1) <= min(s1 - i - pos, s2 - i - pos + b[pos])) {
			s2 += b[pos];
			++pos;
		}
		maximize(res, min(s1 - i - pos + 1, s2 - i - pos + 1));
	}

	cout << fixed << setprecision(4) << res;
}
 
int main()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    //freopen(TASK".in" , "r" , stdin);
    //freopen(TASK".out" , "w" , stdout);
	
    int tc = 1;
    // cin >> tc;
    while(tc--) {
    	solve();
    }
    return 0;
}

Subtask #1
20.0 / 20.0

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

Subtask #2
40.0 / 40.0

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

Subtask #3
40.0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 324 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 2 ms 340 KB Output is correct
13 Correct 2 ms 340 KB Output is correct
14 Correct 1 ms 336 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 2 ms 340 KB Output is correct
17 Correct 79 ms 2720 KB Output is correct
18 Correct 86 ms 2788 KB Output is correct
19 Correct 82 ms 2768 KB Output is correct
20 Correct 80 ms 2776 KB Output is correct
21 Correct 79 ms 2732 KB Output is correct
22 Correct 73 ms 2840 KB Output is correct
23 Correct 74 ms 2684 KB Output is correct
24 Correct 83 ms 2764 KB Output is correct
25 Correct 76 ms 2784 KB Output is correct
26 Correct 75 ms 2772 KB Output is correct