oj.uz

Submission #914044

# Submission time Handle Problem Language Result Execution time Memory
914044 2024-01-20T22:56:57 Z duckier Burza (COCI16_burza) C++14
160 / 160
 480 ms 1920 KB 
#include <bits/stdc++.h>
#define int long long
using namespace std;

const int MAXN = 405, MAXK = 20, INF = 1e18;
int n, k, cnt, dep[MAXN], mn[MAXN], mx[MAXN], dp[1<<MAXK];
vector<int> adj[MAXN];

void dfs(int x, int p, int d) {
    dep[x] = d;
    if(d==k){
        cnt++;
        mn[x] = mx[x] = cnt;
        return;
    }
    for(int y : adj[x]) {
        if(y==p) continue;
        dfs(y, x, d + 1);
        mn[x] = min(mn[x], mn[y]);
        mx[x] = max(mx[x], mx[y]);
    }
}

signed main() {
    cin.tie(NULL)->sync_with_stdio(0);
    cin>>n>>k;
    if(k>20) {
        cout << "DA\n";
        return 0;
    }
    for(int i = 1; i < n; i++) {
        int x, y;
        cin>>x>>y;
        adj[x].push_back(y);
        adj[y].push_back(x);
    }
    for(int i = 1; i <= n; i++) {
        mn[i] = INF;
    }
    dfs(1, 0, 0);
    for(int i= 1; i < (1<<k);i++) {
        for(int j = 0;j < k; j++) {
            if((i>>j)&1) {
                int pr = dp[i^(1<<j)];
                for(int  l= 1; l <= n; l++) {
                    if(dep[l]!=j+1)continue;
                    int cmn = mn[l], cmx = mx[l];
                    if(cmn <= pr + 1) {
                        dp[i] = max(dp[i], cmx);
                    }
                }
            }
        }
    }
    for(int i = 1; i < (1<<k); i++) {
        if(dp[i] >= cnt) {
            int counter = 0;
            for(int j = 0; j < k; j++) {
                if((i>>j)&1) counter++;
            }
            if(counter<=k) {
                cout << "DA\n";
                return 0;
            }
        }
    }
    cout << "NE\n";
}

Subtask #1
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 39 ms 584 KB Output is correct
2 Correct 478 ms 1376 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct

Subtask #2
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 445 ms 1360 KB Output is correct
2 Correct 461 ms 1292 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 450 ms 1648 KB Output is correct
6 Correct 1 ms 348 KB Output is correct

Subtask #3
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 442 ms 1364 KB Output is correct
2 Correct 461 ms 1348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 ms 448 KB Output is correct

Subtask #4
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 96 ms 592 KB Output is correct
2 Correct 448 ms 1412 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 1 ms 472 KB Output is correct
6 Correct 1 ms 348 KB Output is correct

Subtask #5
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 428 ms 1468 KB Output is correct
2 Correct 463 ms 1364 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct

Subtask #6
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 457 ms 1384 KB Output is correct
2 Correct 437 ms 1364 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct

Subtask #7
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 446 ms 1376 KB Output is correct
2 Correct 454 ms 1320 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 445 ms 1796 KB Output is correct
6 Correct 1 ms 348 KB Output is correct

Subtask #8
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 92 ms 592 KB Output is correct
2 Correct 454 ms 1920 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 1 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct

Subtask #9
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 34 ms 584 KB Output is correct
2 Correct 480 ms 1620 KB Output is correct
3 Correct 1 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 1 ms 348 KB Output is correct

Subtask #10
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 184 ms 988 KB Output is correct
2 Correct 470 ms 1436 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 188 ms 852 KB Output is correct
6 Correct 1 ms 348 KB Output is correct