Algorithm-C-/alpha-yut-e.cpp at master · Faith0918/Algorithm-C- · GitHub

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

using namespace std;
int maxx = 0;
int n,tc;
int result[11] = {};
int map[35] = { 0,5,10,15,20,50,30,35,40,45,100,55,60,65,70,75,80,85,90,95,500,1000,275,250,300,150,175,150,125,350,400 };
int score[11] = {};
int horse[5] = { 0 };
int m[35][6] = { 0 };

void init() {
    for (int i = 0; i < 5; i++) {
        horse[i] = 0;
    }
    for (int i = 0; i < 11; i++) {
        score[i] = 0;
    }
}
int main() {

    int temp[11][6] = { {5,22,23,24,25,26},
      {10,27,28,24,29,30},
      {22,23,24,25,26,15},
      {23,24,25,26,15,16},
      {24,29,30,20,21,21},
      {25,26,15,16,17,18},
      {26,15,16,17,18,19},
      {27,28,24,29,30,20},
      {28,24,29,30,20,21},
      {29,30,20,21,21,21},
      {30,20,21,21,21,21}
    };
    for (int i = 0; i < 11; i++) {
        for (int j = 1; j < 6; j++) {
            m[temp[i][0]][j] = temp[i][j];
        }

    }
    cin >> tc;
    for (int t = 0; t < tc; t++) {
        n = 10;
        int a[11];
        int seq[11];
        init();
        for (int i = 0; i < n; i++) {
            cin >> a[i];
        }
        int w;
        for (int i = 0; i < n; i++) {
            cin >> seq[i];

        }
        for (int i = 0; i < n; i++) {
            bool flag = false;
            bool finish = false;
            if (horse[seq[i]] == 21) continue;
            for (int j = 0; j < 11; j++) {
                if (temp[j][0] == horse[seq[i]]) {
                    flag = true;
                }
            }
            if (flag) {
                horse[seq[i]] = m[horse[seq[i]]][a[i]];
            }
            else {
                if (horse[seq[i]] + a[i] >= 21) {
                    finish = true;
                    horse[seq[i]] = 21;

                }
                else {
                    horse[seq[i]] += a[i];
                }

            }

            if (!finish) {
                for (int j = 1; j < 5; j++) {
                    if (j != seq[i] && horse[seq[i]] == horse[j] && horse[j] != 21) {
                        //crash
                        result[t] = -1;
                        break;
                    }
                }
            }
            if (result[t] == -1) continue;
            score[i] = map[horse[seq[i]]];
        }
        /*cout << "score : ";
        for (int i = 0; i < n; i++) {
            result[t] += score[i];
            cout << score[i] << "\t";
        }
        cout << "\n";
        if (result[t] > maxx) maxx = result[t];*/
        int ret = -1;
        for (int i = 1; i <= 4; i++) {
            ret += map[horse[i]];
        }
        if (ret > maxx) maxx = ret;
    }

    cout << maxx;

    return 0;
}