[백준]_2621_카드게임

 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

import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.HashMap;
import java.util.Map;
import java.util.StringTokenizer;

public class B2621 {

	public static int[] color, digit;
	static int max_num, pair;
	// 각 상태와 max값, pair 값 등을 저장할 Map 선언
	static Map<String, Integer> state;
	public static void main(String[] args) throws IOException {
		BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
		StringBuilder sb = new StringBuilder();
		StringTokenizer st;
		color = new int[4];
		digit = new int[10];
		state = new HashMap<>();
		for (int i = 0; i < 5; i++) {
			st = new StringTokenizer(br.readLine());
			char C = st.nextToken().charAt(0);
			int d = Integer.parseInt(st.nextToken());
			
			// 색깔 저장
			if (C == 'R')
				color[0]++;
			else if (C == 'B')
				color[1]++;
			else if (C == 'Y')
				color[2]++;
			else
				color[3]++;
			// 숫자 저장
			digit[d]++;
			max_num = Math.max(max_num, d);
		}
		// flush와 straight 상태 저장
		for (int i = 0; i < 4; i++) {
			if (color[i] == 5) {
				state.put("flush",i);
				break;
			}
		}
		for (int i = 0; i < 6; i++) {
			if (digit[i] == 1 && digit[i + 1] == 1 && digit[i + 2] == 1 && digit[i + 3] == 1 && digit[i + 4] == 1) {
				state.put("straight",i);
				break;
			}
		}
		// flush와 straight일 경우 점수 return
		if(state.containsKey("flush")||state.containsKey("straight")) {
			if(state.containsKey("flush") && state.containsKey("straight")) 
				System.out.println(900 + max_num);
			else if(state.containsKey("flush"))
				System.out.println(600 + max_num);
			else if(state.containsKey("straight"))
				System.out.println(500 + max_num);
			return ;
		}

		// 같은 숫자 카드가 2,3,4장인지 확인
		for (int i = 0; i < 10; i++) {
			if (digit[i] == 2) {
				if(state.containsKey("pair"))
					state.put("two_pair",i);
				else state.put("pair",i);
			}else if(digit[i] == 3) {
				state.put("triple",i);
			}else if(digit[i] == 4) {
				state.put("four",i);
			}
		}
		if(state.containsKey("four")) 
			System.out.println(800 + state.get("four"));
		else if(state.containsKey("triple")) {
			int n = state.containsKey("pair") ? 700+10*state.get("triple") + state.get("pair"): 400 + state.get("triple");
			System.out.println(n);
		}
		else if(state.containsKey("pair")) {
			if(state.containsKey("two_pair")) {
				int min_pair = Math.min(state.get("pair"), state.get("two_pair"));
				int max_pair = Math.max(state.get("pair"), state.get("two_pair"));
				System.out.println(300+10*max_pair + min_pair);
			}else
				System.out.println(200 + state.get("pair"));
		}
		else
			System.out.println(100 + max_num);

	}
}