oj.uz

답안 #872555

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
872555 2023-11-13T11:13:22 Z vjudge1 Sure Bet (CEOI17_sure) C++17
0 / 100
 0 ms 348 KB 
//author: Ahmet Alp Orakci
#include <bits/stdc++.h>
using namespace std;
using i64 = long long;
#define double double

#define ONLINE_JUDGE
void solve() {
    int n;
    cin >> n;

    pair <double, double> arr[n];
    for(auto &[a, b] : arr) {
        cin >> a >> b;
    }

    double ans = -1E9;
    for(int mask = 0; mask < (1 << n); mask++) {
        for(int mmask = 0; mmask < (1 << n); mmask++) {
            double fir = 0, sec = 0;
            for(int i = 0; i < n; i++) {
                if(mask & (1 << i)) {
                    if(mmask & (1 << i))
                        fir += arr[i].first;
                    else
                        sec += arr[i].second;
                }
            }

            ans = max(ans, min(fir, sec) - __builtin_popcount(mask));
        }
    }

    printf("%.4lf", double(ans));
    
    return;
}

signed main() {
    #ifndef ONLINE_JUDGE
        freopen(".in", "r", stdin);
        freopen(".out", "w", stdout);
    #endif

    int t = 1; //cin >> t;
    for(int i = 1; i <= t; i++) {
        solve();
    }

    return 0;
}

Subtask #1
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Incorrect 0 ms 348 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #2
0 / 40.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Incorrect 0 ms 348 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #3
0 / 40.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Incorrect 0 ms 348 KB Output isn't correct
3 Halted 0 ms 0 KB -