Submission #1291289

#TimeUsernameProblemLanguageResultExecution timeMemory
1291289LudisseyCalvinball championship (CEOI15_teams)C++20
0 / 100
63 ms131072 KiB
#include <bits/stdc++.h> #define int long long #define sz(a) (int)a.size() #define all(a) a.begin(), a.end() #define rall(a) a.rbegin(), a.rend() using namespace std; const int MOD=1e9+7; signed main() { ios_base::sync_with_stdio(false); cin.tie(nullptr); int n; cin >> n; vector<vector<int>> dp(n+1,vector<int>(n+1,0)); vector<int> a(n); dp[0][0]=1; for (int i = 0; i < n; i++) cin >> a[i]; for (int i = 0; i < n; i++) cin >> a[i]; for (int i = 1; i <= n; i++) { for (int j = 1; j <= n; j++) { dp[i][j]=(dp[i-1][j]*min(j,a[i-1])+dp[i-1][j-1]*(a[i-1]>=j))%MOD; } } int sm=0; for (int i = 1; i <= n; i++) sm+=dp[n][i]; cout << sm-1 << "\n"; return 0; }
#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...