[SW Expert Academy] 사랑의 카운슬러 (D3)

https://swexpertacademy.com/main/code/problem/problemDetail.do?contestProbId=AWlQUD2qtysDFAVS&categoryId=AWlQUD2qtysDFAVS&categoryType=CODE&problemTitle=%EC%82%AC%EB%9E%91%EC%9D%98&orderBy=FIRST_REG_DATETIME&selectCodeLang=ALL&select-1=&pageSize=10&pageIndex=1

SW Expert Academy

import java.util.Scanner;

class Solution {

	public static int earthworms[][];
	public static int group[];
	public static int n;
	public static long min;

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

		int t = sc.nextInt();

		for (int tc = 1; tc <= t; tc++) {
			n = sc.nextInt();

			min = Long.MAX_VALUE;
			earthworms= new int[n][2];
			group=new int[n];

			for (int i = 0; i < n; i++) {
				earthworms[i][0] = sc.nextInt();
				earthworms[i][1] = sc.nextInt();
			}

			comb(0, 0);

			System.out.println("#" + tc + " " + min);
		}
	}

	public static void comb(int start, int cnt) {
		if (cnt == n / 2) {
			long dx = 0, dy = 0;
			for (int i = 0; i < n; i++) {
				if (group[i] > 0) {
					dx += earthworms[i][0];
					dy += earthworms[i][1];
				} else {
					dx -= earthworms[i][0];
					dy -= earthworms[i][1];
				}
			}
			long vector = dx * dx + dy * dy;
			min = Math.min(vector, min);
			return;
		}

		for (int i = start; i < n; i++) {
			group[i] = 1;
			comb(i + 1, cnt + 1);
			group[i] = 0;
		}

	}
}

보고 공부한 블로그

https://comgong-man.tistory.com/36

[Java] SWEA 7227번 사랑의 카운슬러