/ SeriousOJ /

Record Detail

Accepted


  
# Status Time Cost Memory Cost
#1 Accepted 1ms 548.0 KiB
#2 Accepted 59ms 568.0 KiB
#3 Accepted 88ms 1.289 MiB
#4 Accepted 87ms 1.496 MiB
#5 Accepted 90ms 1.289 MiB
#6 Accepted 85ms 1.293 MiB
#7 Accepted 88ms 1.301 MiB
#8 Accepted 85ms 1.285 MiB
#9 Accepted 85ms 1.289 MiB
#10 Accepted 85ms 1.297 MiB
#11 Accepted 85ms 1.066 MiB
#12 Accepted 85ms 1.285 MiB
#13 Accepted 85ms 1.297 MiB
#14 Accepted 85ms 1.297 MiB
#15 Accepted 85ms 1.297 MiB
#16 Accepted 87ms 1.289 MiB
#17 Accepted 84ms 1.297 MiB
#18 Accepted 84ms 1.293 MiB
#19 Accepted 84ms 1.062 MiB
#20 Accepted 85ms 1.297 MiB

Code

#include<bits/stdc++.h>
using namespace std;
#define ll long long int
int main()
{

    ll tc;
    cin>>tc;
    while(tc--)
    {
        ll n;
        cin>>n;
        vector<ll>v(n);
        ll s=0;
        for(int i=0;i<n;i++){ cin>>v[i];
                             s+=v[i];
                            }
        ll l=0,r=2e9,ans=-1;
        while(l<=r)
        {
            ll mid=(l+(r-l)/2);
            if((mid*(mid+1))/2<=s)
            {
                ans=mid+1;
                l=mid+1;
            }
            else
                r=mid-1;
        }
        cout<<ans<<endl;
    }


}

Information

Submit By
Type
Submission
Problem
P1114 Maximize the MEX
Language
C++17 (G++ 13.2.0)
Submit At
2024-11-09 07:21:43
Judged At
2024-11-11 02:22:35
Judged By
Score
100
Total Time
90ms
Peak Memory
1.496 MiB