oj.uz

답안 #422698

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
422698 2021-06-10T10:40:26 Z ak2006 Sure Bet (CEOI17_sure) C++14
100 / 100
 116 ms 4328 KB 
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vb = vector<bool>;
using vvb = vector<vb>;
using vi = vector<int>;
using vvi = vector<vi>;
using vl = vector<ll>;
using vvl = vector<vl>;
using vc = vector<char>;
using vvc = vector<vc>;
using vs = vector<string>;
const ll mod = 1e9 + 7,inf = 1e18;
#define pb push_back
#define fast ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
void setIO()
{
    fast;
}
int main()
{
    setIO();
    int n;
    cin>>n;
    vector<double>a(n),b(n);
    vector<double>sums(n + 1);
    for (int i = 0;i<n;i++)cin>>a[i]>>b[i],a[i]--,b[i]--;
    sort(a.begin(),a.end()),sort(b.begin(),b.end());
    for (int i = n - 1;i>=0;i--)sums[i] = b[i] + sums[i + 1];
    double sum = 0;
    double out = 0;
    for (int i = n - 1;i>=0;i--){
        int na = n - i;
        sum += a[i];
        int l = 0,r = n - 1,ans = -1;
        while (l <= r){
            int mid = (l + r)/2;
            if (sums[mid] - na >= sum - n + mid){
                ans = mid;
                l = mid + 1;
            }
            else r = mid - 1;
        }
        if (ans == -1){
            double val = sums[0] - na;
            out = max(out,val);
        }
        else {
            double val = sum - (n - ans);
            out = max(out,val);
            if (ans != n - 1)val = sums[ans + 1] - na;
            out = max(out,val);
        }
    }
    printf("%.4lf\n", out);
    return 0;
}

Subtask #1
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct

Subtask #2
40.0 / 40.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 1 ms 332 KB Output is correct
13 Correct 2 ms 332 KB Output is correct
14 Correct 1 ms 332 KB Output is correct
15 Correct 2 ms 316 KB Output is correct
16 Correct 2 ms 324 KB Output is correct

Subtask #3
40.0 / 40.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 1 ms 204 KB Output is correct
10 Correct 1 ms 204 KB Output is correct
11 Correct 1 ms 204 KB Output is correct
12 Correct 1 ms 332 KB Output is correct
13 Correct 2 ms 332 KB Output is correct
14 Correct 1 ms 332 KB Output is correct
15 Correct 2 ms 316 KB Output is correct
16 Correct 2 ms 324 KB Output is correct
17 Correct 93 ms 4036 KB Output is correct
18 Correct 94 ms 3908 KB Output is correct
19 Correct 93 ms 3932 KB Output is correct
20 Correct 92 ms 4036 KB Output is correct
21 Correct 112 ms 4328 KB Output is correct
22 Correct 101 ms 4068 KB Output is correct
23 Correct 98 ms 4036 KB Output is correct
24 Correct 93 ms 4036 KB Output is correct
25 Correct 91 ms 3944 KB Output is correct
26 Correct 116 ms 4328 KB Output is correct