#include <bits/stdc++.h>
#pragma GCC optimize("unroll-loops")
#pragma GCC target("avx2")
using namespace std;
#define int long long
int dp[11][301][11][11][32];
int sdp[11][301][31][11],sumdp[11][301][31];
int n;
char a[25];
int v[15];
int kk[105][105][105];
bool ok(int x,int pos,int prec)
{
if (kk[x][pos][prec + 1] != -1)
return kk[x][pos][prec + 1];
if (a[pos] == '?')
return kk[x][pos][prec + 1] = 1;
char cx;
if (x == -1)
cx = '-';
else if (prec == -1)
{
if (x >= 0 and x <= 9)
cx = (char)('0' + x);
else
cx = 'x';
}
else
{
if (x + prec < 10)
cx = (char)('0' + x);
else
cx = '/';
}
if (cx == a[pos])
return kk[x][pos][prec + 1] = 1;
return kk[x][pos][prec + 1] = 0;
}
bool okv(int x,int pos)
{
if (v[pos] == -1)
return true;
if (x == v[pos])
return true;
return false;
}
int f(int c11,int c12,int c21,int c22)
{
if (c11 == 10)
{
if (c12 != c21)
return 31;
return 10 + c21 + c22;
}
if (c11 + c12 < 10)
return c11 + c12;
else if (c11 + c12 > 10)
return 31;
return 10 + c21;
}
void testcase()
{
for (int i = 0; i < 105; i++)
for (int j = 0; j < 105; j++)
for (int k = 0; k < 105; k++)
kk[i][j][k] = -1;
for (int i = 0; i < 11; i++)
for (int j = 0; j < 301; j++)
for (int ii = 0; ii < 11; ii++)
for (int jj = 0; jj < 11; jj++)
for (int kkk = 0; kkk < 32; kkk++)
dp[i][j][ii][jj][kkk] = 0;
for (int i = 0; i < 11; i++)
for (int j = 0; j < 301; j++)
for (int ii = 0; ii < 31; ii++)
for (int jj = 0; jj < 11; jj++)
sdp[i][j][ii][jj] = 0;
for (int i = 0; i < 11; i++)
for (int j = 0; j < 301; j++)
for (int ii = 0; ii < 31; ii++)
sumdp[i][j][ii] = 0;
cin >> n;
for (int i = 1; i <= 2 * n + 1; i++)
cin >> a[i];
for (int i = 1; i <= n; i++)
cin >> v[i];
for (int s = 0; s <= 30 * n; s++)
{
for (int h1 = 0; h1 <= 10; h1++)
{
if (h1 == 10)
{
for (int h2 = 0; h2 <= 10; h2++)
{
if (h2 == 10)
{
for (int h3 = 0; h3 <= 10; h3++)
{
if (h1 + h2 + h3 <= s and ok(h1,2 * n - 1,-1) and ok(h2,2 * n,-1) and ok(h3,2 * n + 1,-1) and okv(s,n))
dp[n][s][h1][h2][h1 + h2 + h3]++;
}
}
else
{
for (int h3 = 0; h3 <= 10 - h2; h3++)
{
if (h1 + h2 + h3 <= s and ok(h1,2 * n - 1,-1) and ok(h2,2 * n,-1) and ok(h3,2 * n + 1,h2) and okv(s,n))
dp[n][s][h1][h2][h1 + h2 + h3]++;
}
}
}
}
else
{
for (int h2 = 0; h2 <= 10 - h1; h2++)
{
if (h1 + h2 == 10 and ok(h1,2 * n - 1,-1) and ok(h2, 2 * n,h1))
{
for (int h3 = 0; h3 <= 10; h3++)
{
if (ok(h3,2 * n + 1,-1) and h1 + h2 + h3 <= s and okv(s,n))
dp[n][s][h1][h2][h1 + h2 + h3]++;
}
}
else if (h1 + h2 < 10)
{
if (h1 + h2 <= s and ok(h1,2 * n - 1,-1) and ok(h2,2 * n,h1) and ok(-1,2 * n + 1,-1) and okv(s,n))
dp[n][s][h1][h2][h1 + h2]++;
}
}
}
}
}
/*for (int i = n; i > 1; i--)
{
for (int s = 0; s <= 30 * i; s++)
{
for (int h1 = 0; h1 <= 10; h1++)
{
for (int h2 = 0; h2 <= 10; h2++)
{
for (int vl = 0; vl <= min(30ll,s); vl++)
{
if (dp[i][s][h1][h2][vl] == 0)
continue;
if (!okv(s - vl,i - 1))
continue;
//cout << i << ' ' << s << ' ' << h1 << ' ' << h2 << ' ' << vl << endl;
for (int h1p = 0; h1p <= 10; h1p++)
{
for (int h2p = 0; h2p <= 10; h2p++)
{
if (f(h1p,h2p,h1,h2) <= s - vl)
{
if (h1p == 10 and ok(10,2 * i - 3,true,-1) and ok(-1,2 * i - 2,false,-1))
dp[i - 1][s - vl][h1p][h2p][f(h1p,h2p,h1,h2)] += dp[i][s][h1][h2][vl];
else if (h1p != 10)
{
if (h1p + h2p <= 10 and ok(h1p,2 * i - 3,false,-1) and ok(h2p,2 * i - 2,false,h1p))
dp[i - 1][s - vl][h1p][h2p][f(h1p,h2p,h1,h2)] += dp[i][s][h1][h2][vl];
}
}
}
}
}
}
}
}
}*/
for (int s = 0; s <= 30 * n; s++)
{
for (int h1 = 0; h1 <= 10; h1++)
{
for (int h2 = 0; h2 <= 10; h2++)
{
for (int vl = 0; vl <= 30; vl++)
{
sumdp[n][s][vl] += dp[n][s][h1][h2][vl];
sdp[n][s][vl][h1] += dp[n][s][h1][h2][vl];
//if (dp[n][s][h1][h2][vl] != 0)
// cout << s << ' ' << h1 << ' ' << h2 << ' ' << vl << ' ' << dp[n][s][h1][h2][vl] << endl;
}
}
}
}
for (int i = n - 1; i >= 1; i--)
{
for (int s = 0; s <= 30 * i; s++)
{
for (int h1 = 0; h1 <= 10; h1++)
{
for (int h2 = 0; h2 <= 10; h2++)
{
for (int vlp = 0; vlp <= 30; vlp++)
{
if (h1 == 10)
{
for (int h2p = 0; h2p <= 10; h2p++)
if (ok(h1,2 * i - 1,-1) and ok(-1,2 * i,-1))
dp[i][s][h1][h2][10 + h2 + h2p] += dp[i + 1][s + vlp][h2][h2p][vlp];
}
else if (h1 + h2 == 10)
{
for (int h1p = 0; h1p <= 10; h1p++)
if (ok(h1,2 * i - 1,-1) and ok(h2,2 * i,h1))
dp[i][s][h1][h2][10 + h1p] += sdp[i + 1][s + vlp][vlp][h1p];
}
else if (h1 + h2 < 10)
{
if (ok(h1,2 * i - 1,-1) and ok(h2,2 * i,h1))
dp[i][s][h1][h2][h1 + h2] += sumdp[i + 1][s + vlp][vlp];
}
}
}
}
}
for (int s = 0; s <= 30 * i; s++)
{
for (int h1 = 0; h1 <= 10; h1++)
{
for (int h2 = 0; h2 <= 10; h2++)
{
for (int vl = 0; vl <= 30; vl++)
{
if (!okv(s,i))
dp[i][s][h1][h2][vl] = 0;
//if (dp[i][s][h1][h2][vl] != 0)
// cout << i << ' ' << s << ' ' << h1 << ' ' << h2 << ' ' << vl << ' ' << dp[i][s][h1][h2][vl] << endl;
sumdp[i][s][vl] += dp[i][s][h1][h2][vl];
sdp[i][s][vl][h1] += dp[i][s][h1][h2][vl];
}
}
}
}
}
int ans = 0;
for (int s = 0; s <= 30; s++)
{
for (int h1 = 0; h1 <= 10; h1++)
{
for (int h2 = 0; h2 <= 10; h2++)
{
//if (dp[1][s][h1][h2][s] != 0)
//cout << s << ' ' << h1 << ' ' << h2 << ' ' << dp[1][s][h1][h2][s] << endl;
ans += dp[1][s][h1][h2][s];
}
}
}
cout << ans << '\n';
}
signed main()
{
int tc;
cin >> tc;
while (tc--)
testcase();
return 0;
}
/**
hoping for a miracle
**/
/*
1
2
?????
10 -1
*/
Compilation message
bow.cpp: In function 'bool ok(long long int, long long int, long long int)':
bow.cpp:21:37: warning: suggest parentheses around assignment used as truth value [-Wparentheses]
21 | return kk[x][pos][prec + 1] = 1;
| ~~~~~~~~~~~~~~~~~~~~~^~~
bow.cpp:40:37: warning: suggest parentheses around assignment used as truth value [-Wparentheses]
40 | return kk[x][pos][prec + 1] = 1;
| ~~~~~~~~~~~~~~~~~~~~~^~~
bow.cpp:41:33: warning: suggest parentheses around assignment used as truth value [-Wparentheses]
41 | return kk[x][pos][prec + 1] = 0;
| ~~~~~~~~~~~~~~~~~~~~~^~~
bow.cpp: In function 'void testcase()':
bow.cpp:18:13: warning: array subscript -1 is below array bounds of 'long long int [105][105][105]' [-Warray-bounds]
18 | if (kk[x][pos][prec + 1] != -1)
| ~~~~^
bow.cpp:14:5: note: while referencing 'kk'
14 | int kk[105][105][105];
| ^~
bow.cpp:41:16: warning: array subscript -1 is below array bounds of 'long long int [105][105][105]' [-Warray-bounds]
41 | return kk[x][pos][prec + 1] = 0;
| ~~~~^
bow.cpp:14:5: note: while referencing 'kk'
14 | int kk[105][105][105];
| ^~
bow.cpp:40:20: warning: array subscript -1 is below array bounds of 'long long int [105][105][105]' [-Warray-bounds]
40 | return kk[x][pos][prec + 1] = 1;
| ~~~~^
bow.cpp:14:5: note: while referencing 'kk'
14 | int kk[105][105][105];
| ^~
bow.cpp:21:20: warning: array subscript -1 is below array bounds of 'long long int [105][105][105]' [-Warray-bounds]
21 | return kk[x][pos][prec + 1] = 1;
| ~~~~^
bow.cpp:14:5: note: while referencing 'kk'
14 | int kk[105][105][105];
| ^~
bow.cpp:18:13: warning: array subscript -1 is below array bounds of 'long long int [105][105][105]' [-Warray-bounds]
18 | if (kk[x][pos][prec + 1] != -1)
| ~~~~^
bow.cpp:14:5: note: while referencing 'kk'
14 | int kk[105][105][105];
| ^~
bow.cpp:41:16: warning: array subscript -1 is below array bounds of 'long long int [105][105][105]' [-Warray-bounds]
41 | return kk[x][pos][prec + 1] = 0;
| ~~~~^
bow.cpp:14:5: note: while referencing 'kk'
14 | int kk[105][105][105];
| ^~
bow.cpp:40:20: warning: array subscript -1 is below array bounds of 'long long int [105][105][105]' [-Warray-bounds]
40 | return kk[x][pos][prec + 1] = 1;
| ~~~~^
bow.cpp:14:5: note: while referencing 'kk'
14 | int kk[105][105][105];
| ^~
bow.cpp:21:20: warning: array subscript -1 is below array bounds of 'long long int [105][105][105]' [-Warray-bounds]
21 | return kk[x][pos][prec + 1] = 1;
| ~~~~^
bow.cpp:14:5: note: while referencing 'kk'
14 | int kk[105][105][105];
| ^~
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
498 ms |
119468 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
569 ms |
119388 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
342 ms |
119388 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
755 ms |
119388 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
498 ms |
119468 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
