[백준] - 14675. 단절점과 단절선 성공

얄루몬 2023. 9. 5. 00:13

package org.example;

import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.ArrayList;
import java.util.List;
import java.util.StringTokenizer;

public class Main {
    static StringTokenizer st;
    static List<Integer>[] nodes;

    public static void main(String[] args) throws IOException {
        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
        int n = Integer.parseInt(br.readLine());
        nodes = new ArrayList[n+1];
        for (int i = 0; i < n+1; i++) {
            nodes[i] = new ArrayList<>();
        }

        // 트리 구성
        for (int i = 1; i < n; i++) {
            st = new StringTokenizer(br.readLine());
            int a = Integer.parseInt(st.nextToken());
            int b = Integer.parseInt(st.nextToken());
            nodes[a].add(b);
            nodes[b].add(a);
        }

        int q = Integer.parseInt(br.readLine());

        for (int i = 0; i < q; i++) {
            st = new StringTokenizer(br.readLine());

            int t = Integer.parseInt(st.nextToken());
            int k = Integer.parseInt(st.nextToken());

            if (t == 2) {
                System.out.println("yes");
            }else{
                if (nodes[k].size() >= 2){
                    System.out.println("yes");
                }else{
                    System.out.println("no");
                }
            }
        }
    }
}