# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
495333 | 2021-12-18T13:16:22 Z | VladM | Kangaroo (CEOI16_kangaroo) | C++14 | 1 ms | 204 KB |
#include <bits/stdc++.h> using namespace std; #define modulo 1000000007 long long n, dp[2007][2007], f, cs, cf; int main() { freopen("kangaroo.in", "r", stdin); freopen("kangaroo.out", "w", stdout); cin>>n>>cs>>cf; dp[0][0]=1; for(long long i=1; i<=n; i++){ for(long long j=1; j<=n; j++){ if(i==cs || i==cf){ dp[i][j]=(dp[i-1][j-1]+dp[i-1][j])%modulo; continue; } if(i<cs) dp[i][j]=j*(dp[i-1][j-1]+dp[i-1][j+1]); else if(i<cf) dp[i][j]=dp[i-1][j-1]*(j-1)+dp[i-1][j+1]*j; else dp[i][j]=dp[i-1][j-1]*(j-2)+dp[i-1][j+1]*j; dp[i][j]%=modulo; } } cout<<dp[n][1]; return 0; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 1 ms | 204 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 1 ms | 204 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 1 ms | 204 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 1 ms | 204 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |