oj.uz

답안 #595850

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
595850 2022-07-14T07:41:06 Z OttoTheDino Sure Bet (CEOI17_sure) C++17
0 / 100
 1 ms 212 KB 
#include <bits/stdc++.h>
using namespace std;

#define rep(i,s,e)                      for (int i = s; i <= e; ++i)
#define len(a)                          (int)a.size()
typedef long long ll;

const ll C = 1e4;

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

    int n; cin >> n;
    ll a[n+1] = {}, b[n+1] = {};

    rep (i,0,n-1) {
        string sx, sy; cin >> sx >> sy;
        ll x = 0, y = 0, idx = 0, idy = 0;
        rep (j,0,len(sx)-1) {
            if (sx[j]=='.') idx = j;
            else {
                x *= 10;
                x += (sx[j]-'0');
            }
        }
        rep (j,0,len(sy)-1) {
            if (sy[j]=='.') idy = j;
            else {
                y *= 10;
                y += (sy[j]-'0');
            }
        }
        x *= pow(10, 4-len(sx)+1+idx);  
        y *= pow(10, 4-len(sy)+1+idy);
        a[i] = x;
        b[i] = y; 
    }

    sort (a, a+n, greater<ll>());
    sort (b, b+n, greater<ll>());

    ll lo = 0, hi = 1e13;

    while (lo<hi) {
        ll mid = (lo+hi+1)/2, id = 0, s1 = 0, s2 = 0, suc = 0;
        rep (i,0,n) {
            if (min(s1,s2)-C*(i+id)>=mid) {
                suc = 1;
                break;
            }
            s1 += a[i];
            while (id < n && s2-C*(i+id)<mid) {
                s2 +=b[id];
                ++id;
            }
        }
        if (suc) lo = mid;
        else hi = mid-1;
    }

    cout << fixed << setprecision(4) << (double)lo/C << "\n";

    return 0;
}

Subtask #1
0 / 20.0

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

Subtask #2
0 / 40.0

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

Subtask #3
0 / 40.0

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