# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1191784 | SmuggingSpun | Janjetina (COCI21_janjetina) | C++20 | 20 ms | 5444 KiB |
#include<bits/stdc++.h>
#define taskname "D"
using namespace std;
typedef long long ll;
const int lim = 2e5 + 5;
int n, k, u[lim], v[lim], w[lim];
vector<int>g[lim];
namespace sub1{
int ans = 0;
void dfs(int s, int h = 0, int max_w = 0, int p = -1){
if(max_w - h >= k){
ans++;
}
for(int& i : g[s]){
int d = u[i] ^ v[i] ^ s;
if(d != p){
dfs(d, h + 1, max(max_w, w[i]), s);
}
}
}
void solve(){
for(int i = 1; i <= n; i++){
dfs(i);
}
cout << ans;
}
}
namespace sub23{
void solve(){
}
}
int main(){
ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
if(fopen(taskname".inp", "r")){
freopen(taskname".inp", "r", stdin);
}
cin >> n >> k;
for(int i = 1; i < n; i++){
cin >> u[i] >> v[i] >> w[i];
g[u[i]].emplace_back(i);
g[v[i]].emplace_back(i);
}
if(n <= 1000){
sub1::solve();
}
else{
sub23::solve();
}
}
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... |