UVa/uva-102.cpp at master · debugster/UVa · 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
#include <bits/stdc++.h>

using namespace std;

int main()
{
    freopen("in.txt", "r", stdin);
    freopen("out.txt", "w", stdout);

    char permute[6][4] = {"BCG", "BGC", "CBG", "CGB", "GBC", "GCB"};
    int i, j, pos, bin1[3], bin2[3], bin3[3];
    unsigned long long moves, minMoves;

    while (scanf("%d", &bin1[0]) != EOF) {
        for (i = 1; i < 3; i++) {
            scanf("%d", &bin1[i]);
        }

        for (i = 0; i < 3; i++) {
            scanf("%d", &bin2[i]);
        }

        for (i = 0; i < 3; i++) {
            scanf("%d", &bin3[i]);
        }

        minMoves = (unsigned long long) pow(2, 64) - 1;
        for (i = 0; i < 6; i++) {
            moves = 0;
            for (j = 0; j < 3; j++) {
                switch (permute[i][j]) {
                    case 'B':
                        switch (j) {
                            case 0:
                                moves += bin2[0] + bin3[0];
                                break;

                            case 1:
                                moves += bin1[0] + bin3[0];
                                break;

                            case 2:
                                moves += bin1[0] + bin2[0];
                                break;
                        }
                        break;

                    case 'G':
                        switch (j) {
                            case 0:
                                moves += bin2[1] + bin3[1];
                                break;

                            case 1:
                                moves += bin1[1] + bin3[1];
                                break;

                            case 2:
                                moves += bin1[1] + bin2[1];
                                break;
                        }
                        break;

                    case 'C':
                        switch (j) {
                            case 0:
                                moves += bin2[2] + bin3[2];
                                break;

                            case 1:
                                moves += bin1[2] + bin3[2];
                                break;

                            case 2:
                                moves += bin1[2] + bin2[2];
                                break;
                        }
                        break;
                }
            }

            if (moves < minMoves) {
                minMoves = moves;
                pos = i;
            }
        }
        printf("%s %d\n", permute[pos], minMoves);
    }

    return 0;
}