# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
318187 | 2020-10-31T15:23:39 Z | a14789654 | Kangaroo (CEOI16_kangaroo) | C++17 | 34 ms | 14316 KB |
///https://oj.uz/problem/view/CEOI16_kangaroo #include <bits/stdc++.h> using namespace std; const int MAXN = 2007, MOD = 1e9 + 7; int cs, cf, n, f[MAXN][MAXN]; void add(int &a, int b) { a += b; if (a >= MOD) a -= MOD; } int main() { if (fopen("tst.inp", "r")) { freopen("tst.inp", "r", stdin); freopen("tst.out", "w", stdout); } ios_base::sync_with_stdio(0); cin.tie(0), cout.tie(0); cin >> n >> cs >> cf; if (cs > cf) swap(cs, cf); f[1][0] = 1; for (int i = 1; i <= n; ++i) for (int j = 0; j <= i; ++j) if (i != cs && i != cf) { if (i < n && j) add(f[i + 1][j - 1], 1LL * f[i][j] * j * (j - 1) % MOD); if (i < n && j < n) add(f[i + 1][j + 1], f[i][j]); if (i > cs && i < n && j) add(f[i + 1][j - 1], 1LL * f[i][j] * j % MOD); if (i > cf && i < n && j) add(f[i + 1][j - 1], 1LL * f[i][j] * j % MOD); } else { add(f[i + 1][j], f[i][j]); if (j) add(f[i + 1][j - 1], 1LL * f[i][j] * j % MOD); } cout << f[n][0]; return 0; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 364 KB | Output is correct |
2 | Correct | 1 ms | 364 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 364 KB | Output is correct |
2 | Correct | 1 ms | 364 KB | Output is correct |
3 | Correct | 1 ms | 492 KB | Output is correct |
4 | Correct | 1 ms | 492 KB | Output is correct |
5 | Correct | 1 ms | 492 KB | Output is correct |
6 | Correct | 1 ms | 492 KB | Output is correct |
7 | Correct | 1 ms | 492 KB | Output is correct |
8 | Correct | 1 ms | 492 KB | Output is correct |
9 | Correct | 1 ms | 492 KB | Output is correct |
10 | Correct | 1 ms | 492 KB | Output is correct |
11 | Correct | 1 ms | 492 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 364 KB | Output is correct |
2 | Correct | 1 ms | 364 KB | Output is correct |
3 | Correct | 1 ms | 492 KB | Output is correct |
4 | Correct | 1 ms | 492 KB | Output is correct |
5 | Correct | 1 ms | 492 KB | Output is correct |
6 | Correct | 1 ms | 492 KB | Output is correct |
7 | Correct | 1 ms | 492 KB | Output is correct |
8 | Correct | 1 ms | 492 KB | Output is correct |
9 | Correct | 1 ms | 492 KB | Output is correct |
10 | Correct | 1 ms | 492 KB | Output is correct |
11 | Correct | 1 ms | 492 KB | Output is correct |
12 | Correct | 1 ms | 1260 KB | Output is correct |
13 | Correct | 1 ms | 1132 KB | Output is correct |
14 | Correct | 1 ms | 1260 KB | Output is correct |
15 | Correct | 2 ms | 1260 KB | Output is correct |
16 | Correct | 1 ms | 1388 KB | Output is correct |
17 | Correct | 1 ms | 1408 KB | Output is correct |
18 | Correct | 1 ms | 1132 KB | Output is correct |
19 | Correct | 1 ms | 1260 KB | Output is correct |
20 | Correct | 1 ms | 1260 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 364 KB | Output is correct |
2 | Correct | 1 ms | 364 KB | Output is correct |
3 | Correct | 1 ms | 492 KB | Output is correct |
4 | Correct | 1 ms | 492 KB | Output is correct |
5 | Correct | 1 ms | 492 KB | Output is correct |
6 | Correct | 1 ms | 492 KB | Output is correct |
7 | Correct | 1 ms | 492 KB | Output is correct |
8 | Correct | 1 ms | 492 KB | Output is correct |
9 | Correct | 1 ms | 492 KB | Output is correct |
10 | Correct | 1 ms | 492 KB | Output is correct |
11 | Correct | 1 ms | 492 KB | Output is correct |
12 | Correct | 1 ms | 1260 KB | Output is correct |
13 | Correct | 1 ms | 1132 KB | Output is correct |
14 | Correct | 1 ms | 1260 KB | Output is correct |
15 | Correct | 2 ms | 1260 KB | Output is correct |
16 | Correct | 1 ms | 1388 KB | Output is correct |
17 | Correct | 1 ms | 1408 KB | Output is correct |
18 | Correct | 1 ms | 1132 KB | Output is correct |
19 | Correct | 1 ms | 1260 KB | Output is correct |
20 | Correct | 1 ms | 1260 KB | Output is correct |
21 | Correct | 6 ms | 3968 KB | Output is correct |
22 | Correct | 6 ms | 4204 KB | Output is correct |
23 | Correct | 6 ms | 4588 KB | Output is correct |
24 | Correct | 30 ms | 14316 KB | Output is correct |
25 | Correct | 31 ms | 14188 KB | Output is correct |
26 | Correct | 30 ms | 14180 KB | Output is correct |
27 | Correct | 34 ms | 14060 KB | Output is correct |
28 | Correct | 20 ms | 10220 KB | Output is correct |