# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
946623 | 2024-03-14T20:14:46 Z | vjudge1 | Kangaroo (CEOI16_kangaroo) | C++17 | 0 ms | 348 KB |
#include <bits/stdc++.h> using namespace std; using LL = long long; using PII = pair<int, int>; const int N = 4000; const int M = 1e9 + 7; int dp[N][N]; int main() { ios::sync_with_stdio(0); cin.tie(0); int n, cs, cf; cin >> n >> cs >> cf; dp[1][1] = 1; for(int i = 2; i <= n; ++i){ for(int j = 1; j <= i; ++j){ if(i == cs or i == cf) dp[i][j] = dp[i - 1][j] + dp[i - 1][j - 1]; else { dp[i][j] += 1LL*dp[i - 1][j + 1] * j % M ; //merging of two component dp[i][j] += 1LL*dp[i - 1][j - 1] * (j-2 + i < cf + i < cs ) % M; // start of a new component } dp[i][j] %= M; } } cout << dp[n][1]<<"\n"; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 348 KB | Output is correct |
2 | Incorrect | 0 ms | 348 KB | Output isn't correct |
3 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 348 KB | Output is correct |
2 | Incorrect | 0 ms | 348 KB | Output isn't correct |
3 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 348 KB | Output is correct |
2 | Incorrect | 0 ms | 348 KB | Output isn't correct |
3 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 348 KB | Output is correct |
2 | Incorrect | 0 ms | 348 KB | Output isn't correct |
3 | Halted | 0 ms | 0 KB | - |