Submission #1118200

#TimeUsernameProblemLanguageResultExecution timeMemory
1118200vjudge1Kangaroo (CEOI16_kangaroo)C++17
0 / 100
1 ms504 KiB
#include <bits/stdc++.h> using namespace std; #define int long long #define ld double const int INF = 1e18; const int mod = 1e9 + 7; signed main() { ios_base::sync_with_stdio(0); cin.tie(0); int n, s , f; cin >> n >> s >> f; int dp[n + 1][n + 1]; for(int i = 1;i <= n;i++) { for(int j = 1;j <= n;j++) dp[i][j] = 0; } dp[1][1] = 1; int cnt = 0; for(int i = 1;i <= n;i++) { for(int j = 1;j < i;j++) { if(i == s or i == f) { cnt++; dp[i][j + 1] += dp[i - 1][j]; dp[i][j + 1] %= mod; dp[i][j] += dp[i - 1][j]; dp[i][j] %= mod; } else { dp[i][j + 1] += dp[i - 1][j] * (j + 1 - cnt); dp[i][j + 1] %= mod; dp[i][j - 1] += dp[i - 1][j] * (j - 1); dp[i][j - 1] %= mod; } } } cout << dp[n][1] << 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...