We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
can someone please point out the error it's throwing bad_alloc for all test cases but case #0.
#include<bits/stdc++.h>usingnamespacestd;#define intt long long intunordered_map<intt,intt>cost;classDisjoint_set{public:vector<intt>vec,size;voidUnion(intts,inttd,inttv){if(Find(s)!=Find(d)){cost[v]+=(size[Find(s)]*size[Find(d)]);size[Find(d)]+=size[Find(s)];vec[Find(s)]=Find(d);}}inttFind(inttk){if(vec[k]==k)returnk;inttp=Find(vec[k]);vec[k]=p;returnp;}Disjoint_set(inttn):vec(n+1),size(n+1,1){for(intta=0;a<=n;a++)vec[a]=a;}};intmain(){inttn,q,s,d,l,min,max,v,maxcost=0;cin>>n>>q;v=n;Disjoint_setdset(n);map<intt,list<pair<intt,intt>>>mymap;n--;while(n--){cin>>s>>d>>l;if(l>maxcost)maxcost=l;cost[l]=0;mymap[l].push_back(make_pair(s,d));}inttrange;while(mymap.size()>0){autoa=mymap.begin();range=a->first;for(autop:a->second)dset.Union(p.first,p.second,a->first);mymap.begin()->second.clear();mymap.erase(mymap.begin());}vector<intt>anss(maxcost+1);intta;anss[0]=0;for(a=1;a<=range;a++){anss[a]=anss[a-1]+cost[a];}while(q--){inttans=0;cin>>min>>max;if(min>0)ans=anss[max]-anss[min-1];elseans=anss[max];cout<<ans<<endl;}return0;}
Cookie support is required to access HackerRank
Seems like cookies are disabled on this browser, please enable them to open this website
Super Maximum Cost Queries
You are viewing a single comment's thread. Return to all comments →
can someone please point out the error it's throwing bad_alloc for all test cases but case #0.