oj.uz

답안 #1097515

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1097515 2024-10-07T14:15:25 Z TrinhKhanhDung Sure Bet (CEOI17_sure) C++14
100 / 100
 62 ms 3672 KB 
#include <bits/stdc++.h>
#define ll long long
#define fi first
#define se second
#define sz(x) (int)x.size()
#define ALL(v) v.begin(),v.end()
#define MASK(k) (1LL << (k))
#define BIT(x, i) (((x) >> (i)) & 1)
#define oo (ll)1e18
#define INF (ll)1e9
#define MOD (ll)(1e9 + 7)

using namespace std;

template<class T1, class T2>
    bool maximize(T1 &a, T2 b){if(a < b){a = b; return true;} return false;}

template<class T1, class T2>
    bool minimize(T1 &a, T2 b){if(a > b){a = b; return true;} return false;}

template<class T1, class T2>
    void add(T1 &a, T2 b){a += b; if(a >= MOD) a -= MOD;}

template<class T1, class T2>
    void sub(T1 &a, T2 b){a -= b; if(a < 0) a += MOD;}

template<class T>
    void cps(T &v){sort(ALL(v)); v.resize(unique(ALL(v)) - v.begin());}

const int MAX = 1e5 + 10;

int N;
double A[MAX], B[MAX];

void solve(){
    cin >> N;
    for(int i = 1; i <= N; i++){
        cin >> A[i] >> B[i];
    }

    sort(A + 1, A + N + 1, greater<double>());
    sort(B + 1, B + N + 1, greater<double>());
    for(int i = 1; i <= N; i++){
//        cout << A[i] << ' ' << B[i] << '\n';
        A[i] += A[i - 1];
        B[i] += B[i - 1];
    }

    double ans = -1e9;

    for(int i = 0; i <= N; i++){
        int l = 0, r = N;
        while(l < r){
//            cerr << l << ' ' << r << '\n';
            int m = (l + r + 1) >> 1;
            if(A[i] - (m + i) >= B[m] - (m + i)) l = m;
            else r = m - 1;
        }

//        cout << i << ' ' << l << '\n';

        maximize(ans, min(A[i] - (i + l), B[l] - (i + l)));
        if(l < N){
            l++;
            maximize(ans, min(A[i] - (i + l), B[l] - (i + l)));
        }
//        cout << ans << '\n';
    }

    cout << fixed << setprecision(4) << ans << '\n';
}

int main(){
    ios_base::sync_with_stdio(0); cin.tie(0);
//     freopen("CAU3.inp","r",stdin);
//     freopen("CAU3.out","w",stdout);

    int t = 1;
//    cin >> t;
    while(t--){
        solve();
    }

    return 0;
}

Subtask #1
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 464 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 468 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct

Subtask #2
40.0 / 40.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 464 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 468 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 344 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 460 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 1 ms 480 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 1 ms 348 KB Output is correct

Subtask #3
40.0 / 40.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 464 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 468 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 344 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 460 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 1 ms 480 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Correct 61 ms 3372 KB Output is correct
18 Correct 57 ms 3244 KB Output is correct
19 Correct 62 ms 3160 KB Output is correct
20 Correct 54 ms 3264 KB Output is correct
21 Correct 60 ms 3672 KB Output is correct
22 Correct 57 ms 3368 KB Output is correct
23 Correct 55 ms 3320 KB Output is correct
24 Correct 57 ms 3360 KB Output is correct
25 Correct 55 ms 3152 KB Output is correct
26 Correct 60 ms 3668 KB Output is correct