#35823 (C++11) No.161 制限ジャンケン

• 問題: No.161 制限ジャンケン
• ユーザー: 4885rhkA
• 提出日時: 2015-07-10 10:54:23
• 言語: C++11 (gcc 13.3.0)
• 結果: AC
• 実行時間: 2 ms / 5,000 ms
• コード長: 2,328 bytes
• コンパイル時間: 626 ms
• コンパイル使用メモリ: 55,900 KB
• 実行使用メモリ: 5,248 KB
• 最終ジャッジ日時: 2024-11-30 04:45:00
• 合計ジャッジ時間: 1,374 ms
• ジャッジサーバーID （参考情報）: judge2 / judge1

ファイルパターン	結果
sample	AC * 3
other	AC * 16

ソースコード

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
//
//  main.cpp
//  Q256
//
//  Created by AkihiroKOBAYASHI on 7/10/15.
//  Copyright (c) 2015 Akhr5884. All rights reserved.
//
#include <iostream>
#include <string.h>
int main(int argc, const char * argv[]) {
    int te[3];
    int count = 0;
    int sum = 0;
    int point = 0;
    
    std::string aite;
//    char *moji;
//    int *already;
    char moji[1000];
    int already[1000];
    
    while(count < 3) {
        std::cin >> te[count];
        sum += te[count];
        count++;
    }
    
    std::cin >> aite;
//    moji = (char *)malloc( strlen(aite.c_str()) + 1 );
//    already = (int*)malloc( strlen(aite.c_str()) + 1  );
    std::sprintf(moji, "%s", aite.c_str());
    
    // win
    count = 0;
    while (count < sum) {
        already[count] = 0;
        switch(aite[count]) {
            case 'G':
                if(te[2] > 0) {
                    te[2]--;
                    point += 3;
                    already[count] = 1;
                }
                break;
            case 'C':
                if(te[0] > 0) {
                    te[0]--;
                    point += 3;
                    already[count] = 1;
                }
                break;
            case 'P':
                if(te[1] > 0) {
                    te[1]--;
                    point += 3;
                    already[count] = 1;
                }
                break;
        }
        count++;
    }
    // draw
    count = 0;
    while (count < sum) {
        if(already[count] != 1) {
            switch(aite[count]) {
                case 'G':
                    if(te[0] > 0) {
                        te[0]--;
                        point += 1;
                        already[count] = 1;
                    }
                    break;
                case 'C':
                    if(te[1] > 0) {
                        te[1]--;
                        point += 1;
                        already[count] = 1;
                    }
                    break;
                case 'P':
                    if(te[2] > 0) {
                        te[2]--;
                        point += 1;
                        already[count] = 1;
                    }
                    break;
            }
        }
        count++;
    }
    
    
    std::cout << point << "\n";
    
    return 0;
}
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX