oj.uz

답안 #728095

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
728095 2023-04-22T01:34:15 Z thomas_li Bowling (BOI15_bow) C++17
82 / 100
 1000 ms 13004 KB 
// yolo
#include <bits/stdc++.h>
using namespace std;
string rk = "x-"; vector<string> spstr,rgstr;
string c1 = "xxx";
vector<string> c2,c3,c4,c5,c6,c7;
int n,a[11]; int64_t dp[11][22][22][301]; // first i frames, carry amount from previous i, carry amount from i, score after i
                                          // carry is -1 if we don't add
string s;

void solve(){
    memset(dp,0,sizeof dp);
    cin >> n >> s; s = ' ' + s;
    for(int i = 1; i <= n; i++) cin >> a[i];
    auto can = [&](int i, string& t){
        assert(t.size() == 2);
        for(int j = 0; j < 2; j++){
            char c = s[i+j]; if(c == '?') continue;
            if(c != t[j]) return false;
        }
        return true;
    };
    auto can1 = [&](int i, string& t){
        assert(t.size() == 3);
        for(int j = 0; j < 3; j++){
            char c = s[i+j];
            if(c == '?') continue;
            if(c != t[j]) return false;
        }
        return true;
    };
    dp[0][0][0][0] = 1;
    auto add = [&](int64_t& x, int64_t y){
        x = (x+y);
    };
    // solve normal
    for(int i = 1; i <= n-1; i++){
        // generate good strings
        bool grk = can(2*i-1,rk);
        vector<string> gsp,grg;  
        for(auto& t : spstr) if(can(2*i-1,t)) gsp.push_back(t);
        for(auto& t : rgstr) if(can(2*i-1,t)) grg.push_back(t);
        swap(gsp,spstr);
        swap(grg,rgstr);
        for(int j = -1; j <= 10; j++) for(int k = -1; k <= 20; k++){ // previous previous, previous carries
            int lo = 0, hi = 270;
            if(a[i] != -1) lo = hi = a[i];           
            for(int l = lo; l <= hi; l++){ // cur score
                // strike
                // our shot needs to make j zero, k non negative
                if(grk && (j == -1 || j-10 == 0) && (k == -1 || (k-10 >= 0 && k-10 <= 10))){
                    // we can gain some more from carries if needed 
                    for(int gain = 0; gain <= 20; gain++){
                        if(l-gain-10 < 0) break;
                        int nk = (k == -1 ? -1 : k-10);
                        add(dp[i][nk+1][gain+1][l],dp[i-1][j+1][k+1][l-gain-10]);
                    }
                }     
                // spare
                for(auto& t : spstr){
                    // previous previous gets subtracted by fs, previous gets subtracted by 10
                    // both are gone after this frame, so need to become 0
                    int fs = t[0]-'0',sn = 10;
                    if(j != -1 && j-fs != 0) continue;
                    if(k != -1 && k-sn != 0) continue;
                    for(int gain = 0; gain <= 10; gain++){
                        if(l-gain-10 < 0) continue;
                        // add to previous slot to satisfy one bonus feature (in theory)
                        add(dp[i][gain+1][0][l],dp[i-1][j+1][k+1][l-gain-10]);
                    }
                }
                // regular
                for(auto& t : rgstr){
                    // previous previous gets subtracted by fs, previous gets subtracted by sn+fs
                    // both are gone after this frame, so need to become 0
                    int fs = t[0]-'0',sn = t[1]-'0';
                    if(j != -1 && j-fs != 0) continue;
                    if(k != -1 && k-fs-sn != 0) continue;
                    if(l-fs-sn < 0) continue;
                    add(dp[i][0][0][l],dp[i-1][j+1][k+1][l-fs-sn]);
                }
                /*
                bool good = 0;
                for(int z = 0; z <= 20 && !good; z++) for(int w = 0; w <= 20; w++) if(dp[i][z][w][l]){
                    good = 1;
                    break;
                }
                if(good) cout << l << " " << i << "\n";  */
            }
        }
        swap(gsp,spstr);
        swap(grg,rgstr);
    }
    // solve last
    // preprocess equalities
    vector<string> gc2,gc3,gc4,gc5,gc6,gc7;
    for(auto& t : c2) if(can1(2*n-1,t)) gc2.push_back(t);
    for(auto& t : c3) if(can1(2*n-1,t)) gc3.push_back(t);
    for(auto& t : c4) if(can1(2*n-1,t)) gc4.push_back(t);
    for(auto& t : c5) if(can1(2*n-1,t)) gc5.push_back(t);
    for(auto& t : c6) if(can1(2*n-1,t)) gc6.push_back(t);
    for(auto& t : c7) if(can1(2*n-1,t)) gc7.push_back(t);
    bool gc1 = can1(2*n-1,c1);
    swap(gc2,c2);
    swap(gc3,c3);
    swap(gc4,c4);
    swap(gc5,c5);
    swap(gc6,c6);
    swap(gc7,c7);
    int64_t ans = 0;
    for(int j = -1; j <= 10; j++) for(int k = -1; k <= 20; k++){ // previous previous, previous carries
        int lo = 0, hi = 300;
        if(a[n] != -1) lo = hi = a[n];
        for(int l = lo; l <= hi; l++){
            int64_t res = 0;
            // xxx 
            if(gc1 && (j == -1 || j-10 == 0) && (k == -1 || k-20 == 0) && l-30 >= 0){
                add(res,dp[n-1][j+1][k+1][l-30]);
            }
            // xxA  
            // condition is same since bonus is only contributed in the first two shots
            for(auto& t : c2){
                if(j != -1 && j-10 != 0) continue; 
                if(k != -1 && k-20 != 0) continue; 
                int ls = t[2]-'0'; 
                if(l-20-ls < 0) continue; 
                add(res,dp[n-1][j+1][k+1][l-20-ls]);
            }
            // xA/
            for(auto& t : c3){
                int fs = t[1]-'0',sn = 10-fs;
                if(j != -1 && j-10 != 0) continue; 
                if(k != -1 && k-10-fs != 0) continue; 
                if(l-20 < 0) continue;
                add(res,dp[n-1][j+1][k+1][l-20]);
            }
            // xAB
            for(auto& t : c4){
                int fs = t[1]-'0',sn = t[2]-'0';
                if(j != -1 && j-10 != 0) continue; 
                if(k != -1 && k-10-fs != 0) continue; 
                if(l-10-fs-sn < 0) continue;
                add(res,dp[n-1][j+1][k+1][l-10-fs-sn]);
            }
            // A/x
            for(auto& t : c5){
                int fs = t[0]-'0'; 
                if(j != -1 && j-fs != 0) continue;
                if(k != -1 && k-10 != 0) continue;
                if(l-20 < 0) continue;
                add(res,dp[n-1][j+1][k+1][l-20]);
            }
            // A/B
            for(auto& t : c6){
                int fs = t[0]-'0',ls = t[2]-'0'; 
                if(j != -1 && j-fs != 0) continue;
                if(k != -1 && k-10 != 0) continue;
                if(l-10-ls < 0) continue;
                add(res,dp[n-1][j+1][k+1][l-10-ls]);
            }
            // AB-
            for(auto& t : c7){
                int fs = t[0]-'0',sn = t[1]-'0'; 
                if(j != -1 && j-fs != 0) continue;
                if(k != -1 && k-fs-sn != 0) continue;
                if(l-fs-sn < 0) continue;
                add(res,dp[n-1][j+1][k+1][l-fs-sn]);
            }
            ans += res;
        }
    }
    swap(gc2,c2);
    swap(gc3,c3);
    swap(gc4,c4);
    swap(gc5,c5);
    swap(gc6,c6);
    swap(gc7,c7);
    cout << ans << "\n";
}
int main(){
    cin.tie(0)->sync_with_stdio(0);
    for(int i = 0; i <= 9; i++){
        spstr.push_back(to_string(i) + "/");
        c2.push_back("xx"+to_string(i));
        c3.push_back("x"+to_string(i)+"/");
        for(int j = 0; i+j < 10; j++){
            rgstr.push_back(to_string(i)+to_string(j));
            c4.push_back("x"+to_string(i)+to_string(j));
            c7.push_back(to_string(i)+to_string(j)+"-");
        }
        c5.push_back(to_string(i)+"/x");
        for(int j = 0; j <= 9; j++){
            c6.push_back(to_string(i)+"/"+to_string(j));
        }
    }
    int t; cin >> t; while(t--) solve();
}
// number of strs for frame: 10 + 1 + 10
// 5726805883325784576

Compilation message

bow.cpp: In function 'void solve()':
bow.cpp:131:35: warning: unused variable 'sn' [-Wunused-variable]
  131 |                 int fs = t[1]-'0',sn = 10-fs;
      |                                   ^~

Subtask #1
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 180 ms 12884 KB Output is correct
2 Correct 133 ms 12884 KB Output is correct
3 Correct 37 ms 12888 KB Output is correct
4 Correct 44 ms 12884 KB Output is correct
5 Correct 43 ms 12884 KB Output is correct
6 Correct 36 ms 12888 KB Output is correct
7 Correct 180 ms 12756 KB Output is correct
8 Correct 204 ms 12872 KB Output is correct
9 Correct 199 ms 12884 KB Output is correct
10 Correct 187 ms 12884 KB Output is correct
11 Correct 130 ms 12884 KB Output is correct
12 Correct 182 ms 12884 KB Output is correct
13 Correct 38 ms 12884 KB Output is correct
14 Correct 177 ms 12872 KB Output is correct
15 Correct 43 ms 12888 KB Output is correct

Subtask #2
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 237 ms 12864 KB Output is correct
2 Correct 298 ms 12892 KB Output is correct
3 Correct 294 ms 12884 KB Output is correct
4 Correct 256 ms 12888 KB Output is correct
5 Correct 429 ms 12888 KB Output is correct
6 Correct 330 ms 12884 KB Output is correct
7 Correct 368 ms 12884 KB Output is correct
8 Correct 367 ms 12888 KB Output is correct
9 Correct 321 ms 12868 KB Output is correct
10 Correct 992 ms 12884 KB Output is correct
11 Correct 835 ms 12864 KB Output is correct
12 Correct 852 ms 12884 KB Output is correct
13 Correct 915 ms 12884 KB Output is correct
14 Correct 568 ms 12884 KB Output is correct
15 Correct 652 ms 12892 KB Output is correct
16 Correct 750 ms 12872 KB Output is correct
17 Correct 623 ms 12884 KB Output is correct
18 Correct 912 ms 12884 KB Output is correct
19 Correct 880 ms 12868 KB Output is correct
20 Correct 970 ms 12884 KB Output is correct
21 Correct 978 ms 12884 KB Output is correct

Subtask #3
26.0 / 26.0

# 결과 실행 시간 메모리 Grader output
1 Correct 128 ms 12884 KB Output is correct
2 Correct 75 ms 12784 KB Output is correct
3 Correct 90 ms 12872 KB Output is correct
4 Correct 72 ms 12884 KB Output is correct
5 Correct 74 ms 12884 KB Output is correct
6 Correct 73 ms 12884 KB Output is correct
7 Correct 83 ms 12884 KB Output is correct
8 Correct 102 ms 12884 KB Output is correct
9 Correct 81 ms 12868 KB Output is correct
10 Correct 141 ms 12884 KB Output is correct
11 Correct 105 ms 12884 KB Output is correct
12 Correct 106 ms 12884 KB Output is correct
13 Correct 88 ms 12884 KB Output is correct
14 Correct 213 ms 12884 KB Output is correct
15 Correct 227 ms 12868 KB Output is correct
16 Correct 220 ms 12884 KB Output is correct
17 Correct 227 ms 12888 KB Output is correct
18 Correct 101 ms 12884 KB Output is correct
19 Correct 86 ms 12884 KB Output is correct
20 Correct 109 ms 12884 KB Output is correct
21 Correct 90 ms 12864 KB Output is correct

Subtask #4
23.0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 326 ms 12884 KB Output is correct
2 Correct 356 ms 12884 KB Output is correct
3 Correct 378 ms 12884 KB Output is correct
4 Correct 309 ms 12884 KB Output is correct
5 Correct 291 ms 12884 KB Output is correct
6 Correct 225 ms 12884 KB Output is correct
7 Correct 286 ms 12864 KB Output is correct
8 Correct 255 ms 12864 KB Output is correct
9 Correct 281 ms 12884 KB Output is correct
10 Correct 743 ms 12884 KB Output is correct
11 Correct 657 ms 12884 KB Output is correct
12 Correct 690 ms 12884 KB Output is correct
13 Correct 669 ms 12756 KB Output is correct
14 Correct 336 ms 12884 KB Output is correct
15 Correct 328 ms 12864 KB Output is correct
16 Correct 340 ms 12884 KB Output is correct
17 Correct 383 ms 12884 KB Output is correct
18 Correct 154 ms 12884 KB Output is correct
19 Correct 153 ms 12884 KB Output is correct
20 Correct 139 ms 12884 KB Output is correct
21 Correct 131 ms 12884 KB Output is correct

Subtask #5
0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 180 ms 12884 KB Output is correct
2 Correct 133 ms 12884 KB Output is correct
3 Correct 37 ms 12888 KB Output is correct
4 Correct 44 ms 12884 KB Output is correct
5 Correct 43 ms 12884 KB Output is correct
6 Correct 36 ms 12888 KB Output is correct
7 Correct 180 ms 12756 KB Output is correct
8 Correct 204 ms 12872 KB Output is correct
9 Correct 199 ms 12884 KB Output is correct
10 Correct 187 ms 12884 KB Output is correct
11 Correct 130 ms 12884 KB Output is correct
12 Correct 182 ms 12884 KB Output is correct
13 Correct 38 ms 12884 KB Output is correct
14 Correct 177 ms 12872 KB Output is correct
15 Correct 43 ms 12888 KB Output is correct
16 Correct 237 ms 12864 KB Output is correct
17 Correct 298 ms 12892 KB Output is correct
18 Correct 294 ms 12884 KB Output is correct
19 Correct 256 ms 12888 KB Output is correct
20 Correct 429 ms 12888 KB Output is correct
21 Correct 330 ms 12884 KB Output is correct
22 Correct 368 ms 12884 KB Output is correct
23 Correct 367 ms 12888 KB Output is correct
24 Correct 321 ms 12868 KB Output is correct
25 Correct 992 ms 12884 KB Output is correct
26 Correct 835 ms 12864 KB Output is correct
27 Correct 852 ms 12884 KB Output is correct
28 Correct 915 ms 12884 KB Output is correct
29 Correct 568 ms 12884 KB Output is correct
30 Correct 652 ms 12892 KB Output is correct
31 Correct 750 ms 12872 KB Output is correct
32 Correct 623 ms 12884 KB Output is correct
33 Correct 912 ms 12884 KB Output is correct
34 Correct 880 ms 12868 KB Output is correct
35 Correct 970 ms 12884 KB Output is correct
36 Correct 978 ms 12884 KB Output is correct
37 Correct 128 ms 12884 KB Output is correct
38 Correct 75 ms 12784 KB Output is correct
39 Correct 90 ms 12872 KB Output is correct
40 Correct 72 ms 12884 KB Output is correct
41 Correct 74 ms 12884 KB Output is correct
42 Correct 73 ms 12884 KB Output is correct
43 Correct 83 ms 12884 KB Output is correct
44 Correct 102 ms 12884 KB Output is correct
45 Correct 81 ms 12868 KB Output is correct
46 Correct 141 ms 12884 KB Output is correct
47 Correct 105 ms 12884 KB Output is correct
48 Correct 106 ms 12884 KB Output is correct
49 Correct 88 ms 12884 KB Output is correct
50 Correct 213 ms 12884 KB Output is correct
51 Correct 227 ms 12868 KB Output is correct
52 Correct 220 ms 12884 KB Output is correct
53 Correct 227 ms 12888 KB Output is correct
54 Correct 101 ms 12884 KB Output is correct
55 Correct 86 ms 12884 KB Output is correct
56 Correct 109 ms 12884 KB Output is correct
57 Correct 90 ms 12864 KB Output is correct
58 Correct 326 ms 12884 KB Output is correct
59 Correct 356 ms 12884 KB Output is correct
60 Correct 378 ms 12884 KB Output is correct
61 Correct 309 ms 12884 KB Output is correct
62 Correct 291 ms 12884 KB Output is correct
63 Correct 225 ms 12884 KB Output is correct
64 Correct 286 ms 12864 KB Output is correct
65 Correct 255 ms 12864 KB Output is correct
66 Correct 281 ms 12884 KB Output is correct
67 Correct 743 ms 12884 KB Output is correct
68 Correct 657 ms 12884 KB Output is correct
69 Correct 690 ms 12884 KB Output is correct
70 Correct 669 ms 12756 KB Output is correct
71 Correct 336 ms 12884 KB Output is correct
72 Correct 328 ms 12864 KB Output is correct
73 Correct 340 ms 12884 KB Output is correct
74 Correct 383 ms 12884 KB Output is correct
75 Correct 154 ms 12884 KB Output is correct
76 Correct 153 ms 12884 KB Output is correct
77 Correct 139 ms 12884 KB Output is correct
78 Correct 131 ms 12884 KB Output is correct
79 Correct 351 ms 12884 KB Output is correct
80 Correct 494 ms 12872 KB Output is correct
81 Correct 396 ms 12884 KB Output is correct
82 Correct 359 ms 12884 KB Output is correct
83 Correct 370 ms 12884 KB Output is correct
84 Correct 130 ms 12884 KB Output is correct
85 Correct 185 ms 12888 KB Output is correct
86 Correct 170 ms 12884 KB Output is correct
87 Correct 186 ms 12884 KB Output is correct
88 Correct 667 ms 13004 KB Output is correct
89 Correct 866 ms 12884 KB Output is correct
90 Correct 844 ms 12872 KB Output is correct
91 Correct 861 ms 12884 KB Output is correct
92 Correct 130 ms 12868 KB Output is correct
93 Execution timed out 1094 ms 12884 KB Time limit exceeded
94 Halted 0 ms 0 KB -