# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
96885 | 2019-02-12T15:42:55 Z | Kastanda | Kangaroo (CEOI16_kangaroo) | C++11 | 2000 ms | 1096 KB |
// I do it for the glory #include<bits/stdc++.h> using namespace std; const int N = 205, Mod = 1e9 + 7; int dp[2][N][N][2]; inline int MOD(int a) { if (a >= Mod) a -= Mod; if (a < 0) a += Mod; return a; } int main() { int n, s, f; scanf("%d%d%d", &n, &s, &f); dp[0][1][2][0] = dp[0][2][1][1] = 1; for (int i = 3; i <= n; i ++) { bool w = i & 1; for (int st = 1; st <= i; st ++) for (int fn = 1; fn <= i; fn ++) if (fn != st) { dp[w][st][fn][0] = dp[w][st][fn][1] = 0; // 0 : for (int h = st + 1; h <= i; h ++) if (h != fn) dp[w][st][fn][0] = MOD(dp[!w][h-1][fn - (st < fn)][1] + dp[w][st][fn][0]); // 1 : for (int h = 1; h < st; h ++) if (h != fn) dp[w][st][fn][1] = MOD(dp[!w][h][fn - (st < fn)][0] + dp[w][st][fn][1]); } } return !printf("%d\n", MOD(dp[n & 1][s][f][0] + dp[n & 1][s][f][1])); }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 384 KB | Output is correct |
2 | Correct | 2 ms | 384 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 384 KB | Output is correct |
2 | Correct | 2 ms | 384 KB | Output is correct |
3 | Correct | 3 ms | 384 KB | Output is correct |
4 | Correct | 7 ms | 536 KB | Output is correct |
5 | Correct | 6 ms | 512 KB | Output is correct |
6 | Correct | 7 ms | 512 KB | Output is correct |
7 | Correct | 6 ms | 384 KB | Output is correct |
8 | Correct | 6 ms | 384 KB | Output is correct |
9 | Correct | 8 ms | 512 KB | Output is correct |
10 | Correct | 8 ms | 384 KB | Output is correct |
11 | Correct | 6 ms | 512 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 384 KB | Output is correct |
2 | Correct | 2 ms | 384 KB | Output is correct |
3 | Correct | 3 ms | 384 KB | Output is correct |
4 | Correct | 7 ms | 536 KB | Output is correct |
5 | Correct | 6 ms | 512 KB | Output is correct |
6 | Correct | 7 ms | 512 KB | Output is correct |
7 | Correct | 6 ms | 384 KB | Output is correct |
8 | Correct | 6 ms | 384 KB | Output is correct |
9 | Correct | 8 ms | 512 KB | Output is correct |
10 | Correct | 8 ms | 384 KB | Output is correct |
11 | Correct | 6 ms | 512 KB | Output is correct |
12 | Execution timed out | 2037 ms | 1096 KB | Time limit exceeded |
13 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 384 KB | Output is correct |
2 | Correct | 2 ms | 384 KB | Output is correct |
3 | Correct | 3 ms | 384 KB | Output is correct |
4 | Correct | 7 ms | 536 KB | Output is correct |
5 | Correct | 6 ms | 512 KB | Output is correct |
6 | Correct | 7 ms | 512 KB | Output is correct |
7 | Correct | 6 ms | 384 KB | Output is correct |
8 | Correct | 6 ms | 384 KB | Output is correct |
9 | Correct | 8 ms | 512 KB | Output is correct |
10 | Correct | 8 ms | 384 KB | Output is correct |
11 | Correct | 6 ms | 512 KB | Output is correct |
12 | Execution timed out | 2037 ms | 1096 KB | Time limit exceeded |
13 | Halted | 0 ms | 0 KB | - |