oj.uz

Submission #938266

# Submission time Handle Problem Language Result Execution time Memory
938266 2024-03-05T03:55:35 Z vjudge1 Sure Bet (CEOI17_sure) C++17
20 / 100
 65 ms 348 KB 
#include "bits/stdc++.h"
 
#include <ext/pb_ds/assoc_container.hpp> 
#include <ext/pb_ds/tree_policy.hpp> 
 
using namespace __gnu_pbds; 
 
using namespace std;
 
#define int long long
#define ff first
#define ss second
#define pb push_back
#define all(x) x.begin(),x.end()
#define ordered_mset tree<int, null_type,less_equal<int>, rb_tree_tag,tree_order_statistics_node_update> 
#define ordered_set tree<int, null_type,less<int>, rb_tree_tag,tree_order_statistics_node_update> 

const double INF = 1e4;

int binpow (int a, int n) {
	if (n == 0)
		return 1;
	if (n % 2 == 1)
		return binpow (a, n-1) * a;
	else {
		int b = binpow (a, n/2);
		return b * b;
	}
}

void solve(){	
	
	int n;
	cin >> n;
	double a[n],b[n];
	for(int i = 0;i < n;i++){
		cin >> a[i] >> b[i];
	}
	double ans = 0;
	for(int fst = 0;fst < (1 << n);fst++){
		for(int scn = 0;scn < (1 << n);scn++){
			double sum1 = 0;
			double sum2 = 0;
			int cnt = 0;
			for(int i = 0;i < n;i++){
				if(fst >> i & 1){
					cnt++;
					sum1 += a[i];
				}
			}
			for(int i = 0;i < n;i++){
				if(scn >> i & 1){
					cnt++;
					sum2 += b[i];
				}
			}
			ans = max(ans,min(sum1 - cnt,sum2 - cnt));
		}
	}
	cout << fixed << setprecision(4);
	cout << ans << "\n";
	
}
 
signed main(){
	ios_base::sync_with_stdio(0);
	cin.tie(0),cout.tie(0);
	
	int t = 1;
//	cin >> t;
	while(t--){
		solve();
	}
}

Subtask #1
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 62 ms 348 KB Output is correct
4 Correct 61 ms 344 KB Output is correct
5 Correct 65 ms 348 KB Output is correct
6 Correct 64 ms 344 KB Output is correct

Subtask #2
0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 62 ms 348 KB Output is correct
4 Correct 61 ms 344 KB Output is correct
5 Correct 65 ms 348 KB Output is correct
6 Correct 64 ms 344 KB Output is correct
7 Incorrect 0 ms 344 KB Output isn't correct
8 Halted 0 ms 0 KB -

Subtask #3
0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 62 ms 348 KB Output is correct
4 Correct 61 ms 344 KB Output is correct
5 Correct 65 ms 348 KB Output is correct
6 Correct 64 ms 344 KB Output is correct
7 Incorrect 0 ms 344 KB Output isn't correct
8 Halted 0 ms 0 KB -