Submission #1362447

#TimeUsernameProblemLanguageResultExecution timeMemory
1362447hsuan._.0528Subset Mex (EGOI22_subsetmex)C++20
0 / 100
1095 ms344 KiB
#include<bits/stdc++.h>
using namespace std;
#define LL long long
const int maxn =3e5+10;

LL t, n, ans=0;
LL d[maxn];

void dfs(int x){
    if(d[x]<=0)  return;
    for(int i=0; i<x; i++){
        d[i]++;
    }
    for(int i=0; i<x; i++){
        if(d[i]>0)  dfs(i);
    }
    ans++;
    d[x]--;
}

void solve(){
    cin>>n;
    ans=0;
    for(int i=0; i<n; i++)  cin>>d[i], d[i]*=-1;
    d[n]++;
    dfs(n);
    cout<<ans<<"\n";
}

signed main(){
    ios_base::sync_with_stdio(0);  cin.tie(0);

    cin>>t;
    while(t--)  solve();
    return 0;
}
#Result Execution timeMemoryGrader output
Fetching results...
#Result Execution timeMemoryGrader output
Fetching results...
#Result Execution timeMemoryGrader output
Fetching results...
#Result Execution timeMemoryGrader output
Fetching results...
#Result Execution timeMemoryGrader output
Fetching results...
#Result Execution timeMemoryGrader output
Fetching results...
#Result Execution timeMemoryGrader output
Fetching results...
#Result Execution timeMemoryGrader output
Fetching results...