# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
96895 | 2019-02-12T16:08:22 Z | Kastanda | Kangaroo (CEOI16_kangaroo) | C++11 | 54 ms | 2424 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]; int ps[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 ++) { int w = i & 1; memset(ps, 0, sizeof(ps)); for (int st = 1; st <= i; st ++) for (int fn = 1; fn <= i; fn ++) { ps[st][fn][0] = MOD(ps[st-1][fn][0] + dp[!w][st][fn][0]); ps[st][fn][1] = MOD(ps[st-1][fn][1] + dp[!w][st][fn][1]); } for (int st = 1; st <= i; st ++) for (int fn = st + 1; fn <= i; fn ++) { dp[w][st][fn][0] = MOD(ps[i-1][fn-1][1] - ps[st-1][fn-1][1]); dp[w][st][fn][1] = ps[st-1][fn-1][0]; } for (int fn = 1; fn <= i; fn ++) for (int st = fn + 1; st <= i; st ++) { dp[w][st][fn][0] = dp[w][i - st + 1][i - fn + 1][1]; dp[w][st][fn][1] = dp[w][i - st + 1][i - fn + 1][0]; } } 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 | 3 ms | 640 KB | Output is correct |
2 | Correct | 3 ms | 640 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 3 ms | 640 KB | Output is correct |
2 | Correct | 3 ms | 640 KB | Output is correct |
3 | Correct | 3 ms | 768 KB | Output is correct |
4 | Correct | 3 ms | 768 KB | Output is correct |
5 | Correct | 3 ms | 796 KB | Output is correct |
6 | Correct | 4 ms | 768 KB | Output is correct |
7 | Correct | 3 ms | 740 KB | Output is correct |
8 | Correct | 4 ms | 768 KB | Output is correct |
9 | Correct | 4 ms | 768 KB | Output is correct |
10 | Correct | 4 ms | 768 KB | Output is correct |
11 | Correct | 4 ms | 896 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 3 ms | 640 KB | Output is correct |
2 | Correct | 3 ms | 640 KB | Output is correct |
3 | Correct | 3 ms | 768 KB | Output is correct |
4 | Correct | 3 ms | 768 KB | Output is correct |
5 | Correct | 3 ms | 796 KB | Output is correct |
6 | Correct | 4 ms | 768 KB | Output is correct |
7 | Correct | 3 ms | 740 KB | Output is correct |
8 | Correct | 4 ms | 768 KB | Output is correct |
9 | Correct | 4 ms | 768 KB | Output is correct |
10 | Correct | 4 ms | 768 KB | Output is correct |
11 | Correct | 4 ms | 896 KB | Output is correct |
12 | Correct | 44 ms | 1268 KB | Output is correct |
13 | Correct | 35 ms | 1232 KB | Output is correct |
14 | Correct | 46 ms | 1276 KB | Output is correct |
15 | Correct | 38 ms | 1248 KB | Output is correct |
16 | Correct | 38 ms | 1272 KB | Output is correct |
17 | Correct | 46 ms | 1272 KB | Output is correct |
18 | Correct | 33 ms | 1264 KB | Output is correct |
19 | Correct | 47 ms | 1260 KB | Output is correct |
20 | Correct | 44 ms | 1316 KB | Output is correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 3 ms | 640 KB | Output is correct |
2 | Correct | 3 ms | 640 KB | Output is correct |
3 | Correct | 3 ms | 768 KB | Output is correct |
4 | Correct | 3 ms | 768 KB | Output is correct |
5 | Correct | 3 ms | 796 KB | Output is correct |
6 | Correct | 4 ms | 768 KB | Output is correct |
7 | Correct | 3 ms | 740 KB | Output is correct |
8 | Correct | 4 ms | 768 KB | Output is correct |
9 | Correct | 4 ms | 768 KB | Output is correct |
10 | Correct | 4 ms | 768 KB | Output is correct |
11 | Correct | 4 ms | 896 KB | Output is correct |
12 | Correct | 44 ms | 1268 KB | Output is correct |
13 | Correct | 35 ms | 1232 KB | Output is correct |
14 | Correct | 46 ms | 1276 KB | Output is correct |
15 | Correct | 38 ms | 1248 KB | Output is correct |
16 | Correct | 38 ms | 1272 KB | Output is correct |
17 | Correct | 46 ms | 1272 KB | Output is correct |
18 | Correct | 33 ms | 1264 KB | Output is correct |
19 | Correct | 47 ms | 1260 KB | Output is correct |
20 | Correct | 44 ms | 1316 KB | Output is correct |
21 | Runtime error | 54 ms | 2424 KB | Execution killed with signal 11 (could be triggered by violating memory limits) |
22 | Halted | 0 ms | 0 KB | - |