oj.uz

답안 #958756

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
958756 2024-04-06T14:28:53 Z steveonalex Sure Bet (CEOI17_sure) C++17
100 / 100
 71 ms 4524 KB 
#include <bits/stdc++.h>
using namespace std;

typedef long long ll;
typedef unsigned long long ull;

#define MASK(i) (1LL << (i))
#define GETBIT(mask, i) (((mask) >> (i)) & 1)
#define ALL(v) (v).begin(), (v).end()

ll max(ll a, ll b){return (a > b) ? a : b;}
ll min(ll a, ll b){return (a < b) ? a : b;}

ll LASTBIT(ll mask){return (mask) & (-mask);}
int pop_cnt(ll mask){return __builtin_popcountll(mask);}
int ctz(ll mask){return __builtin_ctzll(mask);}
int logOf(ll mask){return 63 - __builtin_clzll(mask);}

mt19937_64 rng(chrono::high_resolution_clock::now().time_since_epoch().count());
// mt19937_64 rng(69);
ll rngesus(ll l, ll r){return l + (ull) rng() % (r - l + 1);}

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 T>
    void printArr(T& container, string separator = " ", string finish = "\n", ostream &out = cout){
        for(auto item: container) out << item << separator;
        out << finish;
    }

template <class T>
    void remove_dup(vector<T> &a){
        sort(ALL(a));
        a.resize(unique(ALL(a)) - a.begin());
    }


 
int main(void){
    ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);

    int n; cin >> n;
    vector<double> a(n), b(n);
    for(int i = 0; i<n; ++i) cin >> a[i] >> b[i];

    sort(ALL(a), greater<double>()); sort(ALL(b), greater<double>());

    vector<double> pref = b;
    for(double &i: pref) i -= 1;
    for(int i = 1; i<n; ++i) pref[i] += pref[i-1];

    cout << fixed << setprecision(4);

    double l = 0, r = 1e9;
    for(int iteration = 0; iteration < 70; ++iteration){
        double x = (l + r) / 2;
        bool check = false;
        double sum1 = 0;
        for(int i = 0; i<n; ++i){
            sum1 += a[i] - 1;
            if (sum1 >= x){
                int bruh = (int) (sum1 - x);
                minimize(bruh, n);
                if (bruh == 0){
                    if (x == 0) check = true;
                }
                else{
                    if (pref[bruh - 1] >= x + (i + 1)) check = true;
                }
            }
        }

        if (check) l = x;
        else r = x;
    }

    cout << l << "\n";
 
    return 0;
}

Subtask #1
20.0 / 20.0

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

Subtask #2
40.0 / 40.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 388 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 1 ms 492 KB Output is correct
13 Correct 1 ms 348 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 468 KB Output is correct

Subtask #3
40.0 / 40.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 388 KB Output is correct
7 Correct 1 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 1 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 1 ms 492 KB Output is correct
13 Correct 1 ms 348 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 468 KB Output is correct
17 Correct 71 ms 3940 KB Output is correct
18 Correct 68 ms 3924 KB Output is correct
19 Correct 65 ms 3924 KB Output is correct
20 Correct 66 ms 3916 KB Output is correct
21 Correct 67 ms 4524 KB Output is correct
22 Correct 68 ms 4064 KB Output is correct
23 Correct 67 ms 3940 KB Output is correct
24 Correct 66 ms 3924 KB Output is correct
25 Correct 71 ms 3932 KB Output is correct
26 Correct 67 ms 4452 KB Output is correct