# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
230111 | Kastanda | Bowling (BOI15_bow) | C++11 | 117 ms | 3456 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.
// Pinkie Pied!
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = 11;
int n, A[N];
ll dp[N][N][N][279];
char S[N * 2];
int main()
{
int q;
scanf("%d", &q);
for (; q; q --)
{
memset(S, 0, sizeof(S));
memset(A, 0, sizeof(A));
scanf("%d%s", &n, S);
for (int i = 1; i <= n; i ++)
scanf("%d", &A[i]);
memset(dp, 0, sizeof(dp));
for (int a = 0; a < 10; a ++)
for (int b = 0; a + b <= 10; b ++)
dp[0][a][b][0] = 1;
for (int b = 0; b <= 10; b ++)
dp[0][10][b][0] = 1;
A[0] = -1;
ll tot = 0;
for (int i = 0; i <= n - 2; i ++)
{
int le = 0, ri = 30 * 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... |