Submission #1159777

#	Time	Username	Problem	Language	Result	Execution time	Memory
1159777		thelegendary08	Janjetina (COCI21_janjetina)	C++17	35 / 110	25 ms	4284 KiB

Main

#include<bits/stdc++.h>
#define pb push_back
#define mp make_pair
#define int long long
#define vi vector<int>
#define vvi vector<vector<int>>
#define pii pair<int, int>
#define vpii vector<pair<int, int>>
#define vc vector<char>
#define vb vector<bool>
#define mii map<int,int>
#define f0r(i,n) for(int i=0;i<n;i++)
#define FOR(i,k,n) for(int i=k;i<n;i++)
#define all(v) (v).begin(),(v).end()
#define rall(v) (v).rbegin(),(v).rend()
#define in(a) int a; cin>>a
#define in2(a,b) int a,b; cin>>a>>b
#define in3(a,b,c) int a,b,c; cin>>a>>b>>c
#define in4(a,b,c,d) int a,b,c,d; cin>>a>>b>>c>>d
#define vin(v,n); vi v(n); f0r(i,n){cin>>v[i];}
#define out(a) cout<<a<<'\n'
#define out2(a,b) cout<<a<<' '<<b<<'\n'
#define out3(a,b,c) cout<<a<<' '<<b<<' '<<c<<'\n'
#define out4(a,b,c,d) cout<<a<<' '<<b<<' '<<c<<' '<<d<<'\n'
#define vout(v) for(auto u : v){cout<<u<<' ';} cout<<'\n'
#define dout(a) cout<<a<<' '<<#a<<'\n'
#define dout2(a,b) cout<<a<<' '<<#a<<' '<<b<<' '<<#b<<'\n'
#define yn(x); if(x){cout<<"YES"<<'\n';}else{cout<<"NO"<<'\n';}
const int leg = 1e9 + 7;
const int mod = 998244353;
using namespace std;
const int mxn = 1e5 + 5;
int sz[mxn];
int par[mxn];
int find(int x){
	while(par[x] != x)x = par[x];
	return x;
}
void unite(int a, int b){
	//out3(a,b,small);
	a = find(a);
	b = find(b);
	if(sz[a] < sz[b])swap(a,b);
	sz[a] += sz[b];
	par[b] = a;
}
int solve(int lef, int rig, int mxl){
	if(lef > rig)swap(lef, rig);
	int add = (min(mxl, lef) + 1) * (min(mxl, lef) + 2) / 2;
	if(mxl > lef){
		int rem = min(rig - lef, mxl - lef);
		add += rem * (lef + 1);
	} 
	if(mxl > rig){
		int rem = mxl - rig;
		add += (lef + lef - rem + 1) * rem / 2;
	}
	return add;
}
signed main(){
	ios::sync_with_stdio(false);
	cin.tie(NULL);
	//ifstream cin(".in");
	//ofstream cout(".out");
	//dout(solve(3,5,9));
	in2(n,k);
	vi v(n-1);
	f0r(i,n-1){
		in3(a,b,w);
		a--; b--;
		v[min(a,b)] = w;
	}
	vpii w;
	f0r(i,n-1){
		w.pb(mp(v[i],i));
	}
	sort(all(w));
	f0r(i,n){
		sz[i] = 1;
		par[i] = i;
	}
	int ans = 0;
	f0r(i, n-1){
		int gw = w[i].first;
		int en = w[i].second;
		int mxl = gw - k - 1;
		if(mxl >= 0){
			int lef = 0;
			lef = sz[find(en)] - 1;
			
			int rig = 0;
			rig = sz[find(en + 1)] - 1;
			
			//out3(mxl, lef, rig);
			int sol = solve(lef, rig, min(lef + rig, mxl));
			ans += sol;
		}
		unite(en, en+1);
		//dout(ans);
	}
	out(ans * 2);
}

• Subtask 1: 0 / 15
• Subtask 2: 35 / 35
• Subtask 3: 0 / 60