Submission #1510728
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 Map<Integer, Integer> memoization = new HashMap<Integer,Integer>(); public static int maxClusterDfs(boolean[][] graph){ int nodeSize = graph.length; boolean[] visited = new boolean[nodeSize]; int result = 0; for(int start = 0; start < nodeSize; ++start){ visited[start] = 1; result = Math.max(1 + dfs(graph, start, visited), result); visited[start] = 0; } 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, boolean[] visited){ int memoizationKey = (1 << currentNode) << graph.length; for(int i = 0; i < graph.lengh; ++i) if(visited[i]) memoizationKey |= (1 << i); 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[nextNode])continue; if(isFullyConnected(graph, visited, nextNode)){ visited[nextNode] = true; result = Math.max(result, 1 + dfs(graph, nextNode, visited)); visited[nextNode] = false; } } 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 | 2595 Byte |
Status | CE |
Compile Error
./Main.java:60: error: incompatible types: int cannot be converted to boolean visited[start] = 1; ^ ./Main.java:62: error: incompatible types: int cannot be converted to boolean visited[start] = 0; ^ ./Main.java:76: error: cannot find symbol for(int i = 0; i < graph.lengh; ++i) if(visited[i]) memoizationKey |= (1 << i); ^ symbol: variable lengh location: variable graph of type boolean[][] ./Main.java:83: error: incompatible types: boolean[] cannot be converted to Set<Integer> if(isFullyConnected(graph, visited, nextNode)){ ^ Note: Some messages have been simplified; recompile with -Xdiags:verbose to get full output 4 errors