oj.uz

Submission #1027305

# Submission time Handle Problem Language Result Execution time Memory
1027305 2024-07-19T03:27:21 Z hehebjp123 Sure Bet (CEOI17_sure) C++14
0 / 100
 1 ms 2648 KB 
#include<bits/stdc++.h>
#pragma GCC optimize("Ofast,O3,unroll-loops")
#define double long double
#define ll long long
#define fi first
#define se second
#define ii pair<ll,ll>
#define pb push_back
using namespace std;
const ll N=2e5+5;
const long long mod=1e9+7;
const double esp=1e-12;
double a[N],b[N];
ll vta,vtb,i,j,n;
bool kt(double k)
{
    for(ll i=1;i<=n;i++)
    if(a[i]>=k)
    {
    ll l=1,r=n,vt;
    double tmp=i;
    if(b[n]-tmp<k) continue;
    while(l<=r)
    {
        ll mid=(l+r)/2;
        if(b[mid]-tmp>=k)
        {
            vt=mid;
            r=mid-1;
        }
        else l=mid+1;
    }
    tmp=vt;
    if(a[i]-tmp>=k) return 1;
    }
    return 0;
}
int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    cout.tie(nullptr);
    cin>>n;
    for(i=1;i<=n;i++){
        cin>>a[i]>>b[i];
    }
    sort(a+1,a+n+1,greater<double>());
    sort(b+1,b+n+1,greater<double>());
    a[1]-=1;
    b[1]-=1;
    for(i=2;i<=n;i++)
    {
        a[i]+=a[i-1]-1;
        b[i]+=b[i-1]-1;
    }
    //return cout<<kt(0.5),0;
    double l=0,r=1e8,kq=0;
    while(l<r-esp)
    {
        double mid=(l+r)/2;
       // cout<<l<<" "<<r<<" "<<mid<<'\n';
        if(kt(mid))
        {
            kq=mid;
            l=mid+esp;
        }
        else r=mid-esp;
    }
cout<<setprecision(4)<<fixed<<kq;
}
/*
min(a[x]-x-y,b[y]-x-y)
*/

Compilation message

sure.cpp: In function 'bool kt(long double)':
sure.cpp:33:8: warning: 'vt' may be used uninitialized in this function [-Wmaybe-uninitialized]
   33 |     tmp=vt;
      |     ~~~^~~
sure.cpp: In function 'int main()':
sure.cpp:33:8: warning: 'vt' may be used uninitialized in this function [-Wmaybe-uninitialized]
   33 |     tmp=vt;
      |     ~~~^~~
sure.cpp:20:16: note: 'vt' was declared here
   20 |     ll l=1,r=n,vt;
      |                ^~

Subtask #1
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2648 KB Output is correct
2 Correct 1 ms 2396 KB Output is correct
3 Correct 1 ms 2396 KB Output is correct
4 Correct 1 ms 2396 KB Output is correct
5 Correct 1 ms 2396 KB Output is correct
6 Incorrect 1 ms 2392 KB Output isn't correct
7 Halted 0 ms 0 KB -

Subtask #2
0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2648 KB Output is correct
2 Correct 1 ms 2396 KB Output is correct
3 Correct 1 ms 2396 KB Output is correct
4 Correct 1 ms 2396 KB Output is correct
5 Correct 1 ms 2396 KB Output is correct
6 Incorrect 1 ms 2392 KB Output isn't correct
7 Halted 0 ms 0 KB -

Subtask #3
0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2648 KB Output is correct
2 Correct 1 ms 2396 KB Output is correct
3 Correct 1 ms 2396 KB Output is correct
4 Correct 1 ms 2396 KB Output is correct
5 Correct 1 ms 2396 KB Output is correct
6 Incorrect 1 ms 2392 KB Output isn't correct
7 Halted 0 ms 0 KB -