oj.uz

Submission #725473

# Submission time Handle Problem Language Result Execution time Memory
725473 2023-04-17T13:54:53 Z berr Bowling (BOI15_bow) C++17
100 / 100
 766 ms 3880 KB 
#include <bits/stdc++.h>
using namespace std;

#define int long long
int dp[11][305][12][12];

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

    }
    return 1;

}


int gs(string s){
    if(s.size()==3){
    int k=0;
    for(int i=0; i<s.size(); i++){
        if(s[i]=='x') k+=10;
        else if(s[i]=='/') k+=10-(s[i-1]-'0');
        else if(s[i]!='-') k+=(s[i]-'0');
    }

    return k;
    }

    int k=0;

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


array<int, 2> ab(string s){
    array<int, 2> q;

    if(s.size()==3){
        if(s[0]=='x') q[0] = 10;
        else q[0]=(s[0]-'0');
        if(s[1]=='x') q[1] = 10;
        else if(s[1]=='/') q[1] = 10-(s[0]-'0');
        else q[1]=(s[1]-'0');

        return q;
    }
    else{
        if(s[1]=='/'){
            return {s[0]-'0', 10-(s[0]-'0')};
        }
        else{
            return {s[0]-'0', s[1]-'0'};
        }
    }
}



void solve(){
    int n; cin >> n;
    string s; cin >> s;
    vector<string> b;

    b.push_back("zort");
    vector<int> p(n);

    for(auto &i: p) cin >> i;

    for(int i = 0; i < n; i++){
        for(int l = 0; l <= 300; l++){
            for(int j = 0; j<=10; j++){
                for(int k = 0; k<=10; k++){
                    dp[i][l][j][k]=0;
                }
            }
        }
    }

    string last="00"; 

    for(int i=0; i<2*(n); i+=2){
        string t;

        t+=s[i]; t+=s[i+1];

        if(i/2<n-1) {
            b.push_back(t);
        }

        else{
            t+=s[i+2];
            b.push_back(t);
            last=t;
        }

    }



    vector<string> all, all3;

    all.push_back("x-");
    all3.push_back("xxx");

    for(char i='0'; i<='9'; i++){
        string f="x/";

        f[0]=i;

        all.push_back(f);

        for(char l='0'; l-'0'+i-'0'<10; l++){
            string ff=f;

            ff[1]=l;
            all.push_back(ff);
        }
    }

    for(char i='0'; i<='9'; i++){
        string f="xxA"; f[2] = i;
        
        all3.push_back(f);

        f="A/x"; f[0]=i;
        all3.push_back(f);
    
        f="xA/"; f[1] = i;
        
        all3.push_back(f);
        
    }

    for(char i='0'; i<='9'; i++){
        for(char l='0'; l-'0'+i-'0'<10; l++){
            string f="xAB";  f[1] = i; f[2] = l;
            
            all3.push_back(f);
            
        

            f="AB-"; f[0] = i; f[1]=l;

            all3.push_back(f);
        }
    }


    for(char i='0'; i<='9'; i++){
        for(int l='0'; l<='9'; l++){
            string f ="A/B"; f[0]=i; f[2] = l;

            all3.push_back(f);
        }
    }

    for(auto i: all3){
        if(check(i, last)){
            int sum=gs(i);
            auto x=ab(i);
            if(p[n-1] != -1){

                dp[n-1][p[n-1]-sum][x[0]][x[1]]++;
            }
            else{
                for(int l=sum; l<305; l++){
                    dp[n-1][l-sum][x[0]][x[1]]++;
                }
            }
        }
    }

    int ans = 0;


    for(int ind=n-1; ind>0; ind--){
        for(auto l: all){
            if(check(l, b[ind])){

                if(l=="x-"){

    
                    for(int i=0; i<=10; i++){
                        for(int j=0; j<=10; j++){
                            int sum=10+i+j;


                            for(int k=sum; k<=300; k++){
                                if(p[ind-1]!=-1 && k!=p[ind-1]) continue;
                                int f=k-sum;
                                dp[ind-1][f][10][i] += dp[ind][k][i][j]; 
                                if(ind==1&&f==0) ans +=dp[ind][k][i][j];
                            }
                        }
                    }

                }

                else{
                    int sum=gs(l);
                    auto x=ab(l);

                    for(int i=0; i<=10; i++){
                        int ssum=sum;
                        if(l[1]=='/') ssum+=i;
                        for(int j=0; j<=10; j++){

                            
                            for(int k=ssum; k<=300; k++){
                                if(p[ind-1]!=-1&&k!=p[ind-1]) continue;
                                int f=k-ssum;


                                dp[ind-1][f][x[0]][x[1]] +=  dp[ind][k][i][j];

                                if(f==0&&ind==1){
                                    ans+=dp[ind][k][i][j];
                                } 
                            }
                        }
                    }

                }

            }
        }
    }


    cout<<ans<<"\n";

}


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

Compilation message

bow.cpp: In function 'long long int check(std::string, std::string)':
bow.cpp:9:19: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
    9 |     for(int i=0; i<s.size(); i++){
      |                  ~^~~~~~~~~
bow.cpp: In function 'long long int gs(std::string)':
bow.cpp:21:19: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::__cxx11::basic_string<char>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   21 |     for(int i=0; i<s.size(); i++){
      |                  ~^~~~~~~~~
bow.cpp:30:9: warning: unused variable 'k' [-Wunused-variable]
   30 |     int k=0;
      |         ^

Subtask #1
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 89 ms 3756 KB Output is correct
2 Correct 40 ms 3348 KB Output is correct
3 Correct 25 ms 3412 KB Output is correct
4 Correct 34 ms 3664 KB Output is correct
5 Correct 42 ms 3668 KB Output is correct
6 Correct 31 ms 3668 KB Output is correct
7 Correct 64 ms 3768 KB Output is correct
8 Correct 59 ms 3760 KB Output is correct
9 Correct 57 ms 3668 KB Output is correct
10 Correct 46 ms 3668 KB Output is correct
11 Correct 79 ms 3752 KB Output is correct
12 Correct 84 ms 980 KB Output is correct
13 Correct 20 ms 980 KB Output is correct
14 Correct 87 ms 1008 KB Output is correct
15 Correct 21 ms 980 KB Output is correct

Subtask #2
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 138 ms 3748 KB Output is correct
2 Correct 191 ms 3764 KB Output is correct
3 Correct 186 ms 3760 KB Output is correct
4 Correct 146 ms 3640 KB Output is correct
5 Correct 219 ms 3768 KB Output is correct
6 Correct 224 ms 3756 KB Output is correct
7 Correct 205 ms 3760 KB Output is correct
8 Correct 196 ms 3668 KB Output is correct
9 Correct 237 ms 3756 KB Output is correct
10 Correct 494 ms 3760 KB Output is correct
11 Correct 504 ms 3760 KB Output is correct
12 Correct 572 ms 3760 KB Output is correct
13 Correct 548 ms 3760 KB Output is correct
14 Correct 492 ms 3756 KB Output is correct
15 Correct 529 ms 3756 KB Output is correct
16 Correct 545 ms 3756 KB Output is correct
17 Correct 470 ms 3768 KB Output is correct
18 Correct 476 ms 3760 KB Output is correct
19 Correct 438 ms 3756 KB Output is correct
20 Correct 476 ms 3756 KB Output is correct
21 Correct 522 ms 3756 KB Output is correct

Subtask #3
26.0 / 26.0

# Verdict Execution time Memory Grader output
1 Correct 89 ms 3880 KB Output is correct
2 Correct 127 ms 3664 KB Output is correct
3 Correct 122 ms 3756 KB Output is correct
4 Correct 95 ms 3780 KB Output is correct
5 Correct 78 ms 3672 KB Output is correct
6 Correct 155 ms 3756 KB Output is correct
7 Correct 200 ms 3668 KB Output is correct
8 Correct 183 ms 3668 KB Output is correct
9 Correct 200 ms 3752 KB Output is correct
10 Correct 497 ms 3752 KB Output is correct
11 Correct 434 ms 3748 KB Output is correct
12 Correct 514 ms 3752 KB Output is correct
13 Correct 428 ms 3788 KB Output is correct
14 Correct 492 ms 3748 KB Output is correct
15 Correct 469 ms 3752 KB Output is correct
16 Correct 424 ms 3752 KB Output is correct
17 Correct 448 ms 3748 KB Output is correct
18 Correct 78 ms 3752 KB Output is correct
19 Correct 76 ms 3752 KB Output is correct
20 Correct 100 ms 3752 KB Output is correct
21 Correct 85 ms 3668 KB Output is correct

Subtask #4
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 225 ms 3668 KB Output is correct
2 Correct 208 ms 3752 KB Output is correct
3 Correct 259 ms 3848 KB Output is correct
4 Correct 197 ms 3676 KB Output is correct
5 Correct 217 ms 3416 KB Output is correct
6 Correct 195 ms 3664 KB Output is correct
7 Correct 221 ms 3752 KB Output is correct
8 Correct 226 ms 3772 KB Output is correct
9 Correct 240 ms 3760 KB Output is correct
10 Correct 449 ms 3760 KB Output is correct
11 Correct 443 ms 3752 KB Output is correct
12 Correct 422 ms 3756 KB Output is correct
13 Correct 385 ms 3748 KB Output is correct
14 Correct 222 ms 3748 KB Output is correct
15 Correct 226 ms 3748 KB Output is correct
16 Correct 238 ms 3748 KB Output is correct
17 Correct 248 ms 3668 KB Output is correct
18 Correct 87 ms 3668 KB Output is correct
19 Correct 91 ms 3748 KB Output is correct
20 Correct 81 ms 3752 KB Output is correct
21 Correct 64 ms 3668 KB Output is correct

Subtask #5
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 89 ms 3756 KB Output is correct
2 Correct 40 ms 3348 KB Output is correct
3 Correct 25 ms 3412 KB Output is correct
4 Correct 34 ms 3664 KB Output is correct
5 Correct 42 ms 3668 KB Output is correct
6 Correct 31 ms 3668 KB Output is correct
7 Correct 64 ms 3768 KB Output is correct
8 Correct 59 ms 3760 KB Output is correct
9 Correct 57 ms 3668 KB Output is correct
10 Correct 46 ms 3668 KB Output is correct
11 Correct 79 ms 3752 KB Output is correct
12 Correct 84 ms 980 KB Output is correct
13 Correct 20 ms 980 KB Output is correct
14 Correct 87 ms 1008 KB Output is correct
15 Correct 21 ms 980 KB Output is correct
16 Correct 138 ms 3748 KB Output is correct
17 Correct 191 ms 3764 KB Output is correct
18 Correct 186 ms 3760 KB Output is correct
19 Correct 146 ms 3640 KB Output is correct
20 Correct 219 ms 3768 KB Output is correct
21 Correct 224 ms 3756 KB Output is correct
22 Correct 205 ms 3760 KB Output is correct
23 Correct 196 ms 3668 KB Output is correct
24 Correct 237 ms 3756 KB Output is correct
25 Correct 494 ms 3760 KB Output is correct
26 Correct 504 ms 3760 KB Output is correct
27 Correct 572 ms 3760 KB Output is correct
28 Correct 548 ms 3760 KB Output is correct
29 Correct 492 ms 3756 KB Output is correct
30 Correct 529 ms 3756 KB Output is correct
31 Correct 545 ms 3756 KB Output is correct
32 Correct 470 ms 3768 KB Output is correct
33 Correct 476 ms 3760 KB Output is correct
34 Correct 438 ms 3756 KB Output is correct
35 Correct 476 ms 3756 KB Output is correct
36 Correct 522 ms 3756 KB Output is correct
37 Correct 89 ms 3880 KB Output is correct
38 Correct 127 ms 3664 KB Output is correct
39 Correct 122 ms 3756 KB Output is correct
40 Correct 95 ms 3780 KB Output is correct
41 Correct 78 ms 3672 KB Output is correct
42 Correct 155 ms 3756 KB Output is correct
43 Correct 200 ms 3668 KB Output is correct
44 Correct 183 ms 3668 KB Output is correct
45 Correct 200 ms 3752 KB Output is correct
46 Correct 497 ms 3752 KB Output is correct
47 Correct 434 ms 3748 KB Output is correct
48 Correct 514 ms 3752 KB Output is correct
49 Correct 428 ms 3788 KB Output is correct
50 Correct 492 ms 3748 KB Output is correct
51 Correct 469 ms 3752 KB Output is correct
52 Correct 424 ms 3752 KB Output is correct
53 Correct 448 ms 3748 KB Output is correct
54 Correct 78 ms 3752 KB Output is correct
55 Correct 76 ms 3752 KB Output is correct
56 Correct 100 ms 3752 KB Output is correct
57 Correct 85 ms 3668 KB Output is correct
58 Correct 225 ms 3668 KB Output is correct
59 Correct 208 ms 3752 KB Output is correct
60 Correct 259 ms 3848 KB Output is correct
61 Correct 197 ms 3676 KB Output is correct
62 Correct 217 ms 3416 KB Output is correct
63 Correct 195 ms 3664 KB Output is correct
64 Correct 221 ms 3752 KB Output is correct
65 Correct 226 ms 3772 KB Output is correct
66 Correct 240 ms 3760 KB Output is correct
67 Correct 449 ms 3760 KB Output is correct
68 Correct 443 ms 3752 KB Output is correct
69 Correct 422 ms 3756 KB Output is correct
70 Correct 385 ms 3748 KB Output is correct
71 Correct 222 ms 3748 KB Output is correct
72 Correct 226 ms 3748 KB Output is correct
73 Correct 238 ms 3748 KB Output is correct
74 Correct 248 ms 3668 KB Output is correct
75 Correct 87 ms 3668 KB Output is correct
76 Correct 91 ms 3748 KB Output is correct
77 Correct 81 ms 3752 KB Output is correct
78 Correct 64 ms 3668 KB Output is correct
79 Correct 162 ms 3756 KB Output is correct
80 Correct 236 ms 3760 KB Output is correct
81 Correct 183 ms 3772 KB Output is correct
82 Correct 167 ms 3764 KB Output is correct
83 Correct 177 ms 3668 KB Output is correct
84 Correct 311 ms 3756 KB Output is correct
85 Correct 358 ms 3760 KB Output is correct
86 Correct 339 ms 3764 KB Output is correct
87 Correct 367 ms 3796 KB Output is correct
88 Correct 412 ms 3760 KB Output is correct
89 Correct 498 ms 3760 KB Output is correct
90 Correct 483 ms 3788 KB Output is correct
91 Correct 458 ms 3756 KB Output is correct
92 Correct 47 ms 3668 KB Output is correct
93 Correct 738 ms 3760 KB Output is correct
94 Correct 763 ms 3768 KB Output is correct
95 Correct 737 ms 3764 KB Output is correct
96 Correct 765 ms 3756 KB Output is correct
97 Correct 765 ms 3772 KB Output is correct
98 Correct 721 ms 3756 KB Output is correct
99 Correct 766 ms 3756 KB Output is correct
100 Correct 732 ms 3668 KB Output is correct