#include <bits/stdc++.h>
#define int long long
using namespace std;
int const mxN = 3e5+5;
int dis[mxN], lift[mxN][20], elem[mxN], n, k;
vector<pair<int,int>> adj[mxN];
bool vis[mxN];
vector<pair<int,pair<int,int>>> v;
int up ( int steps , int e) {
for(int i=0; i<=18; i++)
if(steps&(1<<i)) e = lift[e][i];
return e;
}
int bring ( int i ) {
for(int j=18; j>=0; j--) {
if(dis[i]-dis[lift[i][j]]<=k) i = lift[i][j];
}
return i;
}
void dfs ( int i , int p, int m) {
dis[i] = m;
lift[i][0] = p;
for(int j=1; j<20; j++) lift[i][j] = lift[lift[i][j-1]][j-1];
elem[i] = bring(i);
v.push_back({-dis[elem[i]], {elem[i], i}});
for(auto it:adj[i]) {
if(it.first==p) continue;
dfs(it.first,i, m+it.second);
}
}
void do_work ( int i , int p, int d) {
vis[i] = 1;
for(auto it:adj[i]) {
if(it.first==p) continue;
if(d+it.second>k) continue;
do_work(it.first, i, d+it.second);
}
}
signed main() {
ios_base::sync_with_stdio(0); cin.tie(NULL); cout.tie(NULL);
cin>>n>>k;
for(int i = 0; i<n-1; i++) {
int x,y,c; cin>>x>>y>>c;
adj[x].push_back({y,c}), adj[y].push_back({x,c});
}
dfs(1,1,0);
vector<int> fin;
sort(v.begin(),v.end());
for(auto it:v) {
if(!vis[it.second.second]) {
vis[it.second.second] = 1;
do_work(it.second.first, 0, 0);
fin.push_back(it.second.first);
}
}
cout<<fin.size()<<'\n';
for(auto it:fin) cout<<it<<' ';
return 0;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
407 ms |
92780 KB |
Output is correct |
2 |
Correct |
373 ms |
91052 KB |
Output is correct |
3 |
Correct |
121 ms |
42320 KB |
Output is correct |
4 |
Correct |
352 ms |
91988 KB |
Output is correct |
5 |
Correct |
2 ms |
12632 KB |
Output is correct |
6 |
Correct |
2 ms |
12632 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
2 ms |
12636 KB |
Output is correct |
2 |
Correct |
2 ms |
12680 KB |
Output is correct |
3 |
Correct |
2 ms |
12636 KB |
Output is correct |
4 |
Correct |
2 ms |
12720 KB |
Output is correct |
5 |
Incorrect |
3 ms |
12636 KB |
Output isn't correct |
6 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
2 ms |
12636 KB |
Output is correct |
2 |
Correct |
3 ms |
12636 KB |
Output is correct |
3 |
Correct |
2 ms |
12636 KB |
Output is correct |
4 |
Correct |
3 ms |
12788 KB |
Output is correct |
5 |
Correct |
2 ms |
12768 KB |
Output is correct |
6 |
Correct |
2 ms |
12632 KB |
Output is correct |
7 |
Correct |
3 ms |
12632 KB |
Output is correct |
8 |
Correct |
3 ms |
12636 KB |
Output is correct |
9 |
Incorrect |
2 ms |
12636 KB |
Output isn't correct |
10 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
386 ms |
91568 KB |
Output is correct |
2 |
Correct |
209 ms |
56512 KB |
Output is correct |
3 |
Correct |
191 ms |
58352 KB |
Output is correct |
4 |
Correct |
167 ms |
53928 KB |
Output is correct |
5 |
Correct |
2 ms |
12632 KB |
Output is correct |
6 |
Correct |
2 ms |
12636 KB |
Output is correct |
7 |
Execution timed out |
3051 ms |
90412 KB |
Time limit exceeded |
8 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
4 ms |
12888 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
411 ms |
88048 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |