/ SeriousOJ /

Record Detail

Wrong Answer


  
# Status Time Cost Memory Cost
#1 Accepted 1ms 532.0 KiB
#2 Wrong Answer 32ms 532.0 KiB
#3 Wrong Answer 34ms 1.297 MiB

Code


//on the name of Allah:)
#include<bits/stdc++.h>
#define int         long long
#define Endl        "\n"
#define pi          2 * acos(0.0)
#define mod         1000000007
#define Mul(a,b)    (a%mod * b%mod)%mod
#define Add(a,b)    (a%mod + b%mod)%mod
#define all(x)      (x).begin(),(x).end()
#define allr(x)     (x).rbegin(),(x).rend()
#define gcd(x, y)   (__gcd(x, y))
#define lcm(x, y)   ((x/gcd(x, y))*y)
#define faster      cin.tie(NULL), cout.tie(NULL);
#define TC          int t ; cin>>t ; for(int i=1;i<=t;i++)
const int N = 1e6 + 7;
using namespace std;
void s()
{
    int n;
    cin>>n;
    vector<int>v(n);
    int cnt=0;
    int z=0;


    for(int i=0; i<n; i++)
    {
        cin>>v[i];
        cnt+=v[i];
        if(v[i]==0)z=1;
    }

    if(z==0)
    {
        cout<<0<<endl;
        return;
    }

    double root = (-1 + sqrt(1 + 8 * cnt)) / 2;
    int xxx;
    xxx=root;

    if(root>xxx)cout<<root<<endl;
    else

        cout<<root+1<<endl;





}



int32_t main()
{
    ios::sync_with_stdio(false);
    //faster
    TC
    {
        //cout<<"Case "<<i<<": ";
        s();

    }



}





Information

Submit By
Type
Submission
Problem
P1114 Maximize the MEX
Language
C++17 (G++ 13.2.0)
Submit At
2024-11-05 17:06:33
Judged At
2024-11-05 17:06:33
Judged By
Score
5
Total Time
34ms
Peak Memory
1.297 MiB