Submission #1190464

---

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 = 1;
		int count = 0;


		int maxSize = 0;
		int num = 0;
//		int k = 0;
		int ans = 0;
		ArrayList<Integer> list1 = new ArrayList<>();



		for(int i = 1; i <= n; i++) {
			list1 = new ArrayList<>(lawmakerMap.get(i));
			count = 0;
			for(int j = 0; j < list1.size(); j++) {
				num = 0;
				for(int k = j + 1; k < list1.size(); k++) {
					if(lawmakerMap.get(list1.get(j)).contains(list1.get(k)) || lawmakerMap.get(list1.get(k)).contains(list1.get(j))) {
						count++;
						num++;

					}
				}
				maxSize = Math.max(num, maxSize);
			}

			if(count!= 0 && count == num * (num + 1) /2){
				maxSize = num;
				max = Math.max(count, max);
			}

			if(max < count) {
				max = count;
			}

		}

		ans = maxSize + 1;

		if(ans == 1) ans = 2;
		if(m == 0) ans = 1;

		System.out.println(ans);

	}

}

Submission Info

Judge Result