Problem: 2063C - Remove Exactly Two
Language: java

Solution 1 (runtime: 796 ms):

import java.io.*;
import java.util.*;

public class CodeForces {
    public static final int MOD = 1_000_000_007;
    public static final int BUFFERSIZE = 512000;
    //    private static Scanner sc = new Scanner(new BufferedReader(new InputStreamReader(System.in), BUFFERSIZE));
    private static PrintWriter out = new PrintWriter(new BufferedOutputStream(System.out, BUFFERSIZE));


    static class Pair<T, E> {
        private T first;
        private E second;

        public Pair(T key, E value) {
            this.first = key;
            this.second = value;
        }

    }

    public static int solve(int n, ArrayList<Integer> connections[]) throws Exception {
        for (int k = 0; k < 2; k++) {
            int maxConnections = Integer.MIN_VALUE;
            int maxVertex = -1;
            for (int i = 1; i <= n; i++) {
                if (connections[i] != null && connections[i].size() > maxConnections) {
                    maxVertex = i;
                    maxConnections = connections[i].size();
                }else{
                    if (connections[i] != null && connections[i].size() == maxConnections) {
                        boolean take = false;
                        for (int j = 0; j < connections[i].size(); j++) {
                            int connectedTo = connections[i].get(j);  // 1 5
                            for (int l = 0; l < connections[connectedTo].size(); l++) {
                                if(connections[connectedTo].get(l) == i) continue;
                                if(connections[connections[connectedTo].get(l)].size() >= maxConnections){
                                    take = true;
                                    maxVertex = i;
                                    break;
                                }
                            }
                            if(take){
                                break;
                            }
                        }
                    }
                }
            }
            for (int i = 0; i < connections[maxVertex].size(); i++) {
                int toRemove = connections[maxVertex].get(i);
                connections[toRemove].remove((Object) maxVertex);
            }
            connections[maxVertex]  = null;
        }
        int ans = 0;
        boolean marked[] = new boolean[n + 1];
        for (int i = 1; i <= n ; i++) {
            if(!marked[i] && connections[i] != null){
                dfs(connections, i, marked);
                ans++;
            }
        }
        return ans;
    }

    private static void dfs(ArrayList<Integer>[] connections, int vertex, boolean[] marked) {
        if(marked[vertex])
            return;
        marked[vertex] = true;
        for (int connectedVertex :connections[vertex]) {
            dfs(connections, connectedVertex, marked);
        }
    }


    public static void main(String args[]) throws Exception {
        in.init(System.in);
        Random random = new Random();
//        int totalTestCases = 10000;
        int totalTestCases = in.nextInt();
        for (int testCase = 0; testCase < totalTestCases; testCase++) {
            int n = in.nextInt();
            ArrayList<Integer> connections[] = new ArrayList[n + 1];
            for (int i = 1; i <= n; i++) {
                connections[i] = new ArrayList<>();
            }
            for (int i = 0; i < n - 1; i++) {
                int a = in.nextInt();
                int b = in.nextInt();
                connections[a].add(b);
                connections[b].add(a);
            }
            out.println(solve(n, connections));
//            long s2 = solve2(n, k, a, b);
//            if(s1 != s2){
//                System.out.println(n + " " + k);
//                System.out.println(Arrays.toString(a));
//                System.out.println(Arrays.toString(b));
//            }
//            long t2 = System.currentTimeMillis();
//            String solve2 = solve2(a);
//            long t3 = System.currentTimeMillis();
//            System.out.println(t3-t2);
//            System.out.println(t2-t1);
//            if(!solve1.equals(solve2)){
//                System.out.println(Arrays.toString(a));
//                System.out.println(solve1);
//                System.out.println(solve2);
//            }
        }
        out.close();
    }


    private static int lowerBound(int[] ar, int i) {
        int start = 0;
        int end = ar.length - 1;
        // 5, 7, 9
        int candidate = ar.length;
        while (start <= end) {
            int mid = (start + end) / 2;
            if (ar[mid] >= i) {
                candidate = mid;
                end = mid - 1;
            } else {
                start = mid + 1;
            }
        }
        return candidate;
    }

//    public static void numberPrimeNumber() {
//        int nn = 12;
//        int arr[] = new int[nn + 1];
//        for (int i = 1; i <= nn; ++i) {
//            for (int j = 2 * i; j <= nn; j += i) {
//                if (arr[j] == arr[i]) {
//                    ++arr[j];
//                }
//            }
//        }
//    }


    public static List<Integer> calculatePrimes(int n) {
        List<Integer> primes = new ArrayList<>();

        boolean[] isPrime = new boolean[n + 1];

        for (int i = 2; i <= n; i++) {
            isPrime[i] = true;
        }

        for (int i = 2; i * i <= n; i++) {
            if (isPrime[i]) {
                for (int j = i * i; j <= n; j += i) {
                    isPrime[j] = false;
                }
            }
        }

        for (int i = 2; i <= n; i++) {
            if (isPrime[i]) {
                primes.add(i);
            }
        }

        return primes;
    }

    public static class in {
        static BufferedReader reader;
        static StringTokenizer tokenizer;

        static void init(InputStream input) {
            reader = new BufferedReader(new InputStreamReader(input), BUFFERSIZE);
            tokenizer = new StringTokenizer("");
        }

        static String next() throws IOException {
            while (!tokenizer.hasMoreTokens()) tokenizer = new StringTokenizer(reader.readLine());
            return tokenizer.nextToken();
        }

        static int nextInt() throws IOException {
            return Integer.parseInt(next());
        }

        static double nextDouble() throws IOException {
            return Double.parseDouble(next());
        }

        static long nextLong() throws IOException {
            return Long.parseLong(next());
        }
    }

    static {
        Bigmod.reset(false, 300300);
    }

    static class Bigmod {
        static long M9 = 998244353L, M1 = 1000_000_007L;
        static long M = 0;
        static int MAXN = -1;
        static long[] cacheStepmul;
        static long[] cacheStepmulInv;
        static long[] exp2;
        long num = 0;

        // TODO: reset this before anything.
        static void reset(boolean use998, int maxN) {
            // 300300
            M = use998 ? M9 : M1;
            MAXN = maxN;
            cacheStepmul = new long[MAXN];
            cacheStepmulInv = new long[MAXN];
            exp2 = new long[MAXN];
        }

        Bigmod(long num) {
            if (num >= 0) {
                this.num = num % M;
            } else {
                this.num = M - (-num) % M;
            }
        }

        static Bigmod valueOf(long num) {
            return new Bigmod(num);
        }

        @Override
        public String toString() {
            return Long.toString(num);
        }

        Bigmod add(long x) {
            if (x > 0) {
                num = (num + x % M) % M;
            } else if (x < 0) {
                num = (num - (-x) % M + M) % M;
            }
            return this;
        }

        Bigmod add(Bigmod bm) {
            return add(bm.num);
        }

        Bigmod sub(long x) {
            return add(-x);
        }

        Bigmod sub(Bigmod bm) {
            return add(-bm.num);
        }

        Bigmod mul(long x) {
            num = num * (x % M) % M;
            return this;
        }

        Bigmod mul(Bigmod bm) {
            return mul(bm.num);
        }

        Bigmod div(long x) {
            if (x == 0) throw new RuntimeException("cannot div 0.");
            return mul(exp(x, M - 2));
        }

        Bigmod div(Bigmod bm) {
            return div(bm.num);
        }

        Bigmod exp(long p) {
            long ret = 1L, baseLong = num % M;
            for (int i = 0; i <= 60 && p > 0; ++i) { //1<<30=1073741824
                if ((p & (1L << i)) > 0) {
                    ret = ret * baseLong % M;
                    p ^= (1L << i);
                }
                baseLong = baseLong * baseLong % M;
            }
            if (p != 0) throw new RuntimeException("p should reduced to 0 in exp.");
            num = ret;
            return this;
        }

        Bigmod exp(Bigmod bm) {
            return exp(bm.num);
        }

        static long exp(long x, long p) {
            return new Bigmod(x).exp(p).num;
        }

        static long exp2(long n) { // 2^n
            if (n >= exp2.length) throw new RuntimeException("overflow exp2 size. " + n + " >= " + exp2.length);
            if (exp2[0] == 0) {
                exp2[0] = 1;
                for (int i = 1; i < exp2.length; ++i)
                    exp2[i] = exp2[i - 1] * 2 % M;
            }
            return exp2[(int) n];
        }

        static long C(long n, long m) {
            if (n < 0 || m < 0) throw new RuntimeException("n/m cannot be negative in C(n,m).");
            if (n < m) throw new RuntimeException("n is less than m in C(n,m).");
            if (n == 0) return 1;
            if (m == 0 || m == n) return 1;
            return new Bigmod(P(n, m)).mul(stepmulInv(m)).num;
        }

        static long P(long n, long m) {
            if (n < 0 || m < 0) throw new RuntimeException("n/m cannot be negative in P(n,m).");
            if (n < m) throw new RuntimeException("n is less than m in P(n,m).");
            if (n == 0) return 1;
            if (n < cacheStepmul.length) {
                // P(n,m)=n!/(n-m)!
                return new Bigmod(stepmul(n)).mul(stepmulInv(n - m)).num;
            }
            // NOTE: O(m) complexity when n is large.
            Bigmod r = new Bigmod(1);
            long val = n;
            for (long i = 0; i < m; ++i) r.mul(val--);
            return r.num;
        }

        static long stepmul(long n) { // n!
            if (n >= cacheStepmul.length) throw new RuntimeException("overflow cacheSm size.");
            if (cacheStepmul[0] == 0) {
                cacheStepmul[0] = 1;
                cacheStepmulInv[0] = exp(cacheStepmul[0], M - 2);
                for (int i = 1; i < cacheStepmul.length; ++i) {
                    cacheStepmul[i] = cacheStepmul[i - 1] * i % M;
                    cacheStepmulInv[i] = exp(cacheStepmul[i], M - 2);
                }
            }
            return cacheStepmul[(int) n];
        }

        static long stepmulInv(long n) {
            if (cacheStepmulInv[1] == 0) stepmul(2);
            return cacheStepmulInv[(int) n];
        }


    }
}

Solution 2 (runtime: 905 ms):

import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.*;

public class Main {
    static int m = 1000000007, M = 998244353;
    static long inf = (long) 1e18;

    static long timer = 0, max = -1;

    public static void main(String[] args) {
        FastReader next = new FastReader();
        int t = next.nextInt();
        l1:
        while (t-- > 0) {
            int n = next.nextInt();

            ArrayList<ArrayList<Integer>> lists = new ArrayList<>();
            int[] subTreeSize = new int[n + 1];
            int[] inTime = new int[n + 1], outTime = new int[n + 1];

            for (int i = 0; i <= n; i++) {
                lists.add(new ArrayList<>());
            }

            int[] neighbours = new int[n + 1];

            int p = 1;
            for (int i = 1; i < n; i++) {
                int v = next.nextInt();
                int u = next.nextInt();
                lists.get(v).add(u);
                lists.get(u).add(v);
            }
            int res = 0;
            int first = 0, second = 0;
            for (int i = 1; i <= n; i++) {
                if (lists.get(i).size() >= lists.get(first).size()) {
                    second = first;
                    first = i;
                } else {
                    if (lists.get(i).size() >= lists.get(second).size()) {
                        second = i;
                    }
                }
            }
//            System.out.println(lists);
            int max1= lists.get(first).size();
            int max2 = lists.get(second).size();
//            System.out.println(first  +" "+ second);
            ArrayList<ArrayList<Integer>> tem = deepCopy(lists);
            removeNodeEdges(tem, first);
//            System.out.println(tem);
            int f1 = findMaxDegree(tem);
            tem = deepCopy(lists);
            removeNodeEdges(tem, second);
//            System.out.println(tem);
            int f2 = findMaxDegree(tem);
//            ArrayList<Integer> first = lists.get(0), sec = lists.get(1);

            System.out.println(Math.max(max1 + f1 - 1, max2 + f2 - 1));
        }
    }

    private static ArrayList<ArrayList<Integer>> deepCopy(ArrayList<ArrayList<Integer>> original) {
        ArrayList<ArrayList<Integer>> copy = new ArrayList<>();
        for (ArrayList<Integer> list : original) {
            copy.add(new ArrayList<>(list));
        }
        return copy;
    }

    // Remove all edges connected to the given node
    private static void removeNodeEdges(ArrayList<ArrayList<Integer>> adjList, int node) {
        int ct = 0;
        for (ArrayList<Integer> neighbors : adjList) {
            if (ct == node){
                neighbors.clear();
                ct++;
                continue;
            }
            neighbors.removeIf(e -> e == node);
            ct++;
        }
    }

    // Find the maximum degree of any node in the adjacency list
    private static int findMaxDegree(ArrayList<ArrayList<Integer>> adjList) {
        int maxDegree = 0;
        for (ArrayList<Integer> neighbors : adjList) {
            maxDegree = Math.max(maxDegree, neighbors.size());
        }
        return maxDegree;
    }
    // Depth-First Search to count valid paths
    public static void dfs(int currentNode, int parent, ArrayList<ArrayList<Integer>> adjacencyList, int[] size, int[] in, int[] out) {
        size[currentNode] = 1;
        // Flag to check if current node is a leaf
        boolean isLeaf = true;

        // Traverse all connected nodes
        for (int neighbor : adjacencyList.get(currentNode)) {
            if (neighbor != parent) {
                isLeaf = false; // Not a leaf as it has a child
                dfs(neighbor, currentNode, adjacencyList, size, in, out);
                size[currentNode] += size[neighbor];
            }
        }
    }

    public static int[] shortestDistanceToLeaf(int n, ArrayList<ArrayList<Integer>> adj) {
        int[] dist = new int[n + 1];
        Arrays.fill(dist, -1);  // -1 indicates that the vertex has not been visited.
        Queue<Integer> queue = new LinkedList<>();

        // Special case: if the tree contains only one node, it is itself a leaf.
        if (n == 1) {
            dist[1] = 0;
            return dist;
        }

        // Identify all leaf nodes.
        // A vertex is a leaf if it has 0 or 1 neighbor.
        // (Typically, in a connected tree, leaves will have exactly 1 neighbor.)
        for (int i = 1; i <= n; i++) {
            if (adj.get(i).size() <= 1) {
                dist[i] = 0;
                queue.offer(i);
            }
        }

        // Multi-source BFS: propagate distances from all leaves simultaneously.
        while (!queue.isEmpty()) {
            int current = queue.poll();
            for (int neighbor : adj.get(current)) {
                if (dist[neighbor] == -1) {  // Not visited yet.
                    dist[neighbor] = dist[current] + 1;
                    queue.offer(neighbor);
                }
            }
        }
        return dist;
    }

    static void printTreeLevels(ArrayList<ArrayList<Integer>> graph, int root, int n) {
        Queue<Integer> queue = new LinkedList<>();
        boolean[] visited = new boolean[n];

        queue.add(root);
        visited[root] = true;

        int level = 0;
        while (!queue.isEmpty()) {
            int size = queue.size();
            System.out.print("Level " + level + ": ");

            for (int i = 0; i < size; i++) {
                int node = queue.poll();
                System.out.print(node + " ");

                for (int neighbor : graph.get(node)) {
                    if (!visited[neighbor]) {
                        visited[neighbor] = true;
                        queue.add(neighbor);
                    }
                }
            }
            System.out.println();
            level++;
        }
    }

    private static boolean isAncestor(int x, int y, int[] in, int[] out) {
        return in[x] <= in[y] && out[x] >= out[y];
    }


    public static int lowerBound(ArrayList<Integer> arr, long target, int start, int end) {
        int left = start, right = end;
        while (left <= right) {
            int mid = left + (right - left) / 2;
            if (arr.get(mid) < target) {
                left = mid + 1;
            } else {
                right = mid - 1;
            }
        }
        return left;
    }

    public static class FastReader {
        BufferedReader br;
        StringTokenizer st;

        public FastReader() {
            br = new BufferedReader(
                    new InputStreamReader(System.in));
        }

        String next() {
            while (st == null || !st.hasMoreElements()) {
                try {
                    st = new StringTokenizer(br.readLine());
                } catch (IOException e) {
                    e.printStackTrace();
                }
            }
            return st.nextToken();
        }

        int nextInt() {
            return Integer.parseInt(next());
        }

        long nextLong() {
            return Long.parseLong(next());
        }

        double nextDouble() {
            return Double.parseDouble(next());
        }

        String nextLine() {
            String str = "";
            try {
                if (st.hasMoreTokens()) {
                    str = st.nextToken("\n");
                } else {
                    str = br.readLine();
                }
            } catch (IOException e) {
                e.printStackTrace();
            }
            return str;
        }
    }
}