Submission #1353729

#	Time	Username	Problem	Language	Result	Execution time	Memory
1353729		Francisco_Martin	Subset Mex (EGOI22_subsetmex)	C++20	100 / 100	2 ms	348 KiB

Main

//EGOI 2022 SubsetMex
//https://qoj.ac/contest/2259/problem/5178

#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vll = vector<ll>;

void solve(){
    ll n, cur=1, ans=1;
    cin >> n;
    vll A(n);
    for(int i=0; i<n; i++) cin >> A[i];
    for(int i=n-1; i>=0; i--) ans+=max(0ll,cur-A[i]), cur+=max(0ll,cur-A[i]);
    cout << ans << "\n";
}

int main(){
    ll tt;
    cin >> tt;
    while(tt--) solve();
    return 0;
}

• Subtask 1: 5 / 5
• Subtask 2: 17 / 17
• Subtask 3: 7 / 7
• Subtask 4: 9 / 9
• Subtask 5: 20 / 20
• Subtask 6: 9 / 9
• Subtask 7: 10 / 10
• Subtask 8: 23 / 23