# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
736657 |
2023-05-06T04:49:27 Z |
rahulverma |
Network (BOI15_net) |
Java 11 |
|
143 ms |
11524 KB |
import java.io.*;
import java.util.*;
public 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[] dist = new int[n];
Queue<Integer> q = new LinkedList<Integer>();
Arrays.fill(dist, -1);
q.add(0);
dist[0] = 0;
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);
}
}
}
/*for(int i = 0; i < n; i++) {
System.out.println(dist[i]);
}*/
boolean found = true;
ArrayList<Integer> ans = new ArrayList<Integer>();
ans.add(1);
for(int i = 1; i < n; i++) {
if(graph.get(i).size() == 1) {
ans.add(i+1);
}
}
// Collections.sort(ans, (a, b) -> (int) (System.currentTimeMillis()%2)*-1 + 1);
System.out.println((int) ans.size()/2);
System.out.println(ans);
for(int i = 0; i < ans.size()/2; i += 1) {
System.out.println(ans.get(2*i) + " " + ans.get(2*i + 1));
}
}
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
143 ms |
11524 KB |
Expected integer, but "[1," found |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
143 ms |
11524 KB |
Expected integer, but "[1," found |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
143 ms |
11524 KB |
Expected integer, but "[1," found |
2 |
Halted |
0 ms |
0 KB |
- |