oj.uz

답안 #702245

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
702245 2023-02-23T11:20:57 Z LittleCube Bowling (BOI15_bow) C++14
82 / 100
 1000 ms 121928 KB 
#pragma GCC optimize("Ofast,unroll-loops")
#pragma GCC target("avx,avx2,sse,sse2,ssse3,sse4,fma,abm")
#include <bits/stdc++.h>
#define ll long long
#define pii pair<int, int>
#define pll pair<ll, ll>
#define F first
#define S second
using namespace std;

ll dp[10][66][66][331], pre[11][66][331], sum[66][331];
int cost[66][66][66], cost223[66][66][331], cost23[66][331], cost3[331], can[11][331];
const int s2 = 66, s3 = 241;
string mp2[s2], mp3[s3];

int _cost(string s, string t)
{
    int a = -1, b = -1;
    for (auto c : t)
    {
        if (c == 'x')
            (a == -1 ? a : b) = 10;
        else if (c == '/')
            b = 10 - a;
        else if (isdigit(c))
            (a == -1 ? a : b) = c - '0';
        if (b >= 0)
            break;
    }
    a = max(0, a), b = max(0, b);

    if (s[0] == 'x')
        return 10 + a + b;
    else if (s[1] == '/')
        return 10 + a;
    else
        return s[0] + s[1] - 2 * '0';
}

bool match(string s, string t)
{
    for (int i = 0; i < s.size(); i++)
        if (s[i] != t[i] && s[i] != '?')
            return 0;
    return 1;
}

void solve()
{
    string s;
    int n, ans[13] = {};
    cin >> n >> s;
    for (int i = 1; i <= n; i++)
        cin >> ans[i + 2];
    dp[0][0][0][0] = 1;
    for (int i = 1; i <= n - 1; i++)
        for (int j = 0; j < s2; j++)
            for (int sc = 0; sc <= 330; sc++)
                pre[i][j][sc] = sum[j][sc] = 0;
    for (int i = 0; i <= n - 2; i++)
    {
        string t = s.substr(2 * i, 2);
        for (int l = 0; l < s2; l++)
            can[i][l] = match(t, mp2[l]);
    }
    for (int i = 0; i <= n - 2; i++)
        for (int j = 0; j < s2; j++)
            for (int k = 0; k < s2; k++)
                if (j == 65 && k == 65)
                {
                    for (int sc = 0; sc <= 330; sc++)
                    {
                        if (i > 0 && can[i - 1][k])
                            dp[i][j][k][sc] += pre[i][j][sc];
                        if (dp[i][j][k][sc] != 0)
                            for (int l = 0; l < s2; l++)
                                if (can[i][l] && (sc + cost[j][k][l] == ans[i + 1] || ans[i + 1] == -1))
                                    dp[i + 1][k][l][sc + cost[j][k][l]] += dp[i][j][k][sc];
                        dp[i][j][k][sc] = 0;
                    }
                }
                else
                {
                    for (int sc = 0; sc <= 330; sc++)
                    {
                        if (i > 0 && can[i - 1][k])
                            dp[i][j][k][sc] += pre[i][j][sc];
                        if (dp[i][j][k][sc] != 0)
                            if (sc + cost[j][k][0] == ans[i + 1] || ans[i + 1] == -1)
                                pre[i + 1][k][sc + cost[j][k][0]] += dp[i][j][k][sc];
                        dp[i][j][k][sc] = 0;
                    }
                }

    ll res = 0;
    for (int l = 0; l < s3; l++)
        can[n - 1][l] = match(s.substr(2 * n - 2, 3), mp3[l]);
    for (int j = 0; j < s2; j++)
        for (int k = 0; k < s2; k++)
            if (j == 65 && k == 65)
            {
                for (int sc = 0; sc <= 330; sc++)
                {
                    if (can[n - 2][k])
                        dp[n - 1][j][k][sc] += pre[n - 1][j][sc];
                    if (dp[n - 1][j][k][sc] != 0)
                        for (int l = 0; l < s3; l++)
                            if (can[n - 1][l])
                            {
                                int an2 = cost223[j][k][l], an1 = an2 + cost23[k][l], an = an1 + cost3[l];
                                if ((sc + an2 == ans[n] || ans[n] == -1) &&
                                    (sc + an1 == ans[n + 1] || ans[n + 1] == -1) &&
                                    (sc + an == ans[n + 2] || ans[n + 2] == -1))
                                    res += dp[n - 1][j][k][sc];
                            }
                    dp[n - 1][j][k][sc] = 0;
                }
            }
            else
            {
                for (int sc = 0; sc <= 330; sc++)
                {
                    if (can[n - 2][k])
                        dp[n - 1][j][k][sc] += pre[n - 1][j][sc];
                    if (dp[n - 1][j][k][sc] != 0)
                    {
                        int an2 = cost223[j][k][0];
                        if (dp[n - 1][j][k][sc] != 0 &&
                            (sc + an2 == ans[n] || ans[n] == -1))
                            sum[k][sc + an2] += dp[n - 1][j][k][sc];
                    }
                    dp[n - 1][j][k][sc] = 0;
                }
            }

    for (int k = 0; k < s2; k++)
        for (int sc = 0; sc <= 330; sc++)
            if (sum[k][sc] != 0)
                for (int l = 0; l < s3; l++)
                    if (can[n - 1][l])
                    {
                        int an1 = cost23[k][l], an = an1 + cost3[l];
                        if ((sc + an1 == ans[n + 1] || ans[n + 1] == -1) &&
                            (sc + an == ans[n + 2] || ans[n + 2] == -1))
                            res += sum[k][sc];
                    }

    cout << res << '\n';
}

