oj.uz

Submission #841906

# Submission time Handle Problem Language Result Execution time Memory
841906 2023-09-02T08:19:27 Z vjudge1 Sure Bet (CEOI17_sure) C++17
100 / 100
 71 ms 13252 KB 
#include <bits/stdc++.h>
#define pb push_back
#define fi first
#define se second
#define FOR(i,a,b) for(int i = (a) ; i <= (b) ; i++)
#define FORE(i,a,b) for(int i = (a) ; i >= (b) ; i--)
#define par pair<int , int>
#define bit(x,i) ((x>>i)&1)

using namespace std;

const int N = 1 << 20;
const int INF = INT_MAX;
const int mod = 1e9+7;

int MAX(int x, int y){
    if(x >= y) return x;
    else return y;
}

int MIN(int x, int y){
    if(x <= y) return x;
    else return y;
}

int n;
double a[N],b[N],ans1,ans2,ans;
double more;
double F[N],G[N];
int m1,m2,l,r;

int main()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    cin >> n;
    for(int i = 1 ; i <= n ; i++){
        cin >> a[i] >> b[i];
        a[i]--;
        b[i]--;
    }
    sort(a+1,a+n+1,[](double u, double v){
        return u > v;
    });
    sort(b+1,b+n+1,[](double u, double v){
        return u > v;
    });
    for(int i = 1 ; i <= n ; i++){
        F[i] = F[i-1] + a[i];
        G[i] = G[i-1] + b[i];
    }
    for(int i = 0 ; i <= n ; i++){
        l = 0;
        r = n;
        while(r-l > 2){
            m1 = l+(r-l)/3;
            if(G[m1]-i <= F[i]-m1){
                l = m1;
            }
            else{
                r = m1;
            }
        }
        for(int j = 0 ; j <= 3 ; j++){
            if(l+j <= n){
                ans = max(ans,min(G[l+j]-i,F[i]-l-j));
            }
            if(l-j >= 0){
                ans = max(ans,min(G[l-j]-i,F[i]-l+j));
            }
        }
    }
    cout << setprecision(4) << fixed << ans;
    return 0;
}

Subtask #1
20.0 / 20.0

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

Subtask #2
40.0 / 40.0

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

Subtask #3
40.0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4444 KB Output is correct
2 Correct 1 ms 4444 KB Output is correct
3 Correct 1 ms 4444 KB Output is correct
4 Correct 1 ms 4444 KB Output is correct
5 Correct 1 ms 4444 KB Output is correct
6 Correct 1 ms 4444 KB Output is correct
7 Correct 1 ms 4444 KB Output is correct
8 Correct 1 ms 4444 KB Output is correct
9 Correct 1 ms 4440 KB Output is correct
10 Correct 1 ms 4444 KB Output is correct
11 Correct 1 ms 4444 KB Output is correct
12 Correct 1 ms 4440 KB Output is correct
13 Correct 1 ms 4444 KB Output is correct
14 Correct 1 ms 4444 KB Output is correct
15 Correct 1 ms 4440 KB Output is correct
16 Correct 1 ms 4444 KB Output is correct
17 Correct 67 ms 13252 KB Output is correct
18 Correct 71 ms 12884 KB Output is correct
19 Correct 67 ms 13008 KB Output is correct
20 Correct 66 ms 13108 KB Output is correct
21 Correct 68 ms 13004 KB Output is correct
22 Correct 70 ms 12996 KB Output is correct
23 Correct 67 ms 13004 KB Output is correct
24 Correct 68 ms 13020 KB Output is correct
25 Correct 69 ms 12884 KB Output is correct
26 Correct 68 ms 12880 KB Output is correct