oj.uz

Submission #860268

# Submission time Handle Problem Language Result Execution time Memory
860268 2023-10-12T12:07:25 Z naneosmic Sure Bet (CEOI17_sure) C++14
60 / 100
 2000 ms 3672 KB 
#include <bits/stdc++.h>
#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")
#define float double
#define endl "\n"
using namespace std;
bool f(float a, float b){
    return a>b;
}
int binarySearch(vector<float>arr, float l, float r, float x){
    if(arr[l]>=x)
        return l;
    if(arr[l+1]>=x)
        return l;
    if(arr[r]<=x)
        return r-1;
    while (l < r&&(r-l)>1) {
        int m = (l+r) / 2;
        if(arr[m]<=x && arr[m+1]>=x)
            return m;
        if (arr[m+1] < x)
            l = m;
        else
            r = m;
    }
    return -1;
}
int main(){
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cout.tie(NULL);
    float n;
    cin>>n;
    vector<float>a(n);
    vector<float>b(n);
    for(float i=0;i<n;i++){
        cin>>a[i]>>b[i];
    }
    sort(a.begin(),a.end(),f);
    sort(b.begin(),b.end(),f);
    vector<float>b_pref;
    float s=0;
    b_pref.push_back(0);
    for(float i=0;i<n;i++){
        s+=b[i];
        b_pref.push_back(s);
    }
    s=0;
    float score=0;
    for(float i=0;i<n;i++){
        s+=a[i];
        float j=binarySearch(b_pref,0,n,s);
        float s1=min(s,b_pref[j])-i-j-1;
        float s2=min(s,b_pref[j+1])-i-j-2;
        score=max(score,s2);
        score=max(score,s1);
    }
    printf("%.4lf",(float)score);
}

Subtask #1
20.0 / 20.0

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

Subtask #2
40.0 / 40.0

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

Subtask #3
0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 344 KB Output is correct
6 Correct 1 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 1 ms 348 KB Output is correct
13 Correct 1 ms 348 KB Output is correct
14 Correct 1 ms 348 KB Output is correct
15 Correct 1 ms 348 KB Output is correct
16 Correct 1 ms 348 KB Output is correct
17 Execution timed out 2048 ms 3672 KB Time limit exceeded
18 Halted 0 ms 0 KB -