signed main()
{
    ios::sync_with_stdio(0);
    cin.tie(0), cout.tie(0);

    int idx = 0;
    for (int i = 0; i <= 10; i++)
        for (int j = 0; j <= 10 - i; j++)
        {
            string s = (i == 10 ? "x-" : (i + j == 10 ? string(1, '0' + i) + "/" : string(1, '0' + i) + string(1, '0' + j)));
            mp2[idx] = s;
            idx++;
        }
    idx = 0;
    for (int i = 0; i <= 10; i++)
        for (int j = 0; j <= (i == 10 ? 10 : 10 - i); j++)
            for (int k = 0; k <= (i == 10 ? (j == 10 ? 10 : 10 - j) : (i + j == 10 ? 10 : 0)); k++)
            {
                string s = (i == 10 ? "x" : string(1, '0' + i)) +
                           (j == 10 ? "x" : string(1, '0' + j)) +
                           (k == 10 ? "x" : string(1, '0' + k));
                if (i < 10 && i + j == 10)
                    s[1] = '/';
                if (i == 10 && j < 10 && j + k == 10)
                    s[2] = '/';
                if (i + j < 10)
                    s[2] = '-';
                mp3[idx] = s;
                idx++;
            }
    for (int j = 0; j < s2; j++)
        for (int k = 0; k < s2; k++)
            for (int l = 0; l < s2; l++)
            {
                cost[j][k][l] = _cost(mp2[j], mp2[k] + mp2[l]);
            }
    for (int j = 0; j < s2; j++)
        for (int k = 0; k < s2; k++)
            for (int l = 0; l < s3; l++)
                cost223[j][k][l] = _cost(mp2[j], mp2[k] + mp3[l]);
    for (int k = 0; k < s2; k++)
        for (int l = 0; l < s3; l++)
            cost23[k][l] = _cost(mp2[k], mp3[l]);
    for (int l = 0; l < s3; l++)
    {
        int &an = cost3[l];

        if (mp3[l][1] == '/')
        {
            an += 10;
            if (mp3[l][2] != '-')
                an += (mp3[l][2] == 'x' ? 10 : mp3[l][2] - '0');
        }
        else
        {
            an += (mp3[l][0] == 'x' ? 10 : mp3[l][0] - '0');
            if (mp3[l][2] == '/')
                an += 10;
            else
            {
                an += (mp3[l][1] == 'x' ? 10 : mp3[l][1] - '0');
                if (mp3[l][2] != '-')
                    an += (mp3[l][2] == 'x' ? 10 : mp3[l][2] - '0');
            }
        }
    }

    cerr << "start\n";
    int q;
    cin >> q;
    while (q--)
        solve();
}

Compilation message

bow.cpp: In function 'bool match(std::string, std::string)':
bow.cpp:42:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   42 |     for (int i = 0; i < s.size(); i++)
      |                     ~~^~~~~~~~~~

Subtask #1
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 322 ms 121656 KB Output is correct
2 Correct 399 ms 110268 KB Output is correct
3 Correct 402 ms 110316 KB Output is correct
4 Correct 426 ms 121660 KB Output is correct
5 Correct 450 ms 121768 KB Output is correct
6 Correct 498 ms 121740 KB Output is correct
7 Correct 527 ms 121712 KB Output is correct
8 Correct 483 ms 121768 KB Output is correct
9 Correct 423 ms 121772 KB Output is correct
10 Correct 478 ms 121768 KB Output is correct
11 Correct 717 ms 121768 KB Output is correct
12 Correct 172 ms 30028 KB Output is correct
13 Correct 75 ms 30056 KB Output is correct
14 Correct 168 ms 30216 KB Output is correct
15 Correct 81 ms 30088 KB Output is correct

Subtask #2
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 369 ms 121768 KB Output is correct
2 Correct 473 ms 121736 KB Output is correct
3 Correct 476 ms 121776 KB Output is correct
4 Correct 497 ms 121772 KB Output is correct
5 Correct 509 ms 121708 KB Output is correct
6 Correct 695 ms 121756 KB Output is correct
7 Correct 701 ms 121772 KB Output is correct
8 Correct 698 ms 121752 KB Output is correct
9 Correct 693 ms 121796 KB Output is correct
10 Correct 753 ms 121772 KB Output is correct
11 Correct 769 ms 121732 KB Output is correct
12 Correct 774 ms 121872 KB Output is correct
13 Correct 767 ms 121928 KB Output is correct
14 Correct 822 ms 121804 KB Output is correct
15 Correct 799 ms 121892 KB Output is correct
16 Correct 805 ms 121772 KB Output is correct
17 Correct 812 ms 121784 KB Output is correct
18 Correct 812 ms 121772 KB Output is correct
19 Correct 796 ms 121820 KB Output is correct
20 Correct 811 ms 121872 KB Output is correct
21 Correct 805 ms 121772 KB Output is correct

Subtask #3
26.0 / 26.0

# 결과 실행 시간 메모리 Grader output
1 Correct 278 ms 121676 KB Output is correct
2 Correct 526 ms 121704 KB Output is correct
3 Correct 481 ms 121668 KB Output is correct
4 Correct 459 ms 121780 KB Output is correct
5 Correct 440 ms 121772 KB Output is correct
6 Correct 714 ms 121804 KB Output is correct
7 Correct 708 ms 121772 KB Output is correct
8 Correct 749 ms 121772 KB Output is correct
9 Correct 715 ms 121780 KB Output is correct
10 Correct 811 ms 121776 KB Output is correct
11 Correct 808 ms 121768 KB Output is correct
12 Correct 810 ms 121860 KB Output is correct
13 Correct 812 ms 121768 KB Output is correct
14 Correct 806 ms 121800 KB Output is correct
15 Correct 807 ms 121880 KB Output is correct
16 Correct 839 ms 121768 KB Output is correct
17 Correct 843 ms 121776 KB Output is correct
18 Correct 776 ms 121768 KB Output is correct
19 Correct 708 ms 121860 KB Output is correct
20 Correct 710 ms 121768 KB Output is correct
21 Correct 720 ms 121772 KB Output is correct

Subtask #4
23.0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 451 ms 121768 KB Output is correct
2 Correct 458 ms 121780 KB Output is correct
3 Correct 495 ms 121676 KB Output is correct
4 Correct 444 ms 121904 KB Output is correct
5 Correct 429 ms 110332 KB Output is correct
6 Correct 493 ms 121768 KB Output is correct
7 Correct 490 ms 121804 KB Output is correct
8 Correct 451 ms 121780 KB Output is correct
9 Correct 469 ms 121768 KB Output is correct
10 Correct 601 ms 121780 KB Output is correct
11 Correct 577 ms 121772 KB Output is correct
12 Correct 561 ms 121836 KB Output is correct
13 Correct 540 ms 121784 KB Output is correct
14 Correct 737 ms 121768 KB Output is correct
15 Correct 698 ms 121772 KB Output is correct
16 Correct 710 ms 121768 KB Output is correct
17 Correct 730 ms 121868 KB Output is correct
18 Correct 682 ms 121848 KB Output is correct
19 Correct 689 ms 121768 KB Output is correct
20 Correct 692 ms 121768 KB Output is correct
21 Correct 683 ms 121768 KB Output is correct

