제출 #1121861

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1121861		asli_bg	Burza (COCI16_burza)	C++11	0 / 160	6 ms	5112 KiB

burza

#include <bits/stdc++.h>
using namespace std;

//#define int long long

#define fi first
#define se second
#define all(x) x.begin(),x.end()
#define sp <<' '<<
#define pb push_back

#define FOR(i,a) for(int i=0;i<(a);i++)
#define FORE(i,a,b) for(int i=(a);i<(b);i++)

#define cont(a) for(auto el:a) cout<<el<<' '; cout<<endl;
#define contp(a) for(auto el:a) cout<<el.fi<<'-'<<el.se<<' ';cout<<endl;

#define DEBUG(x) cout<<#x sp ":" sp x<<endl;

typedef vector<int> vi;
typedef pair<int,int> pii;
typedef vector<pii> vii;
typedef long long ll;

#define mid (l+r)/2

#define topla(x,y) ((x%MOD)+(y%MOD))%MOD
#define carp(x,y) ((x%MOD)*(y%+MOD))%MOD

const int MAXN=2e5+5;
const int MOD=998244353;
const int INF=1e9;

vi adj[MAXN];

int dp[MAXN];

void dfs(int nd,int ata,int h){
    int mx,mx2;
    mx=mx2=-1;

    for(auto kom:adj[nd]){
        if(kom==ata) continue;
        dfs(kom,nd,h+1);
        
        if(dp[kom]>mx){
            swap(mx,mx2);
            mx=dp[kom];
        }
        else if(dp[kom]>mx2){
            mx2=dp[kom];
        }
    }

    dp[nd]=mx2+1;
}

signed main(){
    ios_base::sync_with_stdio(0);
    cin.tie(0);

    int n,k;
    cin>>n>>k;

    FOR(i,n-1){
        int a,b;
        cin>>a>>b;
        adj[a].pb(b);
        adj[b].pb(a);
    }

    //dp on tree yapıcaz
    dfs(1,-1,0);

    if(dp[1]<k) cout<<"DA"<<endl;
    else cout<<"NE"<<endl;
}       

• 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