Submission #727115

#	Time	Username	Problem	Language	Result	Execution time	Memory
727115		stasio6	Bowling (BOI15_bow)	C++14	100 / 100	947 ms	8784 KiB

bow

#include <bits/stdc++.h>
using namespace std;

#define rep(i, a, b) for(int i = a; i < (b); ++i)
#define all(x) begin(x), end(x)
#define sz(x) (int)(x).size()
#define PB push_back
#define FI first
#define ND second
#define maxeq(x, y) (x) = max((x), (y))
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;

int score[20];

const int maxFrameScore[11] = {0, 10, 30, 60, 90, 120, 150, 180, 210, 240, 300};
ll dp[15][500][12][12];
string game;

bool cmp(int i, char c1, char c2) {
    return (game[2*(i-1)] == '?' || game[2*(i-1)] == c1) && (game[2*(i-1)+1] == '?' || game[2*(i-1)+1] == c2);
}

bool scorecmp(int i, int s) {
    return score[i] == -1 || score[i] == s;
}

void fun() {
    int n;
    cin >> n;
    cin >> game;
    game += "?";
    for (int i = 1; i <= n; i++) {
        cin >> score[i];
    }
    for (int i = 0; i < 15; i++)
        for (int s = 0; s < 500; s++)
            for (int p = 0; p <= 10; p++)
                for (int d = 0; d <= 10; d++)
                    dp[i][s][p][d] = 0;
    for (int p = 0; p <= 10; p++) {
        for (int d = 0; d <= 10; d++) {
            dp[0][0][p][d] = 1;
        }
    }
    for (int i = 1; i < n; i++) {
        for (int s = 0; s <= maxFrameScore[i] + 30; s++) {
            if (!scorecmp(i, s))
                continue;
            for (int p = 0; p <= 10; p++) {
                for (int d = 0; d <= 10; d++) {
                    // Strike
                    if (s >= 10 + d + p && cmp(i, 'x', '-'))
                        dp[i][s][p][d] += dp[i-1][s - 10 - p - d][10][p];
                    for (int r1 = 0; r1 < 10; r1++) {
                        for (int r2 = 0; r2 <= 10 - r1; r2++) {
                            if (r1+r2 == 10) {
                                if (!cmp(i, '0'+r1, '/'))
                                    continue;
                                if (s >= r1 + r2 + p)
                                    dp[i][s][p][d] += dp[i-1][s - r1 - r2 - p][r1][r2];
                            } else {
                                if (!cmp(i, '0'+r1, '0'+r2))
                                    continue;
                                if (s >= r1 + r2)
                                    dp[i][s][p][d] += dp[i-1][s - r1 - r2][r1][r2];
                            }
                        }
                    }
                }
            }
        }
    }
    // Ostatnia runda
    ll ile = 0;
    for (int s = 0; s <= 400; s++) {
        if (!scorecmp(n, s))
            continue;
        // 3 striki lub 2 striki cos
        for (int t = 0; t <= 10; t++) {
            if (!cmp(n, 'x', 'x') || !cmp(n+1, t == 10 ? 'x' : '0'+t, '?'))
                continue;
            if (s >= 20 + t)
                ile += dp[n-1][s-(20+t)][10][10];
        }
        // strike cos
        for (int p = 0; p < 10; p++) {
            for (int d = 0; d <= 10 - p; d++) {
                if (!cmp(n, 'x', '0'+p) || !cmp(n+1, p+d == 10 ? '/' : '0'+d, '?'))
                    continue;
                if (s >= 10 + p + d)
                    ile += dp[n-1][s-(10 + p + d)][10][p];
            }
        }
        // spare cos
        for (int p = 0; p < 10; p++) {
            for (int d = 0; d <= 10; d++) {
                if (!cmp(n, '0'+p, '/') || !cmp(n+1, d == 10 ? 'x' : '0'+d, '?'))
                    continue;
                if (s >= 10 + d)
                    ile += dp[n-1][s-(10 + d)][p][10-p];
            }
        }
        // cos
        for (int p = 0; p < 10; p++) {
            for (int d = 0; d < 10-p; d++) {
                if (!cmp(n, '0'+p, '0'+d) || !cmp(n+1, '-', '?'))
                    continue;
                if (s >= p+d)
                    ile += dp[n-1][s-(p+d)][p][d];
            }
        }
    }
    cout << ile << "\n";
}

int32_t main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    int t;
    cin >> t;
    while (t--) fun();
}

• Subtask 1: 16 / 16
• Subtask 2: 17 / 17
• Subtask 3: 26 / 26
• Subtask 4: 23 / 23
• Subtask 5: 18 / 18