Subtask #5
0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 322 ms 121656 KB Output is correct
2 Correct 399 ms 110268 KB Output is correct
3 Correct 402 ms 110316 KB Output is correct
4 Correct 426 ms 121660 KB Output is correct
5 Correct 450 ms 121768 KB Output is correct
6 Correct 498 ms 121740 KB Output is correct
7 Correct 527 ms 121712 KB Output is correct
8 Correct 483 ms 121768 KB Output is correct
9 Correct 423 ms 121772 KB Output is correct
10 Correct 478 ms 121768 KB Output is correct
11 Correct 717 ms 121768 KB Output is correct
12 Correct 172 ms 30028 KB Output is correct
13 Correct 75 ms 30056 KB Output is correct
14 Correct 168 ms 30216 KB Output is correct
15 Correct 81 ms 30088 KB Output is correct
16 Correct 369 ms 121768 KB Output is correct
17 Correct 473 ms 121736 KB Output is correct
18 Correct 476 ms 121776 KB Output is correct
19 Correct 497 ms 121772 KB Output is correct
20 Correct 509 ms 121708 KB Output is correct
21 Correct 695 ms 121756 KB Output is correct
22 Correct 701 ms 121772 KB Output is correct
23 Correct 698 ms 121752 KB Output is correct
24 Correct 693 ms 121796 KB Output is correct
25 Correct 753 ms 121772 KB Output is correct
26 Correct 769 ms 121732 KB Output is correct
27 Correct 774 ms 121872 KB Output is correct
28 Correct 767 ms 121928 KB Output is correct
29 Correct 822 ms 121804 KB Output is correct
30 Correct 799 ms 121892 KB Output is correct
31 Correct 805 ms 121772 KB Output is correct
32 Correct 812 ms 121784 KB Output is correct
33 Correct 812 ms 121772 KB Output is correct
34 Correct 796 ms 121820 KB Output is correct
35 Correct 811 ms 121872 KB Output is correct
36 Correct 805 ms 121772 KB Output is correct
37 Correct 278 ms 121676 KB Output is correct
38 Correct 526 ms 121704 KB Output is correct
39 Correct 481 ms 121668 KB Output is correct
40 Correct 459 ms 121780 KB Output is correct
41 Correct 440 ms 121772 KB Output is correct
42 Correct 714 ms 121804 KB Output is correct
43 Correct 708 ms 121772 KB Output is correct
44 Correct 749 ms 121772 KB Output is correct
45 Correct 715 ms 121780 KB Output is correct
46 Correct 811 ms 121776 KB Output is correct
47 Correct 808 ms 121768 KB Output is correct
48 Correct 810 ms 121860 KB Output is correct
49 Correct 812 ms 121768 KB Output is correct
50 Correct 806 ms 121800 KB Output is correct
51 Correct 807 ms 121880 KB Output is correct
52 Correct 839 ms 121768 KB Output is correct
53 Correct 843 ms 121776 KB Output is correct
54 Correct 776 ms 121768 KB Output is correct
55 Correct 708 ms 121860 KB Output is correct
56 Correct 710 ms 121768 KB Output is correct
57 Correct 720 ms 121772 KB Output is correct
58 Correct 451 ms 121768 KB Output is correct
59 Correct 458 ms 121780 KB Output is correct
60 Correct 495 ms 121676 KB Output is correct
61 Correct 444 ms 121904 KB Output is correct
62 Correct 429 ms 110332 KB Output is correct
63 Correct 493 ms 121768 KB Output is correct
64 Correct 490 ms 121804 KB Output is correct
65 Correct 451 ms 121780 KB Output is correct
66 Correct 469 ms 121768 KB Output is correct
67 Correct 601 ms 121780 KB Output is correct
68 Correct 577 ms 121772 KB Output is correct
69 Correct 561 ms 121836 KB Output is correct
70 Correct 540 ms 121784 KB Output is correct
71 Correct 737 ms 121768 KB Output is correct
72 Correct 698 ms 121772 KB Output is correct
73 Correct 710 ms 121768 KB Output is correct
74 Correct 730 ms 121868 KB Output is correct
75 Correct 682 ms 121848 KB Output is correct
76 Correct 689 ms 121768 KB Output is correct
77 Correct 692 ms 121768 KB Output is correct
78 Correct 683 ms 121768 KB Output is correct
79 Correct 357 ms 121676 KB Output is correct
80 Correct 514 ms 121876 KB Output is correct
81 Correct 487 ms 121772 KB Output is correct
82 Correct 543 ms 121804 KB Output is correct
83 Correct 486 ms 121776 KB Output is correct
84 Correct 746 ms 121868 KB Output is correct
85 Correct 747 ms 121776 KB Output is correct
86 Correct 744 ms 121764 KB Output is correct
87 Correct 749 ms 121800 KB Output is correct
88 Correct 776 ms 121768 KB Output is correct
89 Correct 770 ms 121804 KB Output is correct
90 Correct 770 ms 121772 KB Output is correct
91 Correct 773 ms 121756 KB Output is correct
92 Correct 675 ms 121768 KB Output is correct
93 Execution timed out 1086 ms 121740 KB Time limit exceeded
94 Halted 0 ms 0 KB -