oj.uz

Submission #710998

# Submission time Handle Problem Language Result Execution time Memory
710998 2023-03-16T07:00:44 Z ToroTN Sure Bet (CEOI17_sure) C++14
0 / 100
 1 ms 212 KB 
#include<bits/stdc++.h>
using namespace std;
#define pb push_back
int n,st,md,ed;
double a,b,ans=0;
vector<double> v1,v2;
int main()
{
    scanf("%d",&n);
    for(int i=1;i<=n;i++)
    {
        scanf("%lf%lf",&a,&b);
        v1.pb(-a),v2.pb(-b);
    }
    v1.pb(-1e9),v2.pb(-1e9);
    sort(v1.begin(),v1.end());
    sort(v2.begin(),v2.end());
    for(int i=1;i<=n;i++)v1[i]=-v1[i],v2[i]=-v2[i];
    for(int i=2;i<=n;i++)v1[i]=v1[i-1]+v1[i],v2[i]=v2[i-1]+v2[i];
    /*for(int i=1;i<=n;i++)
    {
        printf("%lf %lf\n",v1[i],v2[i]);
    }*/
    for(int i=1;i<=2*n;i++)
    {
        st=0,ed=i;
        while(ed>=st)
        {
            md=(st+ed)/2;
            if(st>n)
            {
                ed=md-1;
                continue;
            }
            if(i-st>n)
            {
                st=md+1;
                continue;
            }
            if(v1[st]<v2[i-st])
            {
                st=md+1;
            }else
            {
                ed=md-1;
            }
        }
        //printf("i=%d\n",i);
        //printf("%d %d %d\n",st,md,ed);
        if(st>=1&&st<=n&&i-st>=1&&i-st<=n)
        {
            ans=max(ans,min(v1[st],v2[i-st])-i);
        }
        st-=1;
        if(st>=1&&st<=n&&i-st>=1&&i-st<=n)
        {
            ans=max(ans,min(v1[st],v2[i-st])-i);
        }
    }
    printf("%.4f\n",ans);
}

Compilation message

sure.cpp: In function 'int main()':
sure.cpp:9:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
    9 |     scanf("%d",&n);
      |     ~~~~~^~~~~~~~~
sure.cpp:12:14: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   12 |         scanf("%lf%lf",&a,&b);
      |         ~~~~~^~~~~~~~~~~~~~~~

Subtask #1
0 / 20.0

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

Subtask #2
0 / 40.0

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

Subtask #3
0 / 40.0

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