Submission #879005

#TimeUsernameProblemLanguageResultExecution timeMemory
879005_anhxinloi_Janjetina (COCI21_janjetina)C++14
15 / 110
1566 ms420856 KiB
#include<bits/stdc++.h> #define int long long #define fi first #define se second using namespace std; const int maxn = 2e5 + 5; typedef pair<int, int> pii; int n, k, pa[maxn], child[maxn], ans; vector<pii> adj[maxn], g[maxn]; int bit[2*maxn]; bool check[maxn]; void update(int idx, int val){ for(++idx; idx <= 100000; idx += idx&(-idx)) bit[idx] += val; } int get(int idx){ int ret = 0; for(++idx; idx > 0; idx -= idx&(-idx)) ret += bit[idx]; return ret; } int dfs_sz(int u, int par){ child[u] = 1; for(auto z : adj[u]){ auto [w, v] = z; if(v == par || check[v]) continue; child[u] += dfs_sz(v, u); } return child[u]; } int centroid(int v, int prt, int tot){ for(auto u : g[v]) if(u.se != prt && !check[u.se] && child[u.se]*2 >= tot) return centroid(u.se, v, tot); return v; } void dfs_work(int u, int par, int val, int dist, int top){ g[top].push_back(make_pair(val, dist)); for(auto z : adj[u]){ auto [w, v] = z; if(v == par || check[v]) continue; dfs_work(v, u, max(val, w), dist+1, top); } } void build(int u, int par){ int sz = dfs_sz(u, par); int center = centroid(u, par, sz); // cout << u << endl; pa[center] = u; vector<pii> vec = {}; for(auto z : adj[center]){ auto [w, v] = z; if(check[v]) continue; dfs_work(v, u, w, 1, v); sort(g[v].begin(), g[v].end()); for(auto z : g[v]){ auto [val, dist] = z; int cur = val - dist - k; if(cur >= 0){ ++ans; ans -= get(cur); } update(dist, 1); } for(auto z : g[v]){ auto [val, dist] = z; update(dist, -1); vec.push_back(z); } } sort(vec.begin(), vec.end()); for(auto z : vec){ auto [val, dist] = z; int cur = val - dist - k; if(cur >= 0){ ans += get(cur); } update(dist, 1); } for(auto z : vec){ auto [val, dist] = z; update(dist, -1); } for(auto z : adj[center]){ auto [w, v] = z; g[v].clear(); } check[center] = true; for(auto z : adj[center]){ auto [w, v] = z; if(!check[v]) build(v, center); } } signed main(){ // freopen("love.inp" , "r" , stdin); // freopen("love.out" , "w" , stdout); ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0); cin >> n >> k; for(int i=1 ; i<n ; ++i){ int u, v, w; cin >> u >> v >> w; adj[u].push_back({w, v}); adj[v].push_back({w, u}); } build(1, -1); cout << ans * 2; }

Compilation message (stderr)

Main.cpp: In function 'long long int dfs_sz(long long int, long long int)':
Main.cpp:30:14: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   30 |         auto [w, v] = z;
      |              ^
Main.cpp: In function 'void dfs_work(long long int, long long int, long long int, long long int, long long int)':
Main.cpp:48:14: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   48 |         auto [w, v] = z;
      |              ^
Main.cpp: In function 'void build(long long int, long long int)':
Main.cpp:63:14: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   63 |         auto [w, v] = z;
      |              ^
Main.cpp:70:18: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   70 |             auto [val, dist] = z;
      |                  ^
Main.cpp:80:18: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   80 |             auto [val, dist] = z;
      |                  ^
Main.cpp:88:14: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   88 |         auto [val, dist] = z;
      |              ^
Main.cpp:97:14: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
   97 |         auto [val, dist] = z;
      |              ^
Main.cpp:102:14: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
  102 |         auto [w, v] = z;
      |              ^
Main.cpp:108:14: warning: structured bindings only available with '-std=c++17' or '-std=gnu++17'
  108 |         auto [w, v] = z;
      |              ^
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...