oj.uz

Submission #22977

# Submission time Handle Problem Language Result Execution time Memory
22977 2017-05-01T01:57:34 Z model_code Bowling (BOI15_bow) C++11
100 / 100
 106 ms 1260 KB 
/* Baltic Olympiad in Informatics 2015
 * Problem: BOW/Bowling
 * Model solution
 * Author: Karol Pokorski
 */

#include <cstdio>
#include <algorithm>
using namespace std;

typedef long long int LL;

const int MAXN = 10;
const int MAXSEQ = 21;
const int maxFrameScore[11] = {0, 10, 30, 60, 90, 120, 150, 180, 210, 240, 300};
const int MAXSCORE = 300;

int seqScore[MAXN];
LL dp[MAXN][MAXSCORE+1][3][2];
char seqMoves[MAXSEQ+1];

int main() {
    int numQueries;

    scanf("%d", &numQueries);

    while (numQueries--) {
        int numFrames;

        scanf("%d", &numFrames);
        scanf("%s", seqMoves);
        for (int i = 0; i < numFrames; i++)
            scanf("%d", &seqScore[i]);

        for (int frame = 0; frame < numFrames; frame++)
            for (int score = 0; score <= MAXSCORE; score++)
                for (int bonus1 = 0; bonus1 <= 2; bonus1++)
                    for (int bonus2 = 0; bonus2 <= 1; bonus2++)
                        dp[frame][score][bonus1][bonus2] = 0LL;

        dp[0][0][0][0] = 1LL;

        // first n-1 frames
        for (int frame = 0; frame < numFrames-1; frame++) {
            char firstMove = seqMoves[2*frame], secondMove = seqMoves[2*frame+1];
            int prev0Score = seqScore[frame];
            int prev1Score = (frame > 0) ? seqScore[frame-1] : -1;
            int prev2Score = (frame > 1) ? seqScore[frame-2] : -1;

            for (int score = 0; score <= maxFrameScore[frame]; score++)
                for (int bonus1 = 0; bonus1 <= 2; bonus1++)
                    for (int bonus2 = 0; bonus2 <= 1; bonus2++) {
                        if (dp[frame][score][bonus1][bonus2] == 0LL) continue;

                        for (int move1 = 0; move1 <= 10; move1++) {
                            if ((firstMove >= '0') && (firstMove <= '9') && (move1 != firstMove-'0')) continue;
                            if ((firstMove == 'x') && (move1 != 10)) continue;
                            if ((secondMove == '/') && (move1 == 10)) continue;

                            for (int move2 = 0; move1+move2 <= 10; move2++) {
                                if ((secondMove >= '0') && (secondMove <= '9') && (move2 != secondMove-'0')) continue;
                                if ((secondMove == '/') && (move1+move2 != 10)) continue;
                                if ((secondMove == '-') && (move1 != 10)) continue;
                                if ((move1+move2 == 10) && (secondMove >= '0') && (secondMove <= '9')) continue;

                                int prev1Bonus = 0, prev2Bonus = 0;
                                if (bonus2 == 1) prev1Bonus = move1;
                                if (bonus1 == 1) prev2Bonus = move1;
                                if (bonus1 == 2) prev2Bonus = move1+move2;

                                int nowScore = score + prev1Bonus + prev2Bonus + (move1+move2);
                                int nowPrev1Score = nowScore - (move1+move2);

                                int newBonus1, newBonus2;

                                if (move1 == 10) { newBonus1 = 2; newBonus2 = max(bonus1-1, 0); }
                                else if (move1 + move2 == 10) { newBonus1 = 1; newBonus2 = 0; }
                                else { newBonus1 = 0; newBonus2 = 0; }

                                if (bonus2 == 1) {
                                    int nowPrev2Score = nowPrev1Score - (move1+move2) - 10;
                                    if ((prev2Score != -1) && (nowPrev2Score != prev2Score)) {
                                        continue;
                                    }
                                }
                                if ((bonus1 == 1) || ((bonus1 == 2) && (move1 != 10))) {
                                    if ((prev1Score != -1) && (nowPrev1Score != prev1Score)) {
                                        continue;
                                    }
                                }
                                if (move1+move2 != 10) {
                                    if ((prev0Score != -1) && (nowScore != prev0Score)) {
                                        continue;
                                    }
                                }

                                dp[frame+1][nowScore][newBonus1][newBonus2] =
                                    (dp[frame+1][nowScore][newBonus1][newBonus2] + dp[frame][score][bonus1][bonus2]);
                            }
                        }
                    }
        }

        // last frame
        LL result = 0LL;
        char firstMove  = seqMoves[2*(numFrames-1)],
             secondMove = seqMoves[2*(numFrames-1)+1],
             thirdMove  = seqMoves[2*(numFrames-1)+2];
        int prev0Score = seqScore[numFrames-1];
        int prev1Score = (numFrames > 1) ? seqScore[numFrames-2] : -1;
        int prev2Score = (numFrames > 2) ? seqScore[numFrames-3] : -1;

        for (int score = 0; score <= MAXSCORE; score++)
            for (int bonus1 = 0; bonus1 <= 2; bonus1++)
                for (int bonus2 = 0; bonus2 <= 1; bonus2++) {
                    if (dp[numFrames-1][score][bonus1][bonus2] == 0LL) continue;

                    for (int move1 = 0; move1 <= 10; move1++) {
                        if ((firstMove >= '0') && (firstMove <= '9') && (move1 != firstMove-'0')) continue;
                        if ((firstMove == 'x') && (move1 != 10)) continue;
                        if ((secondMove == '/') && (move1 == 10)) continue;

                        for (int move2 = 0; move2 <= 10; move2++) {
                            if ((secondMove >= '0') && (secondMove <= '9') && (move2 != secondMove-'0')) continue;
                            if ((secondMove == 'x') && (move2 != 10)) continue;
                            if ((secondMove == '/') && (move1+move2 != 10)) continue;
                            if ((thirdMove == '/') && (move2 == 10)) continue;
                            if ((move1 != 10) && (move1+move2 > 10)) continue;
                            if ((move1+move2 == 10) && (move1 != 10) && (secondMove >= '0') && (secondMove <= '9')) continue;

                            //moje poprawki
                            if ((secondMove == 'x') && (move1 != 10)) continue;
                            //koniec moich poprawek

                            int move3Max = ((move1 == 10) || (move1+move2 == 10)) ? 10 : 0;

                            for (int move3 = 0; move3 <= move3Max; move3++) {
                                if ((thirdMove >= '0') && (thirdMove <= '9') && (move3 != thirdMove-'0')) continue;
                                if ((thirdMove == 'x') && (move3 != 10)) continue;

                                if ((thirdMove == '/') && (move2+move3 != 10)) continue;
                                if ((move2 != 10) && (move1+move2 != 10) && (move2+move3 > 10)) continue;
                                if ((thirdMove == '-') && (move1+move2 >= 10)) continue;
                                if ((thirdMove == '/') && (move1+move2 == 10) && (move1 != 10)) continue;

                                //moje poprawki
                                if (thirdMove == 'x') {
                                    if(move2 != 10 &&  ((move1 == 10 && move2 == 0) || (move1 + move2 < 10))) {
                                        continue;
                                    }
                                }
                                if ((thirdMove == '0') && move1 + move2 < 10) continue;

                                if ((move1 == 10 || move1 + move2 != 10)&&(move2 != 10) &&(move2+move3 == 10) && (thirdMove >= '0') && (thirdMove <= '9')) continue;
                                //koniec moich poprawek

                                int prev1Bonus = 0, prev2Bonus = 0;
                                if (bonus2 == 1) prev1Bonus = move1;
                                if (bonus1 == 1) prev2Bonus = move1;
                                if (bonus1 == 2) prev2Bonus = move1+move2;

                                int nowScore = score + prev1Bonus + prev2Bonus + (move1+move2+move3);
                                int nowPrev1Score = nowScore - (move1+move2+move3);

                                if (bonus2 == 1) {
                                    int nowPrev2Score = nowPrev1Score - (move1+move2) - 10;
                                    if ((prev2Score != -1) && (nowPrev2Score != prev2Score)) {
                                        continue;
                                    }
                                }
                                if (bonus1 >= 1) {
                                    if ((prev1Score != -1) && (nowPrev1Score != prev1Score)) {
                                        continue;
                                    }
                                }
                                {
                                    if ((prev0Score != -1) && (nowScore != prev0Score)) {
                                        continue;
                                    }
                                }
                                //fprintf(stderr,"got %d %d %d\n", move1, move2, move3);
                                result = (result + dp[numFrames-1][score][bonus1][bonus2]);
                            }
                        }
                    }
                }

        printf("%Ld\n", result);
    }

    return 0;
}

Compilation message

bow.cpp: In function 'int main()':
bow.cpp:25:29: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d", &numQueries);
                             ^
bow.cpp:30:32: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%d", &numFrames);
                                ^
bow.cpp:31:30: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         scanf("%s", seqMoves);
                              ^
bow.cpp:33:38: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
             scanf("%d", &seqScore[i]);
                                      ^

Subtask #1
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 1260 KB Output is correct
2 Correct 0 ms 1260 KB Output is correct
3 Correct 0 ms 1260 KB Output is correct
4 Correct 0 ms 1260 KB Output is correct
5 Correct 0 ms 1260 KB Output is correct
6 Correct 0 ms 1260 KB Output is correct
7 Correct 0 ms 1260 KB Output is correct
8 Correct 0 ms 1260 KB Output is correct
9 Correct 0 ms 1260 KB Output is correct
10 Correct 0 ms 1260 KB Output is correct
11 Correct 0 ms 1260 KB Output is correct
12 Correct 0 ms 1260 KB Output is correct
13 Correct 0 ms 1260 KB Output is correct
14 Correct 0 ms 1260 KB Output is correct
15 Correct 0 ms 1260 KB Output is correct

Subtask #2
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 1260 KB Output is correct
2 Correct 3 ms 1260 KB Output is correct
3 Correct 0 ms 1260 KB Output is correct
4 Correct 0 ms 1260 KB Output is correct
5 Correct 0 ms 1260 KB Output is correct
6 Correct 0 ms 1260 KB Output is correct
7 Correct 3 ms 1260 KB Output is correct
8 Correct 3 ms 1260 KB Output is correct
9 Correct 0 ms 1260 KB Output is correct
10 Correct 9 ms 1260 KB Output is correct
11 Correct 6 ms 1260 KB Output is correct
12 Correct 3 ms 1260 KB Output is correct
13 Correct 9 ms 1260 KB Output is correct
14 Correct 3 ms 1260 KB Output is correct
15 Correct 3 ms 1260 KB Output is correct
16 Correct 3 ms 1260 KB Output is correct
17 Correct 3 ms 1260 KB Output is correct
18 Correct 9 ms 1260 KB Output is correct
19 Correct 9 ms 1260 KB Output is correct
20 Correct 13 ms 1260 KB Output is correct
21 Correct 13 ms 1260 KB Output is correct

