Submission #1510721


Source Code Expand

import java.util.*;
 
/**
 * http://abc002.contest.atcoder.jp/tasks/abc002_4
 */
public class Main {
 
	public static void main(String[] args) {
	
		Scanner sc = new Scanner(System.in);
		int N = sc.nextInt();
		int M = sc.nextInt();
		boolean graph[][] = new boolean[N][N];
		for(int i=0; i<M; i++){
			int n1 = sc.nextInt();
			int n2 = sc.nextInt();
			graph[n1-1][n2-1] = true;
			graph[n2-1][n1-1] = true;
		}
		sc.close();
	
		System.out.println(maxClusterDfs(graph));	
	}

	public static int maxCluster(boolean[][] graph){
		int nodeSize = graph.length;
		
		int result = 0;
		for(int bmask=1; bmask < (1<<nodeSize); ++bmask){
			List<Integer> candidate = new ArrayList<>();
			int tmp = bmask;
			int shift=0;
			while(tmp != 0){
				if((tmp&1)!=0)candidate.add(shift);
				tmp>>=1;
				++shift;
			}
			if(isFullyConnected(graph, candidate))result=Math.max(result,candidate.size());
		}
		return result;
	}

	public static boolean isFullyConnected(boolean[][] graph, List<Integer>  nodeList){
		for(int i=0; i < nodeList.size(); ++i){
			for(int j=i+1; j < nodeList.size(); ++j){
				if(!graph[nodeList.get(i)][nodeList.get(j)])return false;
			}
		}
		return true;
	}
	
	public static int maxClusterDfs(boolean[][] graph){
		int nodeSize = graph.length;
		Set<Integer> visited = new HashSet<>();
		int result = 0;
		
		Map<Integer, Integer> memoization = new HashMap<Integer,Integer>();
		for(int start = 0; start < nodeSize; ++start){
			visited.add(start);
			result = Math.max(1 + dfs(graph, start, visited, memoization), result);
			visited.remove(start);
		}
		return result;
	}
	
	public static boolean isFullyConnected(boolean[][] graph, Set<Integer> visited, int newNode){
		for(int i : visited){
			if(!graph[i][newNode]) return false;
		}
		return true;
	}
	
	public static int dfs(boolean[][] graph, int currentNode, Set<Integer> visited, Map<Integer,Integer> memoization){
		int memoizationKey = (1 << currentNode) << graph.length;
		for(Integer v : visited) memoizationKey |= (1 << v);
		if(memoization.containsKey(memoizationKey)) return memoization.get(memoizationKey);
		int result = 0;
		for(int nextNode = 0; nextNode < graph.length; ++nextNode){
			if(!graph[currentNode][nextNode])continue;
			if(visited.contains(nextNode))continue;
			if(isFullyConnected(graph, visited, nextNode)){
				visited.add(nextNode);
				result = Math.max(result, 1 + dfs(graph, nextNode, visited, memoization));
				visited.remove(nextNode);
			}
		}
		memoization.put(memoizationKey, result);
		return result;
	}
}


Submission Info

Submission Time
Task D - 派閥
User hi_viv
Language Java8 (OpenJDK 1.8.0)
Score 0
Code Size 2619 Byte
Status MLE
Exec Time 380 ms
Memory 61376 KB

Judge Result

