# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
966421 | vjudge1 | Kangaroo (CEOI16_kangaroo) | C++17 | 6 ms | 656 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.
// In the name of Almighty Allah.
// We're nothing and you're everything.
// Allahu Akbar
#include <bits/stdc++.h>
using namespace std;
#define PI acos(-1.0)
#define FAST_IO ios_base::sync_with_stdio(0);cin.tie(0);
typedef long long ll;
typedef pair<int,int> pii;
typedef tuple<int,int,int> tii;
const int N = 2e3+5;
const ll mod = 1e9+7;
ll dp[2][N];
void solve(int tc){
ll i,j,k,n,m,x,y,s,f,l;
cin >> n >> s >> f;
for(i=1;i<=n;i++){
for(j=1;j<=i;j++){
if(i == 1 && j == 1) dp[i&1][j] = 1;
else if(i == s || i == f){
dp[i&1][j] = dp[(i-1)&1][j-1] + dp[(i-1)&1][j];
}
else{
x = j;
if(i>s) x--;
if(i>f) x--;
dp[i&1][j] = dp[(i-1)&1][j+1]*j + dp[(i-1)&1][j-1]*x;
}
dp[i&1][j] %= mod;
}
}
cout << dp[n&1][1] << "\n";
}
int main(){
FAST_IO
int t = 1;
//cin >> t;
for(int tc = 1;tc<=t;tc++){
solve(tc);
}
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... |