# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
444452 | cpp219 | Kangaroo (CEOI16_kangaroo) | C++14 | 16 ms | 31820 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.
#pragma GCC optimization O2
#pragma GCC optimization "unroll-loop"
#pragma target ("avx2")
#include <bits/stdc++.h>
#define ll long long
#define ld long double
#define fs first
#define sc second
using namespace std;
typedef pair<ll,ll> LL;
const ll N = 2e3 + 9;
const ll Log2 = 20;
const ll mod = 1e9 + 7;
ll n,s,e,dp[N][N];
ll f(ll pos,ll g){
if (pos == n + 1) return !g;
if (dp[pos][g] != -1) return dp[pos][g];
ll ans = 0;
if (pos > e){
if (g) ans = f(pos + 1,g - 1);
ans = (ans + f(pos + 1,g + 1) * g * (g + 1))%mod;
}
else if (pos == e) ans = (f(pos + 1,g) + f(pos + 1,g + 1)*(g + 1))%mod;
else if (pos > s){
if (g) ans = f(pos + 1,g - 1);
ans = (ans + f(pos + 1,g + 1) * (g + 1) * (g + 1))%mod;
}
else if (pos == s) ans = (f(pos + 1,g) + f(pos + 1,g + 1)*(g + 1))%mod;
else if (pos < s){
if (g) ans = f(pos + 1,g - 1);
ans = (ans + f(pos + 1,g + 1) * (g + 2) * (g + 1))%mod;
}
return dp[pos][g] = ans;
}
int main(){
ios_base::sync_with_stdio(NULL); cin.tie(0); cout.tie(0);
#define task "test"
if (fopen(task".INP","r")){
freopen(task".INP","r",stdin);
freopen(task".OUT","w",stdout);
}
cin>>n>>s>>e; memset(dp,-1,sizeof(dp));
if (s < e) swap(s,e);
cout<<f(2,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... |