# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
486367 | 2021-11-11T12:40:35 Z | rainboy | Žarulje (COI15_zarulje) | C | 793 ms | 34028 KB |
#include <stdio.h> #define N 200000 #define SMALL 2000 #define MD 1000000007 int main() { static int aa[N], dp[SMALL][SMALL]; int n, k, i, j; scanf("%d%d", &n, &k); for (i = 0; i < n; i++) scanf("%d", &aa[i]); for (i = 0; i < n; i++) for (j = n - 1; j >= 0; j--) if (i == 0 && j == n - 1) dp[i][j] = 1; else if (i == 0) dp[i][j] = dp[i][j + 1]; else if (j == n - 1) dp[i][j] = dp[i - 1][j]; else if (aa[i] > aa[j]) dp[i][j] = dp[i - 1][j]; else if (aa[i] < aa[j]) dp[i][j] = dp[i][j + 1]; else dp[i][j] = (dp[i - 1][j] + dp[i][j + 1]) % MD; while (k--) { scanf("%d", &i), i--; printf("%d\n", dp[i][i]); } return 0; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 1 ms | 716 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Runtime error | 793 ms | 34028 KB | Execution killed with signal 11 |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 1 ms | 716 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |