| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1361905 | Charizard2021 | Subset Mex (EGOI22_subsetmex) | C++20 | 0 ms | 0 KiB |
#include<bits/stdc++.h>
using namespace std;
int main(){
long long t;
cin >> t;
while(t--){
long long n;
cin >> n;
vector<long long> f(n);
vector<long long> q(1 + n);
for(long long i =0 ; i < n; i++){
cin >> f[i];
}
q[n] = 1;
for(long long i = n - 1; i >= 0; i--){
long long sum = 0;
for(long long j : q){
sum += j;
}
q[i] = j;
q[i] = max(q[i] - f[i], 0LL);
}
long long sum = 0;
for(long long j : q){
sum += j;
}
cout << sum << "\n";
}
}