#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);
}
}
bool f = 1;
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;
if(reach[it.first]<d+it.second) continue;
reach[it.first] = d+it.second;
if(f) 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;
int mini = 1e18;
for(int i=1; i<=n+1; i++) reach[i] = 1e18;
for(int i = 0; i<n-1; i++) {
int x,y,c; cin>>x>>y>>c; mini = min(mini, c);
adj[x].push_back({y,c}), adj[y].push_back({x,c});
}
if(mini*2>k) f = 0;
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 |
542 ms |
101556 KB |
Output is correct |
2 |
Correct |
470 ms |
101820 KB |
Output is correct |
3 |
Correct |
155 ms |
47016 KB |
Output is correct |
4 |
Correct |
476 ms |
99060 KB |
Output is correct |
5 |
Correct |
3 ms |
14684 KB |
Output is correct |
6 |
Correct |
3 ms |
14784 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
4 ms |
14684 KB |
Output is correct |
2 |
Incorrect |
3 ms |
14684 KB |
Output isn't correct |
3 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
3 ms |
14684 KB |
Output is correct |
2 |
Correct |
3 ms |
14684 KB |
Output is correct |
3 |
Correct |
3 ms |
14680 KB |
Output is correct |
4 |
Correct |
3 ms |
14684 KB |
Output is correct |
5 |
Correct |
3 ms |
14684 KB |
Output is correct |
6 |
Correct |
3 ms |
14684 KB |
Output is correct |
7 |
Correct |
3 ms |
14816 KB |
Output is correct |
8 |
Correct |
3 ms |
14680 KB |
Output is correct |
9 |
Correct |
3 ms |
14684 KB |
Output is correct |
10 |
Correct |
3 ms |
14820 KB |
Output is correct |
11 |
Incorrect |
3 ms |
14684 KB |
Output isn't correct |
12 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
547 ms |
100220 KB |
Output is correct |
2 |
Incorrect |
232 ms |
61372 KB |
Output isn't correct |
3 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
5 ms |
15084 KB |
Output is correct |
2 |
Correct |
5 ms |
14940 KB |
Output is correct |
3 |
Correct |
3 ms |
14940 KB |
Output is correct |
4 |
Correct |
4 ms |
14940 KB |
Output is correct |
5 |
Correct |
17 ms |
17388 KB |
Output is correct |
6 |
Correct |
19 ms |
17240 KB |
Output is correct |
7 |
Correct |
16 ms |
17240 KB |
Output is correct |
8 |
Correct |
14 ms |
17244 KB |
Output is correct |
9 |
Correct |
12 ms |
17244 KB |
Output is correct |
10 |
Correct |
14 ms |
17336 KB |
Output is correct |
11 |
Correct |
17 ms |
17244 KB |
Output is correct |
12 |
Correct |
4 ms |
14940 KB |
Output is correct |
13 |
Correct |
14 ms |
17376 KB |
Output is correct |
14 |
Correct |
12 ms |
17244 KB |
Output is correct |
15 |
Correct |
6 ms |
17244 KB |
Output is correct |
16 |
Correct |
4 ms |
14940 KB |
Output is correct |
17 |
Correct |
4 ms |
14772 KB |
Output is correct |
18 |
Correct |
6 ms |
17084 KB |
Output is correct |
19 |
Correct |
5 ms |
14940 KB |
Output is correct |
20 |
Correct |
4 ms |
14940 KB |
Output is correct |
21 |
Correct |
5 ms |
17244 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
505 ms |
95464 KB |
Output is correct |
2 |
Correct |
532 ms |
93096 KB |
Output is correct |
3 |
Correct |
537 ms |
98020 KB |
Output is correct |
4 |
Correct |
241 ms |
56252 KB |
Output is correct |
5 |
Execution timed out |
3063 ms |
106172 KB |
Time limit exceeded |
6 |
Halted |
0 ms |
0 KB |
- |