Subtask #3
26.0 / 26.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 1260 KB Output is correct
2 Correct 0 ms 1260 KB Output is correct
3 Correct 0 ms 1260 KB Output is correct
4 Correct 0 ms 1260 KB Output is correct
5 Correct 0 ms 1260 KB Output is correct
6 Correct 0 ms 1260 KB Output is correct
7 Correct 0 ms 1260 KB Output is correct
8 Correct 0 ms 1260 KB Output is correct
9 Correct 0 ms 1260 KB Output is correct
10 Correct 0 ms 1260 KB Output is correct
11 Correct 0 ms 1260 KB Output is correct
12 Correct 0 ms 1260 KB Output is correct
13 Correct 0 ms 1260 KB Output is correct
14 Correct 0 ms 1260 KB Output is correct
15 Correct 0 ms 1260 KB Output is correct
16 Correct 0 ms 1260 KB Output is correct
17 Correct 0 ms 1260 KB Output is correct
18 Correct 0 ms 1260 KB Output is correct
19 Correct 0 ms 1260 KB Output is correct
20 Correct 0 ms 1260 KB Output is correct
21 Correct 0 ms 1260 KB Output is correct

Subtask #4
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 1260 KB Output is correct
2 Correct 0 ms 1260 KB Output is correct
3 Correct 0 ms 1260 KB Output is correct
4 Correct 0 ms 1260 KB Output is correct
5 Correct 0 ms 1260 KB Output is correct
6 Correct 0 ms 1260 KB Output is correct
7 Correct 0 ms 1260 KB Output is correct
8 Correct 0 ms 1260 KB Output is correct
9 Correct 0 ms 1260 KB Output is correct
10 Correct 6 ms 1260 KB Output is correct
11 Correct 6 ms 1260 KB Output is correct
12 Correct 6 ms 1260 KB Output is correct
13 Correct 6 ms 1260 KB Output is correct
14 Correct 0 ms 1260 KB Output is correct
15 Correct 0 ms 1260 KB Output is correct
16 Correct 0 ms 1260 KB Output is correct
17 Correct 0 ms 1260 KB Output is correct
18 Correct 0 ms 1260 KB Output is correct
19 Correct 0 ms 1260 KB Output is correct
20 Correct 0 ms 1260 KB Output is correct
21 Correct 0 ms 1260 KB Output is correct

Subtask #5
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 1260 KB Output is correct
2 Correct 0 ms 1260 KB Output is correct
3 Correct 0 ms 1260 KB Output is correct
4 Correct 0 ms 1260 KB Output is correct
5 Correct 0 ms 1260 KB Output is correct
6 Correct 0 ms 1260 KB Output is correct
7 Correct 0 ms 1260 KB Output is correct
8 Correct 0 ms 1260 KB Output is correct
9 Correct 0 ms 1260 KB Output is correct
10 Correct 0 ms 1260 KB Output is correct
11 Correct 0 ms 1260 KB Output is correct
12 Correct 0 ms 1260 KB Output is correct
13 Correct 0 ms 1260 KB Output is correct
14 Correct 0 ms 1260 KB Output is correct
15 Correct 0 ms 1260 KB Output is correct
16 Correct 3 ms 1260 KB Output is correct
17 Correct 3 ms 1260 KB Output is correct
18 Correct 0 ms 1260 KB Output is correct
19 Correct 0 ms 1260 KB Output is correct
20 Correct 0 ms 1260 KB Output is correct
21 Correct 0 ms 1260 KB Output is correct
22 Correct 3 ms 1260 KB Output is correct
23 Correct 3 ms 1260 KB Output is correct
24 Correct 0 ms 1260 KB Output is correct
25 Correct 9 ms 1260 KB Output is correct
26 Correct 6 ms 1260 KB Output is correct
27 Correct 3 ms 1260 KB Output is correct
28 Correct 9 ms 1260 KB Output is correct
29 Correct 3 ms 1260 KB Output is correct
30 Correct 3 ms 1260 KB Output is correct
31 Correct 3 ms 1260 KB Output is correct
32 Correct 3 ms 1260 KB Output is correct
33 Correct 9 ms 1260 KB Output is correct
34 Correct 9 ms 1260 KB Output is correct
35 Correct 13 ms 1260 KB Output is correct
36 Correct 13 ms 1260 KB Output is correct
37 Correct 6 ms 1260 KB Output is correct
38 Correct 0 ms 1260 KB Output is correct
39 Correct 0 ms 1260 KB Output is correct
40 Correct 0 ms 1260 KB Output is correct
41 Correct 0 ms 1260 KB Output is correct
42 Correct 0 ms 1260 KB Output is correct
43 Correct 0 ms 1260 KB Output is correct
44 Correct 0 ms 1260 KB Output is correct
45 Correct 0 ms 1260 KB Output is correct
46 Correct 0 ms 1260 KB Output is correct
47 Correct 0 ms 1260 KB Output is correct
48 Correct 0 ms 1260 KB Output is correct
49 Correct 0 ms 1260 KB Output is correct
50 Correct 0 ms 1260 KB Output is correct
51 Correct 0 ms 1260 KB Output is correct
52 Correct 0 ms 1260 KB Output is correct
53 Correct 0 ms 1260 KB Output is correct
54 Correct 0 ms 1260 KB Output is correct
55 Correct 0 ms 1260 KB Output is correct
56 Correct 0 ms 1260 KB Output is correct
57 Correct 0 ms 1260 KB Output is correct
58 Correct 3 ms 1260 KB Output is correct
59 Correct 0 ms 1260 KB Output is correct
60 Correct 0 ms 1260 KB Output is correct
61 Correct 0 ms 1260 KB Output is correct
62 Correct 0 ms 1260 KB Output is correct
63 Correct 0 ms 1260 KB Output is correct
64 Correct 0 ms 1260 KB Output is correct
65 Correct 0 ms 1260 KB Output is correct
66 Correct 0 ms 1260 KB Output is correct
67 Correct 6 ms 1260 KB Output is correct
68 Correct 6 ms 1260 KB Output is correct
69 Correct 6 ms 1260 KB Output is correct
70 Correct 6 ms 1260 KB Output is correct
71 Correct 0 ms 1260 KB Output is correct
72 Correct 0 ms 1260 KB Output is correct
73 Correct 0 ms 1260 KB Output is correct
74 Correct 0 ms 1260 KB Output is correct
75 Correct 0 ms 1260 KB Output is correct
76 Correct 0 ms 1260 KB Output is correct
77 Correct 0 ms 1260 KB Output is correct
78 Correct 0 ms 1260 KB Output is correct
79 Correct 13 ms 1260 KB Output is correct
80 Correct 6 ms 1260 KB Output is correct
81 Correct 3 ms 1260 KB Output is correct
82 Correct 0 ms 1260 KB Output is correct
83 Correct 0 ms 1260 KB Output is correct
84 Correct 0 ms 1260 KB Output is correct
85 Correct 0 ms 1260 KB Output is correct
86 Correct 0 ms 1260 KB Output is correct
87 Correct 0 ms 1260 KB Output is correct
88 Correct 3 ms 1260 KB Output is correct
89 Correct 6 ms 1260 KB Output is correct
90 Correct 6 ms 1260 KB Output is correct
91 Correct 6 ms 1260 KB Output is correct
92 Correct 0 ms 1260 KB Output is correct
93 Correct 103 ms 1260 KB Output is correct
94 Correct 106 ms 1260 KB Output is correct
95 Correct 103 ms 1260 KB Output is correct
96 Correct 96 ms 1260 KB Output is correct
97 Correct 99 ms 1260 KB Output is correct
98 Correct 103 ms 1260 KB Output is correct
99 Correct 103 ms 1260 KB Output is correct
100 Correct 103 ms 1260 KB Output is correct