oj.uz

Submission #1117388

# Submission time Handle Problem Language Result Execution time Memory
1117388 2024-11-23T13:29:42 Z kfhjad Burza (COCI16_burza) C++17
80 / 160
 12 ms 2640 KB 
#include <bits/stdc++.h>

using namespace std;
using ll = long long;

int N, K;
int best[401][21]; // cant mark node till xth turn
int dp[1 << 20];
vector<int> adj[401];
int depth[401];

void dfs(int node, int p, int d)
{
    vector<int> paths;
    
    for (int i : adj[node])
    {
        if (i == p)
            continue;
        
        dfs(i, node, d + 1);
        
        depth[node] = max(depth[node], depth[i]);
        
        if (depth[i] >= K)
            paths.push_back(i);
    }
    
    int n = paths.size();
    
    for (int move = 1; move <= K; ++move) // start marking till move'th move
    {
        if (move <= d)
            best[node][move] = 1;
        else if (n > K - move + 1)
            best[node][move] = 1e9;
        else
        {
            for (int mask = 1; mask < (1 << n); ++mask)
            {
                dp[mask] = 1e9;
                
                for (int i = 0; i < n; ++i)
                    if (mask & (1 << i))
                    {
                        int cur_move = move + dp[mask ^ (1 << i)];
                        
                        if (cur_move > K) // not possible
                            continue;
                            
                        dp[mask] = min(dp[mask], dp[mask ^ (1 << i)] + best[paths[i]][cur_move]);
                    }
            }
            
            best[node][move] = dp[(1 << n) - 1];
        }
    }
    
    depth[node] = max(depth[node], d);
}

int main()
{
    cin.tie(NULL) -> sync_with_stdio(false);
    cin >> N >> K;
    
    for (int i = 1; i < N; ++i)
    {
        int a, b;
        cin >> a >> b;
        
        adj[a].push_back(b);
        adj[b].push_back(a);
    }
    
    if (K > 20)
        cout << "DA" << endl;
    else
    {
        dfs(1, 0, 0);
        cout << (best[1][1] <= K ? "DA" : "NE") << endl;
    }
    
    return 0;
}

Subtask #1
0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 336 KB Output is correct
2 Correct 9 ms 848 KB Output is correct
3 Correct 1 ms 336 KB Output is correct
4 Correct 1 ms 336 KB Output is correct
5 Incorrect 1 ms 336 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #2
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 848 KB Output is correct
2 Correct 9 ms 924 KB Output is correct
3 Correct 1 ms 336 KB Output is correct
4 Correct 1 ms 336 KB Output is correct
5 Correct 9 ms 2640 KB Output is correct
6 Correct 1 ms 488 KB Output is correct

Subtask #3
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 848 KB Output is correct
2 Correct 9 ms 848 KB Output is correct
3 Correct 1 ms 336 KB Output is correct
4 Correct 1 ms 336 KB Output is correct
5 Correct 1 ms 336 KB Output is correct
6 Correct 1 ms 336 KB Output is correct

Subtask #4
0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 592 KB Output is correct
2 Correct 9 ms 2640 KB Output is correct
3 Correct 1 ms 336 KB Output is correct
4 Correct 1 ms 336 KB Output is correct
5 Incorrect 1 ms 336 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #5
0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 848 KB Output is correct
2 Correct 9 ms 1016 KB Output is correct
3 Correct 1 ms 336 KB Output is correct
4 Correct 1 ms 336 KB Output is correct
5 Incorrect 1 ms 336 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #6
0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 848 KB Output is correct
2 Correct 9 ms 1016 KB Output is correct
3 Correct 1 ms 336 KB Output is correct
4 Correct 1 ms 480 KB Output is correct
5 Correct 1 ms 336 KB Output is correct
6 Incorrect 1 ms 480 KB Output isn't correct
7 Halted 0 ms 0 KB -

Subtask #7
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 848 KB Output is correct
2 Correct 12 ms 1016 KB Output is correct
3 Correct 1 ms 336 KB Output is correct
4 Correct 1 ms 336 KB Output is correct
5 Correct 10 ms 848 KB Output is correct
6 Correct 1 ms 336 KB Output is correct

Subtask #8
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 592 KB Output is correct
2 Correct 9 ms 2640 KB Output is correct
3 Correct 1 ms 336 KB Output is correct
4 Correct 1 ms 336 KB Output is correct
5 Correct 1 ms 336 KB Output is correct
6 Correct 1 ms 336 KB Output is correct

Subtask #9
0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 336 KB Output is correct
2 Correct 10 ms 2640 KB Output is correct
3 Correct 1 ms 336 KB Output is correct
4 Correct 1 ms 336 KB Output is correct
5 Incorrect 1 ms 336 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #10
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 592 KB Output is correct
2 Correct 9 ms 848 KB Output is correct
3 Correct 1 ms 336 KB Output is correct
4 Correct 1 ms 480 KB Output is correct
5 Correct 5 ms 736 KB Output is correct
6 Correct 1 ms 336 KB Output is correct