Submission #617460

#TimeUsernameProblemLanguageResultExecution timeMemory
617460ollelCalvinball championship (CEOI15_teams)C++14
50 / 100
4 ms724 KiB
#include <bits/stdc++.h> using namespace std; typedef vector<int> vi; typedef vector<vi> vvi; typedef long long ll; #define rep(i,a,b) for(int i = a; i < b; i++) const ll MOD = 1000007; const int MAXN = 100; int main() { int n; cin >> n; vector<vector<ll>> dp(MAXN + 5, vector<ll>(MAXN + 5, 1)); rep(i,0,MAXN+1) dp[1][i] = i+1; rep(x,2,MAXN+1) { rep(y,0,MAXN+1) { dp[x][y] = (y * dp[x - 1][y] + dp[x - 1][y + 1]) % MOD; } } vi state(n); rep(i,0,n) cin >> state[i]; ll ans = 1; int MAX = 1, LEFT = n; rep(i,0,n) { ans = (ans + (state[i] - 1) * dp[LEFT - 1][MAX]) % MOD; MAX = max(MAX, state[i]); LEFT--; } cout << ans << endl; }
#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...