oj.uz

Submission #1110125

# Submission time Handle Problem Language Result Execution time Memory
1110125 2024-11-08T19:31:20 Z sofija6 Sure Bet (CEOI17_sure) C++14
60 / 100
 327 ms 32128 KB 
#include <bits/stdc++.h>
#define ll int
#define MAXN 1000010
using namespace std;
double a[MAXN],b[MAXN];
bool Cmp(double x,double y)
{
    return x>=y;
}
int main()
{
    ios::sync_with_stdio(false); cin.tie(0); cout.tie(0);
    ll n;
    cin >> n;
    for (ll i=1;i<=n;i++)
    {
        cin >> a[i] >> b[i];
        a[i]-=1;
        b[i]-=1;
    }
    sort(a+1,a+1+n,Cmp);
    sort(b+1,b+1+n,Cmp);
    double cura=0,curb=0,ans=0;
    ll posb=1;
    for (ll i=1;i<=n;i++)
    {
        cura+=a[i];
        curb--;
        while (posb<=n && min(cura-1,curb+b[posb])>=min(cura,curb))
        {
            curb+=b[posb];
            cura--;
            posb++;
        }
        ans=max(ans,min(cura,curb));
    }
    cout << fixed << setprecision(4) << ans;
    return 0;
}

Subtask #1
20.0 / 20.0

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

Subtask #2
40.0 / 40.0

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

Subtask #3
0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2384 KB Output is correct
2 Correct 1 ms 2556 KB Output is correct
3 Correct 1 ms 2384 KB Output is correct
4 Correct 1 ms 2384 KB Output is correct
5 Correct 1 ms 2384 KB Output is correct
6 Correct 1 ms 2384 KB Output is correct
7 Correct 1 ms 2384 KB Output is correct
8 Correct 1 ms 2384 KB Output is correct
9 Correct 1 ms 2384 KB Output is correct
10 Correct 1 ms 2384 KB Output is correct
11 Correct 1 ms 2384 KB Output is correct
12 Correct 2 ms 2552 KB Output is correct
13 Correct 1 ms 2384 KB Output is correct
14 Correct 1 ms 2384 KB Output is correct
15 Correct 2 ms 2384 KB Output is correct
16 Correct 2 ms 2384 KB Output is correct
17 Correct 56 ms 6532 KB Output is correct
18 Correct 55 ms 6800 KB Output is correct
19 Correct 51 ms 6636 KB Output is correct
20 Runtime error 327 ms 32128 KB Execution killed with signal 11
21 Halted 0 ms 0 KB -