Submission #547007

#	Time	Username	Problem	Language	Result	Execution time	Memory
547007		AA_Surely	Burza (COCI16_burza)	C++14	0 / 160	4 ms	5076 KiB

burza

#include <bits/stdc++.h>

#define FOR(i,x,n) 	for(int i=x; i<n; i++)
#define F0R(i,n) 	FOR(i,0,n)
#define ROF(i,x,n) 	for(int i=n-1; i>=x; i--)
#define R0F(i,n) 	ROF(i,0,n)

#define WTF 		cout << "WTF" << endl

#define IOS 		ios::sync_with_stdio(false); cin.tie(0)
#define F 			first
#define S	 		second
#define pb 			push_back

#define ALL(x) 		x.begin(), x.end()
#define RALL(x) 	x.rbegin(), x.rend()

using namespace std;
typedef long long 		LL;

typedef pair<int, int> 	PII;
typedef pair<LL, LL> 	PLL;

typedef vector<int> 	VI;
typedef vector<LL> 		VLL;
typedef vector<PII> 	VPII;
typedef vector<PLL> 	VPLL;

const int MAXN = 2e5 + 7;
const int ALPHA = 27;
const int INF = 1e9 + 7;
const int MOD = 1e9 + 7;
const int LOG = 22;

int n, k;
int dp[MAXN];
VI adj[MAXN];

void dfs(int now = 0, int par = -1) {
    VI keep; keep.pb(-1); keep.pb(-1);
    for(int on : adj[now]) if (on != par) {
        dfs(on, now);
        keep.pb(dp[on]);
    }

    sort(RALL(keep));
    dp[now] = keep[1] + 1;
    return;
}

int main() {
    IOS;
    
    cin >> n >> k;
    F0R(i, n - 1) {
        int u, v;
        cin >> u >> v;
        adj[--u].pb(--v);
        adj[v].pb(u);
    }

    dfs();
    //F0R(i, n) cout << dp[i] << ' ';

    cout << (dp[0] < k ? "DA" : "NE");
}

• 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