oj.uz

답안 #725486

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
725486 2023-04-17T14:10:09 Z berr Bowling (BOI15_bow) C++17
100 / 100
 757 ms 3840 KB 
#include <bits/stdc++.h>
using namespace std;
#pragma GCC optimize("O3,unroll-loops")

long long dp[11][305][12][12];
vector<string> all, all3;
 
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;
        }
 
    }
 
 
 
    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]]++;
                }
            }
        }
    }
 
    long long 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;
 
                            if(p[ind-1]!=-1){
                                int k=p[ind-1];
                                 int f=k-sum;
 
                                 if(f>=0){
                                dp[ind-1][f][10][i] += dp[ind][k][i][j]; 
                                if(ind==1&&f==0) ans +=dp[ind][k][i][j];
                                }
                            }
                            else{
                                for(int k=sum; k<=300; k++){
                                    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++){
 
                            
                            if(p[ind-1]!=-1){
                                int k=p[ind-1];
                                int f=k-ssum;
 
                                if(f>=0){
                                dp[ind-1][f][x[0]][x[1]] +=  dp[ind][k][i][j];
 
                                if(f==0&&ind==1){
                                    ans+=dp[ind][k][i][j];
                                } 
                                }
                            }
                            else{
                                for(int k=ssum; k<=300; k++){
                                    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);
    
 
    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);
        }
    }
 
    
    int t; cin >> t;
    while(t--){
        solve();
    }
}

Compilation message

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

Subtask #1
16.0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 71 ms 3716 KB Output is correct
2 Correct 18 ms 3432 KB Output is correct
3 Correct 3 ms 3412 KB Output is correct
4 Correct 4 ms 3668 KB Output is correct
5 Correct 4 ms 3668 KB Output is correct
6 Correct 4 ms 3668 KB Output is correct
7 Correct 56 ms 3772 KB Output is correct
8 Correct 47 ms 3668 KB Output is correct
9 Correct 47 ms 3756 KB Output is correct
10 Correct 40 ms 3692 KB Output is correct
11 Correct 52 ms 3752 KB Output is correct
12 Correct 93 ms 980 KB Output is correct
13 Correct 17 ms 1032 KB Output is correct
14 Correct 82 ms 1020 KB Output is correct
15 Correct 21 ms 1012 KB Output is correct

Subtask #2
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 114 ms 3756 KB Output is correct
2 Correct 137 ms 3760 KB Output is correct
3 Correct 104 ms 3756 KB Output is correct
4 Correct 89 ms 3728 KB Output is correct
5 Correct 126 ms 3676 KB Output is correct
6 Correct 122 ms 3756 KB Output is correct
7 Correct 117 ms 3768 KB Output is correct
8 Correct 138 ms 3756 KB Output is correct
9 Correct 118 ms 3756 KB Output is correct
10 Correct 340 ms 3756 KB Output is correct
11 Correct 358 ms 3752 KB Output is correct
12 Correct 309 ms 3668 KB Output is correct
13 Correct 332 ms 3756 KB Output is correct
14 Correct 198 ms 3668 KB Output is correct
15 Correct 178 ms 3756 KB Output is correct
16 Correct 169 ms 3756 KB Output is correct
17 Correct 182 ms 3756 KB Output is correct
18 Correct 347 ms 3752 KB Output is correct
19 Correct 378 ms 3756 KB Output is correct
20 Correct 386 ms 3756 KB Output is correct
21 Correct 371 ms 3668 KB Output is correct

Subtask #3
26.0 / 26.0

# 결과 실행 시간 메모리 Grader output
1 Correct 62 ms 3760 KB Output is correct
2 Correct 19 ms 3668 KB Output is correct
3 Correct 23 ms 3668 KB Output is correct
4 Correct 16 ms 3728 KB Output is correct
5 Correct 25 ms 3724 KB Output is correct
6 Correct 30 ms 3668 KB Output is correct
7 Correct 33 ms 3668 KB Output is correct
8 Correct 36 ms 3668 KB Output is correct
9 Correct 39 ms 3668 KB Output is correct
10 Correct 75 ms 3756 KB Output is correct
11 Correct 45 ms 3668 KB Output is correct
12 Correct 38 ms 3668 KB Output is correct
13 Correct 33 ms 3668 KB Output is correct
14 Correct 102 ms 3756 KB Output is correct
15 Correct 111 ms 3760 KB Output is correct
16 Correct 92 ms 3668 KB Output is correct
17 Correct 99 ms 3668 KB Output is correct
18 Correct 27 ms 3776 KB Output is correct
19 Correct 28 ms 3668 KB Output is correct
20 Correct 43 ms 3752 KB Output is correct
21 Correct 32 ms 3668 KB Output is correct

Subtask #4
23.0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 194 ms 3752 KB Output is correct
2 Correct 158 ms 3772 KB Output is correct
3 Correct 202 ms 3716 KB Output is correct
4 Correct 180 ms 3716 KB Output is correct
5 Correct 148 ms 3404 KB Output is correct
6 Correct 116 ms 3764 KB Output is correct
7 Correct 147 ms 3752 KB Output is correct
8 Correct 141 ms 3760 KB Output is correct
9 Correct 142 ms 3760 KB Output is correct
10 Correct 447 ms 3764 KB Output is correct
11 Correct 418 ms 3756 KB Output is correct
12 Correct 404 ms 3760 KB Output is correct
13 Correct 359 ms 3756 KB Output is correct
14 Correct 189 ms 3756 KB Output is correct
15 Correct 166 ms 3752 KB Output is correct
16 Correct 174 ms 3756 KB Output is correct
17 Correct 187 ms 3760 KB Output is correct
18 Correct 65 ms 3756 KB Output is correct
19 Correct 50 ms 3668 KB Output is correct
20 Correct 51 ms 3756 KB Output is correct
21 Correct 41 ms 3756 KB Output is correct

