Submission #1024084

#	Time	Username	Problem	Language	Result	Execution time	Memory
1024084		caterpillow	Burza (COCI16_burza)	C++17	144 / 160	576 ms	410812 KiB

burza

#include <bits/stdc++.h>
 
using namespace std;
 
using ll = long long;
using pl = pair<ll, ll>;
using pi = pair<int, int>;
#define vt vector
#define f first
#define s second
#define pb push_back
#define all(x) x.begin(), x.end() 
#define size(x) ((int) (x).size())
#define FOR(i, a, b) for (int i = (a); i < (b); i++)
#define ROF(i, a, b) for (int i = (b) - 1; i >= (a); i--)
#define F0R(i, b) FOR (i, 0, b)
#define endl '\n'
const ll INF = 1e18;
const int inf = 1e9;

#define char unsigned char

#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")
 
int n, k, t;
vt<vt<int>> adj;
vt<int> depth, pos, jump, rpos;
vt<char> val;
 
void dfs(int u, int p = -1) {
    pos[u] = t++;
    if (depth[u] == k) val[u] = 1;
    for (int v : adj[u]) {
        if (v == p) continue;
        depth[v] = depth[u] + 1;
        dfs(v, u);
        val[u] += val[v];
    }
    jump[u] = t;
}
 
const int mxk = 20;
char dp[401][1 << mxk];
 
main() {
    cin.tie(0)->sync_with_stdio(0);
    
    cin >> n >> k;
    if (k * k >= n) {
        cout << "DA\n";
        return 0;
    }
    adj.resize(n);
    depth = pos = jump = rpos = vt<int>(n, 0);
    val.resize(n);
    F0R (i, n - 1) {
        int u, v; cin >> u >> v;
        u--, v--;
        adj[u].pb(v);
        adj[v].pb(u);
    }
 
    dfs(0);
    F0R (i, n) rpos[pos[i]] = i;

    ROF (i, 0, n) {
        int u = rpos[i];
        F0R (msk, 1 << mxk) { 
            dp[i][msk] = dp[i + 1][msk];
            if (depth[u] <= k && (1 & (msk >> depth[u]))) dp[i][msk] = max(dp[i][msk], (char) (val[u] + dp[jump[u]][msk ^ (1 << depth[u])]));
        }   
    }

    if (dp[0][(1 << mxk) - 2] == val[0]) cout << "DA\n";
    else cout << "NE\n";
}

Compilation message (stderr)

burza.cpp:46:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   46 | main() {
      | ^~~~

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