oj.uz

답안 #1034186

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1034186 2024-07-25T10:22:46 Z MarwenElarbi Sure Bet (CEOI17_sure) C++17
0 / 100
 1 ms 456 KB 
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace std;
using namespace __gnu_pbds;
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#define fi first
#define se second
#define ll long long
#define pb push_back
#define ii pair<int,int>
template <class T>
using Tree = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
const int nax=1e5+5;
#define optimise ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
int main()
{
    optimise;
    int n;
    cin>>n;
    vector<double> a(n),b(n);
    for (int i = 0; i < n; ++i)
    {
        cin>>a[i];
        cin>>b[i];
    }
    sort(b.rbegin(),b.rend());
    sort(a.rbegin(),a.rend());
    pair<double,double> cnt={0,0};
    double ans=0;
    int j=0;
    for (int i = 0; i < n; ++i)
    {  
        while(cnt.se<cnt.fi&&j<n){
            ans=max(ans,min(cnt.fi,cnt.se)-(j+i+1));
            cnt.se+=b[j];
            ans=max(ans,min(cnt.fi,cnt.se)-(j+i+2));
            j++;
        }
        cnt.fi+=a[i];
        ans=max(ans,min(cnt.fi,cnt.se)-(j+i+2));
    }
    while(j<n){
        ans=max(ans,min(cnt.fi,cnt.se)-(j+n));
        cnt.se+=b[j];
        ans=max(ans,min(cnt.fi,cnt.se)-(j+n+1));
        j++;
    }
    cnt={0,0};
    j=0;
    for (int i = 0; i < n; ++i)
    {  
        
        while(cnt.se<cnt.fi&&j<n){
            ans=max(ans,min(cnt.fi,cnt.se)-(j+i+1));
            cnt.se+=b[j];
            ans=max(ans,min(cnt.fi,cnt.se)-(j+i+2));
            j++;
        }
        cnt.fi+=a[i];
        ans=max(ans,min(cnt.fi,cnt.se)-(j+i+2));
    }
    while(j<n){
        ans=max(ans,min(cnt.fi,cnt.se)-(j+n));
        cnt.se+=b[j];
        ans=max(ans,min(cnt.fi,cnt.se)-(j+n+1));
        j++;
    }
    cout <<fixed<<setprecision(4)<<ans<<endl;
}

Subtask #1
0 / 20.0

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

Subtask #2
0 / 40.0

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

Subtask #3
0 / 40.0

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