Submission #88445

#	Time	Username	Problem	Language	Result	Execution time	Memory
88445		jasony123123	Burza (COCI16_burza)	C++11	160 / 160	198 ms	208680 KiB

burza

#define _CRT_SECURE_NO_WARNINGS
#include <bits/stdc++.h>
//#include <ext/pb_ds/tree_policy.hpp>
//#include <ext/pb_ds/assoc_container.hpp>
using namespace std;
//using namespace __gnu_pbds;
#define FOR(i,start,end) for(int i=start;i<(int)(end);i++)
#define FORE(i,start,end) for(int i=start;i<=(int)end;i++)
#define RFOR(i,start,end) for(int i = start; i>end; i--)
#define RFORE(i,start,end) for(int i = start; i>=end; i--)
#define all(a) a.begin(), a.end()
#define mt make_tuple
#define v vector
#define sf scanf
#define pf printf
#define dvar(x) cout << #x << " := " << x << "\n"
#define darr(x,n) FOR(i,0,n) cout << #x << "[" << i << "]" << " := " << x[i] << "\n"
typedef long long ll;
typedef long double ld;
typedef pair<int, int > pii;
typedef pair<ll, ll> pll;
const ll MOD = 1000000007LL;
const ll PRIME = 105943LL;
const ll INF = 1e18;
//template <class T> using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
template<class T> void minn(T &a, T b) { a = min(a, b); }
template<class T> void maxx(T &a, T b) { a = max(a, b); }
void io() {
#ifdef LOCAL_PROJECT 
	freopen("input.in", "r", stdin); freopen("output.out", "w", stdout);
#else 
	/* online submission */
#endif 
	ios_base::sync_with_stdio(false); cin.tie(NULL);
}
/**************************COCI 2016-2017 Contest 2 Problem 6 *************************/
 
int N, K;
v<int> adj[400]; // root is 0
int numLeaf = 0;
v<pii> segs[400]; // exists cover i->segs[i].first with k = .second
bool dp[400][1<<19];
bool seen[400][1<<19];

bool isGood(int unused, int avaBitmask){
    if(unused==numLeaf) return true;
    if(seen[unused][avaBitmask]) return dp[unused][avaBitmask];
    seen[unused][avaBitmask] = true;
    for(pii intv : segs[unused]) if((1<<intv.second)&avaBitmask){
        bool res = isGood(intv.first+1, (1<<intv.second)^avaBitmask);
        if(res) return dp[unused][avaBitmask] = true;
    }
    return dp[unused][avaBitmask] = false;
}

pii dfs(int cur, int par, int dep){
    pii ret = {INT_MAX, INT_MIN};
    if(dep==K){
        ret = {numLeaf, numLeaf};
        numLeaf++;
    }
    else{
        for(int chi : adj[cur]) if(chi!=par){
            pii calc = dfs(chi, cur, dep+1);
            minn(ret.first, calc.first);
            maxx(ret.second, calc.second);
        }
    }
    if(ret!=make_pair(INT_MAX, INT_MIN) && dep!=0){
        segs[ret.first].push_back({ret.second, dep-1});
    }
    return ret;
}

int main() {
	io();
    cin >> N >> K;
    if(K>=20){
        cout << "DA\n";
        return 0;
    }
    
    // input tree 
    FOR(i,0,N-1){
        int a, b;
        cin >> a>> b;
        a--, b--;
        adj[a].push_back(b);
        adj[b].push_back(a);
    }
    
    // calculate segs
    dfs(0, -1, 0);
/*    FOR(i,0,numLeaf){
        for(pii intv : segs[i]){
            cout << i << " to " << intv.first << " k = " << intv.second << "\n";
        }
    }
*/
    memset(seen, 0, sizeof seen);
    cout << (isGood(0, (1<<K)-1)?"DA":"NE") << "\n";
	return 0;
}
/*
...
*/

• Subtask 1: 16 / 16
• Subtask 2: 16 / 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