Subtask #5
18.0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 71 ms 3716 KB Output is correct
2 Correct 18 ms 3432 KB Output is correct
3 Correct 3 ms 3412 KB Output is correct
4 Correct 4 ms 3668 KB Output is correct
5 Correct 4 ms 3668 KB Output is correct
6 Correct 4 ms 3668 KB Output is correct
7 Correct 56 ms 3772 KB Output is correct
8 Correct 47 ms 3668 KB Output is correct
9 Correct 47 ms 3756 KB Output is correct
10 Correct 40 ms 3692 KB Output is correct
11 Correct 52 ms 3752 KB Output is correct
12 Correct 93 ms 980 KB Output is correct
13 Correct 17 ms 1032 KB Output is correct
14 Correct 82 ms 1020 KB Output is correct
15 Correct 21 ms 1012 KB Output is correct
16 Correct 114 ms 3756 KB Output is correct
17 Correct 137 ms 3760 KB Output is correct
18 Correct 104 ms 3756 KB Output is correct
19 Correct 89 ms 3728 KB Output is correct
20 Correct 126 ms 3676 KB Output is correct
21 Correct 122 ms 3756 KB Output is correct
22 Correct 117 ms 3768 KB Output is correct
23 Correct 138 ms 3756 KB Output is correct
24 Correct 118 ms 3756 KB Output is correct
25 Correct 340 ms 3756 KB Output is correct
26 Correct 358 ms 3752 KB Output is correct
27 Correct 309 ms 3668 KB Output is correct
28 Correct 332 ms 3756 KB Output is correct
29 Correct 198 ms 3668 KB Output is correct
30 Correct 178 ms 3756 KB Output is correct
31 Correct 169 ms 3756 KB Output is correct
32 Correct 182 ms 3756 KB Output is correct
33 Correct 347 ms 3752 KB Output is correct
34 Correct 378 ms 3756 KB Output is correct
35 Correct 386 ms 3756 KB Output is correct
36 Correct 371 ms 3668 KB Output is correct
37 Correct 62 ms 3760 KB Output is correct
38 Correct 19 ms 3668 KB Output is correct
39 Correct 23 ms 3668 KB Output is correct
40 Correct 16 ms 3728 KB Output is correct
41 Correct 25 ms 3724 KB Output is correct
42 Correct 30 ms 3668 KB Output is correct
43 Correct 33 ms 3668 KB Output is correct
44 Correct 36 ms 3668 KB Output is correct
45 Correct 39 ms 3668 KB Output is correct
46 Correct 75 ms 3756 KB Output is correct
47 Correct 45 ms 3668 KB Output is correct
48 Correct 38 ms 3668 KB Output is correct
49 Correct 33 ms 3668 KB Output is correct
50 Correct 102 ms 3756 KB Output is correct
51 Correct 111 ms 3760 KB Output is correct
52 Correct 92 ms 3668 KB Output is correct
53 Correct 99 ms 3668 KB Output is correct
54 Correct 27 ms 3776 KB Output is correct
55 Correct 28 ms 3668 KB Output is correct
56 Correct 43 ms 3752 KB Output is correct
57 Correct 32 ms 3668 KB Output is correct
58 Correct 194 ms 3752 KB Output is correct
59 Correct 158 ms 3772 KB Output is correct
60 Correct 202 ms 3716 KB Output is correct
61 Correct 180 ms 3716 KB Output is correct
62 Correct 148 ms 3404 KB Output is correct
63 Correct 116 ms 3764 KB Output is correct
64 Correct 147 ms 3752 KB Output is correct
65 Correct 141 ms 3760 KB Output is correct
66 Correct 142 ms 3760 KB Output is correct
67 Correct 447 ms 3764 KB Output is correct
68 Correct 418 ms 3756 KB Output is correct
69 Correct 404 ms 3760 KB Output is correct
70 Correct 359 ms 3756 KB Output is correct
71 Correct 189 ms 3756 KB Output is correct
72 Correct 166 ms 3752 KB Output is correct
73 Correct 174 ms 3756 KB Output is correct
74 Correct 187 ms 3760 KB Output is correct
75 Correct 65 ms 3756 KB Output is correct
76 Correct 50 ms 3668 KB Output is correct
77 Correct 51 ms 3756 KB Output is correct
78 Correct 41 ms 3756 KB Output is correct
79 Correct 159 ms 3668 KB Output is correct
80 Correct 155 ms 3840 KB Output is correct
81 Correct 117 ms 3752 KB Output is correct
82 Correct 98 ms 3756 KB Output is correct
83 Correct 87 ms 3760 KB Output is correct
84 Correct 42 ms 3756 KB Output is correct
85 Correct 59 ms 3688 KB Output is correct
86 Correct 39 ms 3752 KB Output is correct
87 Correct 49 ms 3668 KB Output is correct
88 Correct 254 ms 3760 KB Output is correct
89 Correct 333 ms 3756 KB Output is correct
90 Correct 320 ms 3768 KB Output is correct
91 Correct 347 ms 3756 KB Output is correct
92 Correct 37 ms 3668 KB Output is correct
93 Correct 757 ms 3764 KB Output is correct
94 Correct 729 ms 3756 KB Output is correct
95 Correct 739 ms 3788 KB Output is correct
96 Correct 723 ms 3756 KB Output is correct
97 Correct 744 ms 3756 KB Output is correct
98 Correct 728 ms 3788 KB Output is correct
99 Correct 755 ms 3760 KB Output is correct
100 Correct 720 ms 3756 KB Output is correct