Submission #551968

#	Time	Username	Problem	Language	Result	Execution time	Memory
551968		aadit_ambadkar	Burza (COCI16_burza)	C++11	0 / 160	250 ms	524288 KiB

burza

#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;
//     }
//     st[u]=pz;
//     for (auto i : adj[u]) {
//         if (i!=p) dfs(i, u);
//     }
//     dr[u]=pz;
// }

void dfs(int nod, int dad)
{
    if(nod)
        level[nod] = level[dad] + 1;
    if(level[nod] == k-1)
    {
        st[nod] = pz++;
        dr[nod] = pz;
        return;
    }
    st[nod] = pz;
    for(int i = 0; i < adj[nod].size(); ++i)
    {
        int vecin = adj[nod][i];
        if(vecin == dad)
            continue;
        dfs(nod, vecin);
    }
    dr[nod] = 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;
}

int main() {
    cin >> n >> k;
    if (k*k >= n) {
        cout << "DE\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");
}

Compilation message (stderr)

burza.cpp: In function 'void dfs(int, int)':
burza.cpp:35:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   35 |     for(int i = 0; i < adj[nod].size(); ++i)
      |                    ~~^~~~~~~~~~~~~~~~~

• Subtask 1: 0 / 16
• Subtask 2: 0 / 16
• Subtask 3: 0 / 16
• Subtask 4: 0 / 16
• Subtask 5: 0 / 16
• Subtask 6: 0 / 16
• Subtask 7: 0 / 16
• Subtask 8: 0 / 16
• Subtask 9: 0 / 16
• Subtask 10: 0 / 16