# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
554293 | hibiki | Kangaroo (CEOI16_kangaroo) | C++11 | 53 ms | 32372 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 MOD 1000000007
int n,s,t;
long dp[2020][2020];
long solve(int lv,int g)
{
if(lv==0)return 0;
long &now = dp[lv][g];
if(now!=-1)return now;
if(lv==1)return now=(g==1?1:0);
if(lv==s||lv==t)
return now=(solve(lv-1,g-1)+solve(lv-1,g))%MOD;
return now=(solve(lv-1,g+1)*g + solve(lv-1,g-1)*(g-(lv>s?1:0)-(lv>t?1:0)))%MOD;
}
main()
{
// freopen("kangaroo.in","r",stdin);
// freopen("kangaroo.out","w",stdout);
memset(dp,-1,sizeof(dp));
scanf("%d %d %d",&n,&s,&t);
printf("%ld\n",solve(n,1));
}
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... |