oj.uz

Submission #551985

# Submission time Handle Problem Language Result Execution time Memory
551985 2022-04-22T04:45:29 Z aadit_ambadkar Burza (COCI16_burza) C++11
160 / 160
 62 ms 3208 KB 
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
 
vector<int> adj[402], q[402];
int n, k, st[402], dr[402], level[402], pz;
 
void dfs(int u, int p) {
    if (u==p) return;
    if (u) {
        level[u]=level[p]+1;
    }
    if (level[u]==k-1) {
        st[u]=pz++;
        dr[u]=pz;
        return;
    }
    st[u]=pz;
    for (auto i : adj[u]) {
        if (i!=p) dfs(i, u);
    }
    dr[u]=pz;
}
 
bool dp[402][(1<<20)];
 
bool solve() {
    dp[0][0]=1;
    for (int i = 1; i < n; i++) {
        q[st[i]].push_back(i);
    }
    for (int i = 0; i < pz; i++) {
        for (int j = 0; j < (1<<k); j++) {
            if (!dp[i][j]) continue;
            for (auto it : q[i]) {
                if (!(j >> level[it] & 1)) {
                    dp[dr[it]][j | (1<<level[it])]=1;
                }
            }
        }
    }
    for (int j = 0; j < (1<<k); j++) {
        if (dp[pz][j]) return 1;
    }
    return 0;
}
 
// bool solve()
// {
//     dp[0][0] = 1;
//     for(int i = 1; i < n; ++i)
//         q[st[i]].push_back(i);
 
//     for(int i = 0; i < pz; ++i)
//     {
//         for(int j = 0; j < (1<<k); ++j)
//         {
//             if (!dp[i][j])
//                 continue;
//             for(int jj = 0; jj < q[i].size(); ++jj)
//             {
//                 int it = q[i][jj];
//                 if (!(j >> level[it] & 1))
//                     dp[dr[it]][j | (1<<level[it])] = 1;
//             }
//         }
//     }
//     for(int j = 0; j < (1<<k); ++j)
//         if (dp[pz][j])
//             return 1;
 
//     return 0;
// }
 
int main() {
    cin >> n >> k;
    if (k*k >= n) {
        cout << "DA\n";
        return 0;
    }
    for (int i = 1; i < n; i++) {
        int a, b; cin >> a >> b;
        a--; b--;
        adj[a].push_back(b);
        adj[b].push_back(a);
    }
    level[0]=-1;
    dfs(0, -1);
    cout << (solve() ? "DA\n" : "NE\n");
}

Subtask #1
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 852 KB Output is correct
2 Correct 47 ms 2460 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 980 KB Output is correct
6 Correct 1 ms 340 KB Output is correct

Subtask #2
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 60 ms 2668 KB Output is correct
2 Correct 42 ms 2456 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 62 ms 2964 KB Output is correct
6 Correct 1 ms 980 KB Output is correct

Subtask #3
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 47 ms 2744 KB Output is correct
2 Correct 44 ms 2508 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 2 ms 852 KB Output is correct
6 Correct 1 ms 468 KB Output is correct

Subtask #4
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 14 ms 1236 KB Output is correct
2 Correct 55 ms 3208 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 724 KB Output is correct
6 Correct 0 ms 340 KB Output is correct

Subtask #5
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 36 ms 2272 KB Output is correct
2 Correct 50 ms 2892 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 1 ms 980 KB Output is correct
6 Correct 1 ms 724 KB Output is correct

Subtask #6
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 49 ms 2692 KB Output is correct
2 Correct 50 ms 2764 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 2 ms 852 KB Output is correct
6 Correct 1 ms 724 KB Output is correct

Subtask #7
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 59 ms 3032 KB Output is correct
2 Correct 48 ms 2724 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 61 ms 3048 KB Output is correct
6 Correct 1 ms 852 KB Output is correct

Subtask #8
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 1236 KB Output is correct
2 Correct 46 ms 2716 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 724 KB Output is correct
6 Correct 1 ms 980 KB Output is correct

Subtask #9
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 724 KB Output is correct
2 Correct 61 ms 2936 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 724 KB Output is correct
6 Correct 1 ms 980 KB Output is correct

Subtask #10
16.0 / 16.0

# Verdict Execution time Memory Grader output
1 Correct 23 ms 1612 KB Output is correct
2 Correct 56 ms 2948 KB Output is correct
3 Correct 1 ms 212 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 24 ms 1616 KB Output is correct
6 Correct 1 ms 596 KB Output is correct