답안 #1027209

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1027209 2024-07-19T02:04:05 Z nathan4690 Sure Bet (CEOI17_sure) C++17
100 / 100
118 ms 3580 KB
// CEOI '17 P2 - Sure Bet
#include <bits/stdc++.h>
#define ll long long
#define ld long double
#define el cout << '\n'
#define f1(i,n) for(ll i=1;i<=n;i++)
#define __file_name ""
using namespace std;
const ll maxn = 1e5+5, inf=1e18;

ll n;
ld a[maxn],b[maxn],L,R,mid;

bool check(ld x){
    ld s1 = 0, s2 = 0;
    ll cnt = 0, idx1 = n, idx2 = n;
    while(min(s1, s2) - cnt < x){
        if(s1 - cnt < x){
            if(idx1 == 0) return false;
            s1 += a[idx1];
            idx1--;
        }else{
            if(idx2 == 0) return false;
            s2 += b[idx2];
            idx2--;
        }
        cnt++;
    }
    return true;
}

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

    if(fopen(__file_name ".inp", "r")){
        freopen(__file_name ".inp","r",stdin);
        freopen(__file_name ".out","w",stdout);
    }
    // code here
    cin >> n;
    f1(i,n) cin >> a[i] >> b[i];
    sort(a+1,a+n+1);
    sort(b+1,b+n+1);
    L = 0; R = 1e8;
    f1(_, 60){
        mid = (L+R)/2;
        if(check(mid)) L = mid;
        else R = mid;
    }
    cout << fixed << setprecision(4);
    cout << R;
    return 0;
}

/*
Code by: Nguyen Viet Trung Nhan
Cau Giay Secondary School
*/

Compilation message

sure.cpp: In function 'int main()':
sure.cpp:36:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   36 |         freopen(__file_name ".inp","r",stdin);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
sure.cpp:37:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   37 |         freopen(__file_name ".out","w",stdout);
      |         ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2396 KB Output is correct
2 Correct 0 ms 2396 KB Output is correct
3 Correct 1 ms 2392 KB Output is correct
4 Correct 0 ms 2396 KB Output is correct
5 Correct 1 ms 2392 KB Output is correct
6 Correct 1 ms 2396 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2396 KB Output is correct
2 Correct 0 ms 2396 KB Output is correct
3 Correct 1 ms 2392 KB Output is correct
4 Correct 0 ms 2396 KB Output is correct
5 Correct 1 ms 2392 KB Output is correct
6 Correct 1 ms 2396 KB Output is correct
7 Correct 1 ms 2396 KB Output is correct
8 Correct 1 ms 2396 KB Output is correct
9 Correct 0 ms 2396 KB Output is correct
10 Correct 1 ms 2420 KB Output is correct
11 Correct 1 ms 2396 KB Output is correct
12 Correct 1 ms 2528 KB Output is correct
13 Correct 2 ms 2396 KB Output is correct
14 Correct 1 ms 2396 KB Output is correct
15 Correct 2 ms 2392 KB Output is correct
16 Correct 2 ms 2396 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 2396 KB Output is correct
2 Correct 0 ms 2396 KB Output is correct
3 Correct 1 ms 2392 KB Output is correct
4 Correct 0 ms 2396 KB Output is correct
5 Correct 1 ms 2392 KB Output is correct
6 Correct 1 ms 2396 KB Output is correct
7 Correct 1 ms 2396 KB Output is correct
8 Correct 1 ms 2396 KB Output is correct
9 Correct 0 ms 2396 KB Output is correct
10 Correct 1 ms 2420 KB Output is correct
11 Correct 1 ms 2396 KB Output is correct
12 Correct 1 ms 2528 KB Output is correct
13 Correct 2 ms 2396 KB Output is correct
14 Correct 1 ms 2396 KB Output is correct
15 Correct 2 ms 2392 KB Output is correct
16 Correct 2 ms 2396 KB Output is correct
17 Correct 96 ms 3388 KB Output is correct
18 Correct 98 ms 3412 KB Output is correct
19 Correct 106 ms 3364 KB Output is correct
20 Correct 95 ms 3576 KB Output is correct
21 Correct 118 ms 3576 KB Output is correct
22 Correct 101 ms 3576 KB Output is correct
23 Correct 100 ms 3468 KB Output is correct
24 Correct 104 ms 3580 KB Output is correct
25 Correct 105 ms 3580 KB Output is correct
26 Correct 115 ms 3576 KB Output is correct