oj.uz

답안 #1011093

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1011093 2024-06-29T19:47:55 Z Oz121 Burza (COCI16_burza) Java 11
0 / 160
 532 ms 26732 KB 
import java.io.*;
import java.util.*;
public class burza {
    public static int num; public static int k; public static HashMap<Integer, ArrayList<Integer>> tree;
    public static int[] depth; public static int[][] interval; //Interval of leaves covered by a node
    public static int count; public static HashMap<Integer, Integer> idx;
    public static void main(String[] args) throws IOException {
        BufferedReader scan = new BufferedReader(new InputStreamReader(System.in));
        StringTokenizer l1 = new StringTokenizer(scan.readLine());
        num = Integer.parseInt(l1.nextToken()); k = Integer.parseInt(l1.nextToken()); tree = new HashMap<>();

        for (int i = 0;i<num;i++) tree.put(i,new ArrayList<>());
        for (int i = 0;i<num-1;i++) {
            StringTokenizer st = new StringTokenizer(scan.readLine());
            int a = Integer.parseInt(st.nextToken())-1; int b = Integer.parseInt(st.nextToken())-1;
            tree.get(a).add(b); tree.get(b).add(a);
        }

        if (k*k>=num) System.out.println("NE");
        else System.out.println(solve());
    }

    public static String solve () {
        idx = new HashMap<>(); count = 0;
        depth = new int[num];
        Arrays.fill(depth, -1); depth[0] = 0;
        dfs1(0);

        interval = new int[num][2];
        for (int i = 0;i<num;i++) {
            interval[i][0] = Integer.MAX_VALUE; interval[i][1] = Integer.MIN_VALUE;
        }

        count = 0;
        for (int i = 0;i<num;i++) {
            if (depth[i]==k) {
                interval[i][0] = idx.get(i); interval[i][1] = idx.get(i);
                dfs2(i,i); count++;
            }
        }
        //System.out.println(idx);


        /*for (int i = 0;i<num;i++) {
            System.out.println(interval[i][0]+" "+interval[i][1]);
        }*/

        int[] dp = new int[1<<k];
        Arrays.fill(dp, -1);

        for (int i = 1;i<1<<k;i++) {
            for (int j = 0;j<k;j++) {
                if ((i&(1<<j))==0) continue;

                int prev = i-(1<<j);

                for (int l = 0;l<num;l++) {
                    if (depth[l]!=j+1) continue;

                    if (interval[l][0]<=dp[prev]+1) {
                        dp[i] = Math.max(dp[i], interval[l][1]);
                    }
                }
            }
        }

        if (dp[(1<<k)-1]==count-1) return "DA";
        else return "NE";
    }

    public static void dfs1 (int curr) {
        for (int next : tree.get(curr)) {
            if (depth[next]==-1) {
                depth[next] = depth[curr]+1;
                if (depth[next]==k) {
                    idx.put(next, count); count++;
                }
                dfs1(next);
            }
        }
    }

    public static void dfs2 (int curr, int child) {
        for (int next : tree.get(curr)) {
            if (depth[next]<depth[curr]) { //Going up the tree
                if (idx.get(child)<interval[next][0]) interval[next][0] = idx.get(child);
                if (idx.get(child)>interval[next][1]) interval[next][1] = idx.get(child);
                dfs2(next, child);
            }
        }
    }
}

Subtask #1
0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 107 ms 23340 KB Output is correct
2 Correct 531 ms 22844 KB Output is correct
3 Incorrect 55 ms 22552 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #2
0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 498 ms 22624 KB Output is correct
2 Correct 503 ms 22944 KB Output is correct
3 Incorrect 59 ms 24416 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #3
0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 490 ms 22680 KB Output is correct
2 Correct 528 ms 22704 KB Output is correct
3 Incorrect 56 ms 24540 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #4
0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 162 ms 22716 KB Output is correct
2 Correct 461 ms 23172 KB Output is correct
3 Incorrect 49 ms 22676 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #5
0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 518 ms 24844 KB Output is correct
2 Correct 498 ms 22724 KB Output is correct
3 Incorrect 55 ms 26732 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #6
0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 476 ms 22564 KB Output is correct
2 Correct 522 ms 22452 KB Output is correct
3 Incorrect 54 ms 22208 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #7
0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 483 ms 22772 KB Output is correct
2 Correct 482 ms 22464 KB Output is correct
3 Incorrect 56 ms 22020 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #8
0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 156 ms 22484 KB Output is correct
2 Correct 502 ms 22832 KB Output is correct
3 Incorrect 57 ms 24480 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #9
0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 97 ms 22548 KB Output is correct
2 Correct 531 ms 22756 KB Output is correct
3 Incorrect 59 ms 26532 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #10
0 / 16.0

# 결과 실행 시간 메모리 Grader output
1 Correct 267 ms 22944 KB Output is correct
2 Correct 532 ms 22136 KB Output is correct
3 Incorrect 55 ms 22240 KB Output isn't correct
4 Halted 0 ms 0 KB -