# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
964117 | Batorgil952 | Burza (COCI16_burza) | C++14 | 1 ms | 600 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include<bits/stdc++.h>
#define ll long long
#define pb push_back
#define mp make_pair
using namespace std;
const int N=402;
vector< int > v[N];
int dp[N];
bool B[N];
void DFS(int p){
int un, vn;
vector< int > u;
vn=v[p].size();
for(int i=0; i<vn; i++){
if(!B[v[p][i]]){
B[v[p][i]]=true;
DFS(v[p][i]);
u.pb(dp[v[p][i]]);
}
}
un=u.size();
if(un==0 || un==1) dp[p]=1;
else{
sort(u.begin(), u.end());
dp[p]=u[un-2]+1;
}
}
int main(){
int n, k, i, x, y;
scanf("%d",&n);
scanf("%d",&k);
for(i=1; i<n; i++){
scanf("%d",&x);
scanf("%d",&y);
v[x].pb(y);
v[y].pb(x);
}
B[1]=true;
DFS(1);
if(dp[1]>k) printf("NE\n");
else printf("DA\n");
return 0;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |