oj.uz

Submission #1011114

# Submission time Handle Problem Language Result Execution time Memory
1011114 2024-06-29T20:12:48 Z Oz121 Burza (COCI16_burza) Java 11
112 / 160
 500 ms 26584 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("DA");
        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++;
            }
        }

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

        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";
        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
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 96 ms 25304 KB Output is correct
2 Correct 484 ms 22640 KB Output is correct
3 Correct 52 ms 22112 KB Output is correct
4 Correct 54 ms 22608 KB Output is correct
5 Correct 70 ms 23512 KB Output is correct
6 Correct 45 ms 22144 KB Output is correct

Subtask #2
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 500 ms 22608 KB Output is correct
2 Correct 450 ms 24772 KB Output is correct
3 Correct 51 ms 22676 KB Output is correct
4 Correct 48 ms 22844 KB Output is correct
5 Correct 471 ms 22660 KB Output is correct
6 Correct 66 ms 22808 KB Output is correct

Subtask #3
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 446 ms 22856 KB Output is correct
2 Correct 475 ms 24700 KB Output is correct
3 Correct 55 ms 24668 KB Output is correct
4 Correct 64 ms 24224 KB Output is correct
5 Correct 60 ms 22576 KB Output is correct
6 Correct 49 ms 22640 KB Output is correct

Subtask #4
0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 154 ms 22388 KB Output is correct
2 Incorrect 471 ms 22976 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #5
0 / 16.0

# Verdict Execution time Memory Grader output
1 Incorrect 424 ms 22340 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #6
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 475 ms 22864 KB Output is correct
2 Correct 440 ms 23004 KB Output is correct
3 Correct 57 ms 22436 KB Output is correct
4 Correct 50 ms 22480 KB Output is correct
5 Correct 57 ms 25260 KB Output is correct
6 Correct 56 ms 24824 KB Output is correct

Subtask #7
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 439 ms 22276 KB Output is correct
2 Correct 446 ms 24400 KB Output is correct
3 Correct 47 ms 24432 KB Output is correct
4 Correct 50 ms 22436 KB Output is correct
5 Correct 423 ms 22800 KB Output is correct
6 Correct 57 ms 22304 KB Output is correct

Subtask #8
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 146 ms 24808 KB Output is correct
2 Correct 471 ms 26584 KB Output is correct
3 Correct 50 ms 22456 KB Output is correct
4 Correct 57 ms 22060 KB Output is correct
5 Correct 54 ms 22440 KB Output is correct
6 Correct 73 ms 25960 KB Output is correct

Subtask #9
0 / 16.0

# Verdict Execution time Memory Grader output
1 Incorrect 86 ms 22632 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #10
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 231 ms 22796 KB Output is correct
2 Correct 478 ms 22936 KB Output is correct
3 Correct 52 ms 22368 KB Output is correct
4 Correct 53 ms 22484 KB Output is correct
5 Correct 227 ms 22868 KB Output is correct
6 Correct 48 ms 26388 KB Output is correct