Submission #746904

#TimeUsernameProblemLanguageResultExecution timeMemory
746904vjudge1Calvinball championship (CEOI15_teams)C++17
0 / 100
32 ms65540 KiB
#include <bits/stdc++.h> #include <ext/pb_ds/assoc_container.hpp> #include <ext/pb_ds/tree_policy.hpp> #define int long long #define endl '\n' using namespace std; using namespace __gnu_pbds; using ordered_set = tree<int,null_type,less<int>,rb_tree_tag,tree_order_statistics_node_update>; int SLV[10001][10001]; int slv(int a,int b){ if(b==0)return 1; if(SLV[a][b]!=-1)return SLV[a][b]; return SLV[a][b]=(slv(a+1,b-1)+slv(a,b-1)*a)%1000000007; } signed main(){ ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0); memset(SLV,-1,sizeof SLV); int n; cin>>n; int arr[n]; for(auto &i:arr)cin>>i; int ans=1; int pw[n+1]; pw[0]=1; for(int i=1;i<=n;i++)pw[i]=(pw[i-1]*2)%1000000007; for(int i=0;i<n;i++){ for(int w=1;w<arr[i];w++)ans+=slv(w,n-i-1); ans%=1000000007; } cout<<ans; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...