oj.uz

Submission #595874

# Submission time Handle Problem Language Result Execution time Memory
595874 2022-07-14T07:49:14 Z OttoTheDino Sure Bet (CEOI17_sure) C++17
100 / 100
 62 ms 3604 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');
            }
        }
        if (!idx) idx = len(sx)-1;
        if (!idy) idy = len(sy)-1;
        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+1+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
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 316 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 320 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct

Subtask #2
40.0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 316 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 320 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 336 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 2 ms 340 KB Output is correct
16 Correct 1 ms 340 KB Output is correct

Subtask #3
40.0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 316 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 320 KB Output is correct
5 Correct 1 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 1 ms 212 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 336 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 2 ms 340 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 46 ms 2256 KB Output is correct
18 Correct 55 ms 3228 KB Output is correct
19 Correct 39 ms 3148 KB Output is correct
20 Correct 54 ms 3264 KB Output is correct
21 Correct 48 ms 3600 KB Output is correct
22 Correct 59 ms 3136 KB Output is correct
23 Correct 62 ms 3232 KB Output is correct
24 Correct 40 ms 3232 KB Output is correct
25 Correct 44 ms 3124 KB Output is correct
26 Correct 46 ms 3604 KB Output is correct