# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
966415 | 2024-04-19T20:25:32 Z | vjudge1 | Kangaroo (CEOI16_kangaroo) | C++17 | 0 ms | 348 KB |
// 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[N][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][j] = 1; else if(i == s || i == f){ dp[i][j] = dp[i-1][j-1] + dp[i-1][j]; } else{ x = j+1; if(i>s) x--; if(i>f) x--; dp[i][j] = dp[i-1][j+1]*j + dp[i-1][j-1]*x; } dp[i][j] %= mod; } } cout << dp[n][1] << "\n"; } int main(){ FAST_IO int t = 1; //cin >> t; for(int tc = 1;tc<=t;tc++){ solve(tc); } return 0; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 344 KB | Output is correct |
2 | Incorrect | 0 ms | 348 KB | Output isn't correct |
3 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 344 KB | Output is correct |
2 | Incorrect | 0 ms | 348 KB | Output isn't correct |
3 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 344 KB | Output is correct |
2 | Incorrect | 0 ms | 348 KB | Output isn't correct |
3 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 344 KB | Output is correct |
2 | Incorrect | 0 ms | 348 KB | Output isn't correct |
3 | Halted | 0 ms | 0 KB | - |