Submission #747688

#TimeUsernameProblemLanguageResultExecution timeMemory
747688Trisanu_DasCalvinball championship (CEOI15_teams)C++17
0 / 100
410 ms352 KiB
#include <bits/stdc++.h> using namespace std; #define MOD 1000007 int main() { int n, mx = 0; cin >> n; int dp[n], a[n]; for (int i = 0; i < n; i++) cin >> a[i]; for (int i = 0; i < n; i++) { for (int j = n; j >= 2; j--) dp[j] = (1ll * dp[j] * j % MOD + dp[j - 1]) % MOD; dp[mx] = (dp[mx] + a[i] - 1) % MOD, mx = max(mx, a[i]); } int ans = 0; for (int i = 1; i <= n; i++) ans = (ans + dp[i]) % MOD; cout << ans + 1 << '\n'; }
#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...