Created
May 3, 2015 20:05
-
-
Save Onaiplee/ed9841421070bd65054f to your computer and use it in GitHub Desktop.
Rust & Murderer - Java - Hash
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| import java.io.*; | |
| import java.util.*; | |
| import java.text.*; | |
| import java.math.*; | |
| import java.util.regex.*; | |
| public class Solution { | |
| public static int INF = Integer.MAX_VALUE >> 2; | |
| public static void main(String[] args) { | |
| Scanner in = new Scanner(System.in); | |
| int t = in.nextInt(); | |
| for (int i = 0; i < t; ++i) { | |
| int N = in.nextInt(); | |
| int M = in.nextInt(); | |
| HashMap<Integer, HashSet<Integer>> V = new HashMap<Integer, HashSet<Integer>>(); | |
| for (int j = 0; j < M; ++j) { | |
| int from = in.nextInt(); | |
| int to = in.nextInt(); | |
| if (!V.containsKey(from)) { | |
| V.put(from, new HashSet<Integer>()); | |
| } | |
| if (!V.containsKey(to)) { | |
| V.put(to, new HashSet<Integer>()); | |
| } | |
| V.get(from).add(to); | |
| V.get(to).add(from); | |
| } | |
| int S = in.nextInt(); | |
| String ret = solve(N, M, S, V); | |
| System.out.println(ret); | |
| } | |
| /* Enter your code here. Read input from STDIN. Print output to STDOUT. Your class should be named Solution. */ | |
| } | |
| private static String solve(int N, int M, int S, HashMap<Integer, HashSet<Integer>> V) { | |
| int[] dist = new int[N+1]; | |
| List<Integer> notVisited = new LinkedList<Integer>(); | |
| for (int i = 1; i <= N; ++i) { | |
| if (i != S) { | |
| notVisited.add(i); | |
| } | |
| } | |
| Queue<Integer> queue = new LinkedList<Integer>(); | |
| queue.add(S); | |
| dist[S] = 0; | |
| while (queue.peek() != null && notVisited.size() != 0) { | |
| int v1 = queue.poll(); | |
| for (Iterator<Integer> iterator = notVisited.iterator(); iterator.hasNext();) { | |
| int v2 = iterator.next(); | |
| if (!V.containsKey(v1) || !V.get(v1).contains(v2)) { | |
| dist[v2] = dist[v1] + 1; | |
| iterator.remove(); | |
| queue.add(v2); | |
| } | |
| } | |
| } | |
| StringBuilder sb = new StringBuilder(); | |
| for (int d = 1; d < dist.length; ++d) { | |
| if (d != S) { | |
| sb.append(Integer.toString(dist[d]) + " "); | |
| } | |
| } | |
| return sb.toString(); | |
| } | |
| } |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment