Submission #745695

#	Time	Username	Problem	Language	Result	Execution time	Memory
745695		rahulverma	Network (BOI15_net)	Java	0 / 100	184 ms	12028 KiB

net

import java.io.*;
import java.util.*;
 
class net {
 
	public static void main(String[] args) {
		Scanner s = new Scanner(System.in);
		int n = s.nextInt();
		ArrayList<ArrayList<Integer>> graph = new ArrayList<>();
		for(int i = 0; i < n; i++) graph.add(new ArrayList<Integer>());
		for(int i = 1; i < n; i++) {
			int v1 = s.nextInt() - 1;
			int v2 = s.nextInt() - 1;
			graph.get(v1).add(v2);
			graph.get(v2).add(v1);
		}
		int root = 0;
		for(int i = 0; i < n; i++) {
			if(graph.get(i).size() != 1) {
				root = i;
			}
		}
		int[] dist = new int[n];
		Queue<Integer> q = new LinkedList<Integer>();
		Arrays.fill(dist, -1);
		q.add(root);
		dist[root] = 0;
		ArrayList<Integer> ans = new ArrayList<Integer>();
		ans.add(root);
		while(!q.isEmpty()) {
			int node = q.poll();
			for(int node2: graph.get(node)) {
				if(dist[node2] == -1) {
					dist[node2] = dist[node] + 1;
					q.add(node2);
					if(graph.get(node2).size() == 1) {
						ans.add(node2 + 1);
					}
				}
			}
		}
		/*for(int i = 0; i < n; i++) {
			System.out.println(dist[i]);
		}*/
 
		System.out.println(ans.size() / 2);
		for(int i = 0; i < ans.size(); i += 2) {
			System.out.println(ans.get(i) + " " + ans.get(i + 1));
		}
	}
 
}

• Subtask 1: 0 / 18
• Subtask 2: 0 / 45
• Subtask 3: 0 / 37