/ SeriousOJ /

Record Detail

Accepted


  
# Status Time Cost Memory Cost
#1 Accepted 1ms 532.0 KiB
#2 Accepted 17ms 572.0 KiB
#3 Accepted 23ms 532.0 KiB
#4 Accepted 21ms 324.0 KiB
#5 Accepted 21ms 348.0 KiB
#6 Accepted 21ms 320.0 KiB
#7 Accepted 21ms 560.0 KiB
#8 Accepted 21ms 564.0 KiB
#9 Accepted 21ms 564.0 KiB
#10 Accepted 21ms 532.0 KiB
#11 Accepted 21ms 560.0 KiB
#12 Accepted 22ms 564.0 KiB
#13 Accepted 21ms 560.0 KiB
#14 Accepted 22ms 560.0 KiB
#15 Accepted 21ms 556.0 KiB
#16 Accepted 21ms 764.0 KiB
#17 Accepted 21ms 764.0 KiB
#18 Accepted 21ms 556.0 KiB
#19 Accepted 21ms 320.0 KiB
#20 Accepted 21ms 560.0 KiB

Code

#include<bits/stdc++.h>
#define endl        '\n'
#define F           first
#define S           second
#define pb          push_back
#define yes         cout<<"YES\n"
#define no          cout<<"NO\n"
#define all(x)      x.begin(),x.end()
#define allr(x)     x.rbegin(),x.rend()
#define error1(x)   cerr<<#x<<" = "<<(x)<<endl
#define error2(a,b) cerr<<"("<<#a<<", "<<#b<<") = ("<<(a)<<", "<<(b)<<")\n";
#define coutall(v)  for(auto &it: v) cout << it << " "; cout << endl;
using namespace std;
using ll = long long;
using ld = long double;

void solve() {
    ll n, sum = 0;
    cin >> n;
    for (int i = 0; i < n; i++) {
        ll x; cin >> x;
        sum += x;
    }
    __int128_t lo = 1, hi = 1e15, mid, ans = 0;
    while(lo <= hi) {
        mid = lo + hi >> 1;

        if((mid * (mid + 1) >> 1) <= sum) {
            lo = mid + 1;
            ans = mid;
        }
        else hi = mid - 1;
    }
    cout << ll(ans + 1) << endl;
    return;
}

signed main() {
    ios::sync_with_stdio(false); cin.tie(0);
    int tc = 1;
    cin >> tc;
    for (int t = 1; t <= tc; t++) {
        // cout << "Case " << t << ": ";
        solve();
    }
    return 0;
}

Information

Submit By
Type
Submission
Problem
P1114 Maximize the MEX
Contest
Brain Booster #7
Language
C++17 (G++ 13.2.0)
Submit At
2024-11-05 15:21:38
Judged At
2024-11-11 02:30:49
Judged By
Score
100
Total Time
23ms
Peak Memory
764.0 KiB