[SW Expert Academy] 규영이와 인영이의 카드게임 (D3)

https://swexpertacademy.com/main/code/problem/problemDetail.do?problemLevel=3&contestProbId=AWgv9va6HnkDFAW0&categoryId=AWgv9va6HnkDFAW0&categoryType=CODE&problemTitle=%EA%B7%9C%EC%98%81%EC%9D%B4%EC%99%80&orderBy=PASS_RATE&selectCodeLang=JAVA&select-1=3&pageSize=10&pageIndex=1

SW Expert Academy

 

import java.util.Scanner;

class Solution {

	static int N = 18;
	static int R = 9;

	static int gu[]; // 규영 점수
	static int in[]; // 인영 점수
	static boolean isSelected[]; // 선택 여부
	static int rem_card[]; // 남은 숫자들
	static int win; // 이긴 횟수

	public static void game(int cnt) {

		if (cnt == R) { // base case
			int gu_point = 0;
			int in_point = 0;
			for (int i = 0; i < R; i++) {
				if (gu[i] > in[i]) {
					gu_point += gu[i] + in[i];
				} else {
					in_point += gu[i] + in[i];
				}
			}
			if (gu_point > in_point)
				win++;
			return;
		}

		for (int i = 0; i < R; i++) {
			if (isSelected[i]) {
				continue;
			}
			in[cnt] = rem_card[i]; //이 부분 중요
			isSelected[i] = true;
			game(cnt + 1);
			isSelected[i] = false;
		}

	}

	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);

		int t = sc.nextInt();

		for (int tc = 1; tc <= t; tc++) {
			gu = new int[9];
			in = new int[9];
			isSelected = new boolean[9];
			rem_card = new int[9];
			win = 0;

			int idx = 0;
			boolean cnt[] = new boolean[18];

			// 규영이한테 숫자 넣고, 남은 숫자 배열 관리하기
			for (int i = 0; i < R; i++) {
				gu[i] = sc.nextInt();
				cnt[gu[i] - 1] = true;
			}

			for (int i = 0; i < N; i++) {
				if (cnt[i] == true)
					continue;
				rem_card[idx++] = i + 1; // 남은 숫자들 rem_card에 들어감
			}

			game(0);

			System.out.println("#" + tc + " " + win + " " + (362880 - win));
		}

	}
}

 

 

참고

https://velog.io/@dot2__/SWEA-6808%EB%B2%88-%EA%B7%9C%EC%98%81%EC%9D%B4%EC%99%80-%EC%9D%B8%EC%98%81%EC%9D%B4%EC%9D%98-%EC%B9%B4%EB%93%9C%EA%B2%8C%EC%9E%84Java