oj.uz

답안 #948658

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
948658 2024-03-18T10:09:10 Z GrindMachine Sure Bet (CEOI17_sure) C++17
0 / 100
 1 ms 456 KB 
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

using namespace std;
using namespace __gnu_pbds;

template<typename T> using Tree = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
typedef long long int ll;
typedef long double ld;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;

#define fastio ios_base::sync_with_stdio(false); cin.tie(NULL)
#define pb push_back
#define endl '\n'
#define sz(a) (int)a.size()
#define setbits(x) __builtin_popcountll(x)
#define ff first
#define ss second
#define conts continue
#define ceil2(x,y) ((x+y-1)/(y))
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define yes cout << "Yes" << endl
#define no cout << "No" << endl

#define rep(i,n) for(int i = 0; i < n; ++i)
#define rep1(i,n) for(int i = 1; i <= n; ++i)
#define rev(i,s,e) for(int i = s; i >= e; --i)
#define trav(i,a) for(auto &i : a)

template<typename T>
void amin(T &a, T b) {
    a = min(a,b);
}

template<typename T>
void amax(T &a, T b) {
    a = max(a,b);
}

#ifdef LOCAL
#include "debug.h"
#else
#define debug(x) 42
#endif

/*



*/

const int MOD = 1e9 + 7;
const int N = 1e5 + 5;
const int inf1 = int(1e9) + 5;
const ll inf2 = ll(1e18) + 5;

void solve(int test_case)
{
    ll n; cin >> n;
    vector<pll> a(n+5);
    rep1(i,n){
        double x,y; cin >> x >> y;
        a[i] = {x*1e4,y*1e4};
    }

    vector<ll> sa,sb;
    rep1(i,n) sa.pb(a[i].ff), sb.pb(a[i].ss);
    sort(rall(sa)), sort(rall(sb));

    auto get = [&](ll mid){
        ll sum1 = 0, sum2 = 0;
        ll cnt = 0;

        trav(x,sa){
            sum1 += x;
            cnt++;
            if(sum1 >= mid) break;
        }

        trav(x,sb){
            sum2 += x;
            cnt++;
            if(sum2 >= mid) break;
        }

        if(sum1 < mid or sum2 < mid) cnt = inf2;
        return cnt;
    };

    ll ans = 0;

    rep1(cnt,2*n){
        ll l = 1, r = 1e15;
        ll mx = 0;

        while(l <= r){
            ll mid = (l+r) >> 1;
            if(get(mid) <= cnt){
                mx = mid;
                l = mid+1;
            }
            else{
                r = mid-1;
            }
        }

        assert(mx != -1);

        amax(ans,mx-cnt*10000);
    }

    string after_decimal = to_string(ans%10000);
    ll need = 4-sz(after_decimal);
    after_decimal = string(need,'0') + after_decimal;

    ans /= 10000;
    cout << ans << "." << after_decimal << endl;
}

int main()
{
    fastio;

    int t = 1;
    // cin >> t;

    rep1(i, t) {
        solve(i);
    }

    return 0;
}

Subtask #1
0 / 20.0

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

Subtask #2
0 / 40.0

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

Subtask #3
0 / 40.0

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