# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
544718 | rainboy | Bowling (BOI15_bow) | C11 | 33 ms | 388 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <stdio.h>
#include <string.h>
#define N 10
#define S (N * 30)
int ss[N];
int ok(int i, int s) {
return i < 0 || ss[i] == -1 || ss[i] == s;
}
int eq(char a, char b) {
return a == '?' || a == b;
}
int main() {
int t;
scanf("%d", &t);
while (t--) {
static char cc[N * 2 + 2];
static long long dp[N][S + 1][4];
int n, i, s, a, b;
long long ans;
scanf("%d%s", &n, cc);
for (i = 0; i < n; i++)
scanf("%d", &ss[i]);
for (i = 0; i < n; i++)
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |