#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, reach[mxN];
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<=19; i++)
if(steps&(1<<i)) e = lift[e][i];
return e;
}
int bring ( int i ) {
int l = 0, r = n+1, ans = i;
while(l<=r) {
int mid = (l+r)/2, e = up(mid, i);
if(dis[i]-dis[e]<=k) { ans = e, l = mid+1; }
else r = mid-1;
}
return ans;
}
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;
int left = k-(d+it.second);
if(reach[it.first]>=left) continue;
reach[it.first] = left;
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;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
517 ms |
101864 KB |
Output is correct |
2 |
Correct |
480 ms |
101992 KB |
Output is correct |
3 |
Correct |
154 ms |
47552 KB |
Output is correct |
4 |
Correct |
507 ms |
102760 KB |
Output is correct |
5 |
Correct |
3 ms |
14684 KB |
Output is correct |
6 |
Correct |
4 ms |
14684 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
4 ms |
14680 KB |
Output is correct |
2 |
Incorrect |
3 ms |
14684 KB |
Output isn't correct |
3 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
2 ms |
14684 KB |
Output is correct |
2 |
Correct |
2 ms |
14772 KB |
Output is correct |
3 |
Correct |
3 ms |
14684 KB |
Output is correct |
4 |
Incorrect |
3 ms |
14816 KB |
Output isn't correct |
5 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
530 ms |
101980 KB |
Output is correct |
2 |
Incorrect |
270 ms |
61272 KB |
Output isn't correct |
3 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
5 ms |
14940 KB |
Output is correct |
2 |
Correct |
5 ms |
14936 KB |
Output is correct |
3 |
Correct |
4 ms |
14940 KB |
Output is correct |
4 |
Correct |
5 ms |
14940 KB |
Output is correct |
5 |
Correct |
15 ms |
17240 KB |
Output is correct |
6 |
Correct |
19 ms |
17240 KB |
Output is correct |
7 |
Incorrect |
17 ms |
17244 KB |
Output isn't correct |
8 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
537 ms |
96044 KB |
Output is correct |
2 |
Correct |
470 ms |
93764 KB |
Output is correct |
3 |
Correct |
521 ms |
97972 KB |
Output is correct |
4 |
Correct |
200 ms |
54700 KB |
Output is correct |
5 |
Execution timed out |
3066 ms |
105224 KB |
Time limit exceeded |
6 |
Halted |
0 ms |
0 KB |
- |