oj.uz

답안 #843500

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
843500 2023-09-04T03:46:02 Z vjudge1 Sure Bet (CEOI17_sure) C++
60 / 100
 2000 ms 1872 KB 
#define COPYRIGHT CODE BY TRINH TUAN NGHIA
#include<bits/stdc++.h>
#define Boost ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0)
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#pragma GCC target("popcnt")
#define ll long long
#define endl "\n"
#define st first
#define nd second
#define ii pair <ll,ll>
#define iii pair <ll,ii>
#define iiii pair <ii,ii>
#define pb push_back
#define NAME "surebet"
using namespace std;
const ll N = 1e5 + 10;
double a[N];
double b[N];
ll n;
ll na, nb;
double sa, sb;
void inp (){
    cin >> n;
    for (int i = 1; i <= n; ++i){
        cin >> a[i] >> b[i];
    }
}
void solve(){
    double l = 0, r = 1e9;
    sort (a + 1,a + n + 1, greater<>());
    sort (b + 1, b + n + 1, greater<>());
    double ans =0 ;
    for (int i = 0; i <= 2 * n; ++i){
        sa = 0;
        na = 0;
        sb = 0;
        nb = 0;
        l = 0;
        r = 1e9;
        for (int j = 0 ; j <= 50; ++j){
            double m = (l + r) / 2;
            while (sa - i < m and na < n){
                sa += a[na + 1];
                //cout << "Dcm " << sa << " " << m << endl;
                ++na;
            }
            while (sb - i < m and nb < n){
                sb += b[nb + 1];
                ++nb;
            }
            while (sa - i - a[na] >= m){
                sa -= a[na];
                //cout << "Dcm " << sa << " " << m << endl;

                --na;
            }
            while (sb - i - b[nb] >=m){
                sb -= b[nb];
                //cout << "cmm " << sb << " " << m << endl;
                --nb;
            }
            //cout << na << " " << nb << " " << i << endl;
            //cout << sa << " " << sb << endl ;
            if (na + nb <= i and sa - i >= m and sb - i >= m){
                l = m;
                ans = max(ans, m);
                //cout << setprecision(4)<< fixed<< m << endl;
            }
            else r = m;
            //if (i == 3) cout << setprecision(4) << fixed << sa << " " << sb << endl;
        }

    }
    cout << setprecision(4) << fixed << ans;

}
signed main (){
    if (fopen(NAME".inp", "r")){
        freopen(NAME".inp", "r", stdin);
        freopen(NAME".out", "w", stdout);
    }
    Boost;
    inp();
    solve();
}
/*
input

*/

/*
output

*/

Compilation message

sure.cpp: In function 'int main()':
sure.cpp:80:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   80 |         freopen(NAME".inp", "r", stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
sure.cpp:81:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   81 |         freopen(NAME".out", "w", stdout);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
20.0 / 20.0

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

Subtask #3
0 / 40.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 344 KB Output is correct
2 Correct 1 ms 344 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 0 ms 344 KB Output is correct
5 Correct 0 ms 344 KB Output is correct
6 Correct 0 ms 344 KB Output is correct
7 Correct 1 ms 344 KB Output is correct
8 Correct 1 ms 344 KB Output is correct
9 Correct 1 ms 344 KB Output is correct
10 Correct 1 ms 344 KB Output is correct
11 Correct 1 ms 464 KB Output is correct
12 Correct 9 ms 344 KB Output is correct
13 Correct 9 ms 344 KB Output is correct
14 Correct 11 ms 344 KB Output is correct
15 Correct 10 ms 344 KB Output is correct
16 Correct 11 ms 348 KB Output is correct
17 Execution timed out 2050 ms 1872 KB Time limit exceeded
18 Halted 0 ms 0 KB -