Set Name all
Score / Max Score 0 / 100
Status
AC × 68
MLE × 6
Set Name Test Cases
all 00_sample_01.txt, 00_sample_02.txt, 00_sample_03.txt, 00_sample_04.txt, test_01.txt, test_02.txt, test_03.txt, test_04.txt, test_05.txt, test_06.txt, test_07.txt, test_08.txt, test_09.txt, test_10.txt, test_11.txt, test_12.txt, test_13.txt, test_14.txt, test_15.txt, test_16.txt, test_17.txt, test_18.txt, test_19.txt, test_20.txt, test_21.txt, test_22.txt, test_23.txt, test_24.txt, test_25.txt, test_26.txt, test_27.txt, test_28.txt, test_29.txt, test_30.txt, test_31.txt, test_32.txt, test_33.txt, test_34.txt, test_35.txt, test_36.txt, test_37.txt, test_38.txt, test_39.txt, test_40.txt, test_41.txt, test_42.txt, test_43.txt, test_44.txt, test_45.txt, test_46.txt, test_47.txt, test_48.txt, test_49.txt, test_50.txt, test_51.txt, test_52.txt, test_53.txt, test_54.txt, test_55.txt, test_56.txt, test_57.txt, test_58.txt, test_59.txt, test_60.txt, test_61.txt, test_62.txt, test_63.txt, test_64.txt, test_65.txt, test_66.txt, test_67.txt, test_68.txt, test_69.txt, test_70.txt
Case Name Status Exec Time Memory
00_sample_01.txt AC 95 ms 21716 KB
00_sample_02.txt AC 93 ms 21076 KB
00_sample_03.txt AC 97 ms 21716 KB
00_sample_04.txt AC 92 ms 18900 KB
test_01.txt AC 90 ms 21844 KB
test_02.txt AC 92 ms 19792 KB
test_03.txt AC 91 ms 19924 KB
test_04.txt AC 103 ms 18640 KB
test_05.txt AC 92 ms 19540 KB
test_06.txt AC 93 ms 21588 KB
test_07.txt AC 91 ms 21844 KB
test_08.txt AC 115 ms 20180 KB
test_09.txt AC 126 ms 24276 KB
test_10.txt AC 108 ms 21972 KB
test_11.txt AC 93 ms 18636 KB
test_12.txt AC 129 ms 22484 KB
test_13.txt AC 98 ms 18900 KB
test_14.txt AC 93 ms 23636 KB
test_15.txt AC 96 ms 21588 KB
test_16.txt AC 128 ms 22356 KB
test_17.txt AC 150 ms 27092 KB
test_18.txt AC 102 ms 21332 KB
test_19.txt AC 138 ms 24788 KB
test_20.txt AC 303 ms 49868 KB
test_21.txt AC 122 ms 24660 KB
test_22.txt AC 199 ms 37056 KB
test_23.txt AC 199 ms 36672 KB
test_24.txt MLE 317 ms 54736 KB
test_25.txt AC 91 ms 19028 KB
test_26.txt AC 123 ms 21716 KB
test_27.txt AC 106 ms 21588 KB
test_28.txt AC 94 ms 23636 KB
test_29.txt AC 107 ms 21328 KB
test_30.txt AC 127 ms 20436 KB
test_31.txt AC 126 ms 21204 KB
test_32.txt AC 138 ms 24532 KB
test_33.txt AC 203 ms 32424 KB
test_34.txt AC 154 ms 31444 KB
test_35.txt AC 210 ms 38716 KB
test_36.txt MLE 320 ms 57152 KB
test_37.txt AC 93 ms 18772 KB
test_38.txt AC 292 ms 46544 KB
test_39.txt AC 137 ms 27348 KB
test_40.txt AC 93 ms 22996 KB
test_41.txt AC 313 ms 51488 KB
test_42.txt MLE 324 ms 56764 KB
test_43.txt AC 115 ms 19028 KB
test_44.txt AC 136 ms 24404 KB
test_45.txt AC 134 ms 24532 KB
test_46.txt AC 195 ms 33188 KB
test_47.txt AC 212 ms 39208 KB
test_48.txt MLE 366 ms 57488 KB
test_49.txt AC 107 ms 19156 KB
test_50.txt AC 112 ms 21972 KB
test_51.txt AC 119 ms 19796 KB
test_52.txt AC 110 ms 22484 KB
test_53.txt AC 126 ms 21972 KB
test_54.txt AC 112 ms 22612 KB
test_55.txt AC 131 ms 22996 KB
test_56.txt AC 141 ms 25172 KB
test_57.txt AC 163 ms 30548 KB
test_58.txt AC 168 ms 30292 KB
test_59.txt AC 222 ms 37308 KB
test_60.txt MLE 380 ms 61376 KB
test_61.txt MLE 325 ms 54848 KB
test_62.txt AC 91 ms 18640 KB
test_63.txt AC 122 ms 19284 KB
test_64.txt AC 111 ms 22480 KB
test_65.txt AC 112 ms 21332 KB
test_66.txt AC 119 ms 24404 KB
test_67.txt AC 122 ms 19156 KB
test_68.txt AC 105 ms 20052 KB
test_69.txt AC 106 ms 19540 KB
test_70.txt AC 127 ms 19404 KB