# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
495333 | VladM | Kangaroo (CEOI16_kangaroo) | C++14 | 1 ms | 204 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#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 (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |