Submission #1188685

---

Source Code Expand

import java.util.ArrayList;
import java.util.Map;
import java.util.Scanner;
import java.util.TreeMap;
import java.util.TreeSet;

public class Main {


	public static void main(String[] args) {
		// TODO 自動生成されたメソッド・スタブ
		Scanner scan = new Scanner(System.in);
		int n = scan.nextInt();
		int m = scan.nextInt();


		int[] x  = new int[m];
		int[] y = new int[m];
		Map<Integer, TreeSet<Integer>> lawmakerMap = new TreeMap<>();


		for(int i = 0; i < m; i++) {
			x[i] = scan.nextInt();
			y[i] = scan.nextInt();
		}
		scan.close();
		for(int i = 1; i <= n; i++) {
			lawmakerMap.put(i, new TreeSet<>());
		}

		//関係のリスト
		TreeSet<Integer> set = new TreeSet<>();
		for(int i = 0; i < m; i++){
			set = lawmakerMap.get(x[i]);
			set.add(y[i]);
			set.add(x[i]);
			lawmakerMap.put(x[i], set);


			set = lawmakerMap.get(y[i]);
			set.add(x[i]);
			set.add(y[i]);
			lawmakerMap.put(y[i], set);
		}



		int max = 2;
		int count = 0;

		int lawSize = 0;
		int k = 0;
		int ans = 0;
		ArrayList<Integer> list1 = new ArrayList<>();
		ArrayList<Integer> list2 = new ArrayList<>();
		for(int i = 1; i <= n; i++) {
			count = 0;
			ans = 0;
			list1 = new ArrayList<>(lawmakerMap.get(i));
			lawSize = list1.size();
			for(int j = 1; j <= n; j++) {

				list2 = new ArrayList<>(lawmakerMap.get(j));
				if(lawSize == list2.size()) {
					for(k = 0; k < lawSize; k++) {


						if(!list1.get(k).equals(list2.get(k))) {

							k = -1;
							break;
						}
					}
					if(k > 0) {
						count++;
					}

					if(count == lawSize) {
						ans = count;
					}


				}

			}
			max = Math.max(max, ans);
		}

		if(m == 0) max = 1;
		System.out.println(max);

	}

}

Submission Info

Judge Result