oj.uz

답안 #703830

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
703830 2023-02-28T15:04:53 Z LittleCube Bowling (BOI15_bow) C++14
82 / 100
 1000 ms 121896 KB 
#pragma GCC optimize("Ofast,unroll-loops")
#pragma GCC target("avx,avx2,sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,fma")
#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 364 ms 121836 KB Output is correct
2 Correct 398 ms 110324 KB Output is correct
3 Correct 408 ms 110380 KB Output is correct
4 Correct 435 ms 121768 KB Output is correct
5 Correct 435 ms 121704 KB Output is correct
6 Correct 510 ms 121772 KB Output is correct
7 Correct 560 ms 121772 KB Output is correct
8 Correct 501 ms 121776 KB Output is correct
9 Correct 454 ms 121736 KB Output is correct
10 Correct 523 ms 121776 KB Output is correct
11 Correct 789 ms 121776 KB Output is correct
12 Correct 180 ms 30140 KB Output is correct
13 Correct 82 ms 30032 KB Output is correct
14 Correct 171 ms 30008 KB Output is correct
15 Correct 79 ms 30108 KB Output is correct

Subtask #2
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 405 ms 121740 KB Output is correct
2 Correct 495 ms 121712 KB Output is correct
3 Correct 482 ms 121768 KB Output is correct
4 Correct 495 ms 121772 KB Output is correct
5 Correct 563 ms 121888 KB Output is correct
6 Correct 706 ms 121800 KB Output is correct
7 Correct 738 ms 121772 KB Output is correct
8 Correct 755 ms 121776 KB Output is correct
9 Correct 710 ms 121768 KB Output is correct
10 Correct 858 ms 121768 KB Output is correct
11 Correct 798 ms 121812 KB Output is correct
12 Correct 809 ms 121824 KB Output is correct
13 Correct 798 ms 121768 KB Output is correct
14 Correct 828 ms 121776 KB Output is correct
15 Correct 822 ms 121808 KB Output is correct
16 Correct 864 ms 121760 KB Output is correct
17 Correct 854 ms 121768 KB Output is correct
18 Correct 856 ms 121772 KB Output is correct
19 Correct 827 ms 121804 KB Output is correct
20 Correct 831 ms 121772 KB Output is correct
21 Correct 801 ms 121836 KB Output is correct

Subtask #3
26.0 / 26.0

# 결과 실행 시간 메모리 Grader output
1 Correct 296 ms 121768 KB Output is correct
2 Correct 529 ms 121844 KB Output is correct
3 Correct 517 ms 121776 KB Output is correct
4 Correct 469 ms 121764 KB Output is correct
5 Correct 443 ms 121800 KB Output is correct
6 Correct 750 ms 121776 KB Output is correct
7 Correct 761 ms 121860 KB Output is correct
8 Correct 735 ms 121776 KB Output is correct
9 Correct 789 ms 121772 KB Output is correct
10 Correct 835 ms 121776 KB Output is correct
11 Correct 898 ms 121772 KB Output is correct
12 Correct 830 ms 121772 KB Output is correct
13 Correct 819 ms 121772 KB Output is correct
14 Correct 835 ms 121800 KB Output is correct
15 Correct 828 ms 121764 KB Output is correct
16 Correct 869 ms 121776 KB Output is correct
17 Correct 838 ms 121772 KB Output is correct
18 Correct 739 ms 121896 KB Output is correct
19 Correct 803 ms 121820 KB Output is correct
20 Correct 735 ms 121712 KB Output is correct
21 Correct 747 ms 121772 KB Output is correct

Subtask #4
23.0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 489 ms 121720 KB Output is correct
2 Correct 456 ms 121860 KB Output is correct
3 Correct 548 ms 121772 KB Output is correct
4 Correct 476 ms 121744 KB Output is correct
5 Correct 469 ms 110320 KB Output is correct
6 Correct 504 ms 121776 KB Output is correct
7 Correct 468 ms 121772 KB Output is correct
8 Correct 479 ms 121772 KB Output is correct
9 Correct 472 ms 121848 KB Output is correct
10 Correct 619 ms 121772 KB Output is correct
11 Correct 625 ms 121768 KB Output is correct
12 Correct 582 ms 121776 KB Output is correct
13 Correct 551 ms 121772 KB Output is correct
14 Correct 750 ms 121772 KB Output is correct
15 Correct 801 ms 121772 KB Output is correct
16 Correct 796 ms 121772 KB Output is correct
17 Correct 748 ms 121792 KB Output is correct
18 Correct 694 ms 121768 KB Output is correct
19 Correct 789 ms 121768 KB Output is correct
20 Correct 751 ms 121772 KB Output is correct
21 Correct 685 ms 121768 KB Output is correct

Subtask #5
0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 364 ms 121836 KB Output is correct
2 Correct 398 ms 110324 KB Output is correct
3 Correct 408 ms 110380 KB Output is correct
4 Correct 435 ms 121768 KB Output is correct
5 Correct 435 ms 121704 KB Output is correct
6 Correct 510 ms 121772 KB Output is correct
7 Correct 560 ms 121772 KB Output is correct
8 Correct 501 ms 121776 KB Output is correct
9 Correct 454 ms 121736 KB Output is correct
10 Correct 523 ms 121776 KB Output is correct
11 Correct 789 ms 121776 KB Output is correct
12 Correct 180 ms 30140 KB Output is correct
13 Correct 82 ms 30032 KB Output is correct
14 Correct 171 ms 30008 KB Output is correct
15 Correct 79 ms 30108 KB Output is correct
16 Correct 405 ms 121740 KB Output is correct
17 Correct 495 ms 121712 KB Output is correct
18 Correct 482 ms 121768 KB Output is correct
19 Correct 495 ms 121772 KB Output is correct
20 Correct 563 ms 121888 KB Output is correct
21 Correct 706 ms 121800 KB Output is correct
22 Correct 738 ms 121772 KB Output is correct
23 Correct 755 ms 121776 KB Output is correct
24 Correct 710 ms 121768 KB Output is correct
25 Correct 858 ms 121768 KB Output is correct
26 Correct 798 ms 121812 KB Output is correct
27 Correct 809 ms 121824 KB Output is correct
28 Correct 798 ms 121768 KB Output is correct
29 Correct 828 ms 121776 KB Output is correct
30 Correct 822 ms 121808 KB Output is correct
31 Correct 864 ms 121760 KB Output is correct
32 Correct 854 ms 121768 KB Output is correct
33 Correct 856 ms 121772 KB Output is correct
34 Correct 827 ms 121804 KB Output is correct
35 Correct 831 ms 121772 KB Output is correct
36 Correct 801 ms 121836 KB Output is correct
37 Correct 296 ms 121768 KB Output is correct
38 Correct 529 ms 121844 KB Output is correct
39 Correct 517 ms 121776 KB Output is correct
40 Correct 469 ms 121764 KB Output is correct
41 Correct 443 ms 121800 KB Output is correct
42 Correct 750 ms 121776 KB Output is correct
43 Correct 761 ms 121860 KB Output is correct
44 Correct 735 ms 121776 KB Output is correct
45 Correct 789 ms 121772 KB Output is correct
46 Correct 835 ms 121776 KB Output is correct
47 Correct 898 ms 121772 KB Output is correct
48 Correct 830 ms 121772 KB Output is correct
49 Correct 819 ms 121772 KB Output is correct
50 Correct 835 ms 121800 KB Output is correct
51 Correct 828 ms 121764 KB Output is correct
52 Correct 869 ms 121776 KB Output is correct
53 Correct 838 ms 121772 KB Output is correct
54 Correct 739 ms 121896 KB Output is correct
55 Correct 803 ms 121820 KB Output is correct
56 Correct 735 ms 121712 KB Output is correct
57 Correct 747 ms 121772 KB Output is correct
58 Correct 489 ms 121720 KB Output is correct
59 Correct 456 ms 121860 KB Output is correct
60 Correct 548 ms 121772 KB Output is correct
61 Correct 476 ms 121744 KB Output is correct
62 Correct 469 ms 110320 KB Output is correct
63 Correct 504 ms 121776 KB Output is correct
64 Correct 468 ms 121772 KB Output is correct
65 Correct 479 ms 121772 KB Output is correct
66 Correct 472 ms 121848 KB Output is correct
67 Correct 619 ms 121772 KB Output is correct
68 Correct 625 ms 121768 KB Output is correct
69 Correct 582 ms 121776 KB Output is correct
70 Correct 551 ms 121772 KB Output is correct
71 Correct 750 ms 121772 KB Output is correct
72 Correct 801 ms 121772 KB Output is correct
73 Correct 796 ms 121772 KB Output is correct
74 Correct 748 ms 121792 KB Output is correct
75 Correct 694 ms 121768 KB Output is correct
76 Correct 789 ms 121768 KB Output is correct
77 Correct 751 ms 121772 KB Output is correct
78 Correct 685 ms 121768 KB Output is correct
79 Correct 380 ms 121776 KB Output is correct
80 Correct 521 ms 121892 KB Output is correct
81 Correct 495 ms 121752 KB Output is correct
82 Correct 538 ms 121772 KB Output is correct
83 Correct 500 ms 121772 KB Output is correct
84 Correct 795 ms 121696 KB Output is correct
85 Correct 773 ms 121840 KB Output is correct
86 Correct 757 ms 121776 KB Output is correct
87 Correct 763 ms 121772 KB Output is correct
88 Correct 807 ms 121864 KB Output is correct
89 Correct 782 ms 121828 KB Output is correct
90 Correct 788 ms 121772 KB Output is correct
91 Correct 824 ms 121800 KB Output is correct
92 Correct 746 ms 121768 KB Output is correct
93 Execution timed out 1086 ms 121676 KB Time limit exceeded
94 Halted 0 ms 0 KB -