Commit 461961a

authored

Update 3600.Maximize-Spanning-Tree-Stability-with-Upgrades.cpp

1 parent da08f58 commit 461961aCopy full SHA for 461961a

File tree

1 file changed

+22

-27

lines changed

Union_Find/3600.Maximize-Spanning-Tree-Stability-with-Upgrades
- 3600.Maximize-Spanning-Tree-Stability-with-Upgrades.cpp

1 file changed

+22

-27

lines changed

`‎Union_Find/3600.Maximize-Spanning-Tree-Stability-with-Upgrades/3600.Maximize-Spanning-Tree-Stability-with-Upgrades.cpp‎`

Lines changed: 22 additions & 27 deletions

Original file line number	Diff line number	Diff line change
`@@ -17,64 +17,59 @@ class Solution {`
`17`	`17`	`return true;`
`18`	`18`	`}`
`19`	`19`	`};`
`20`		`-`
	`20`	`+`
`21`	`21`	`bool isOK(int T, int n, vector<vector<int>>& edges, int k) {`
`22`	`22`	`DSU dsu(n);`
`23`	`23`	`int count = 0;`
`24`	`24`	`int upgrade = 0;`
`25`		`-`
`26`		`- vector<vector<int>>arr; // cost, u,v`
	`25`	`+`
	`26`	`+ vector<vector<int>>candidates; // upgrade, u,v`
`27`	`27`	`for (auto& e: edges) {`
`28`	`28`	`int u = e[0], v = e[1], s = e[2], must = e[3];`
`29`	`29`	`if (must) {`
`30`	`30`	`if (s<T) return false;`
`31`	`31`	`dsu.unite(u,v);`
`32`		`- ++count;`
	`32`	`+ count++;`
`33`	`33`	`} else {`
`34`		`- if (s >= T)`
`35`		`- arr.push_back({0, u, v});`
	`34`	`+ if (s>=T)`
	`35`	`+ candidates.push_back({0, u, v});`
`36`	`36`	`else if (2*s>=T)`
`37`		`- arr.push_back({1, u, v});`
	`37`	`+ candidates.push_back({1, u, v});`
`38`	`38`	`}`
`39`	`39`	`}`
`40`	`40`
`41`		`- sort(arr.begin(), arr.end());`
	`41`	`+ sort(candidates.begin(), candidates.end());`
`42`	`42`
`43`		`- for (auto& p: arr) {`
`44`		`- int u = p[1], v = p[2];`
	`43`	`+ for (auto& cand: candidates) {`
	`44`	`+ int u = cand[1], v = cand[2];`
`45`	`45`	`if (count==n-1) break;`
`46`	`46`	`if (dsu.find(u)!=dsu.find(v)) {`
`47`	`47`	`dsu.unite(u,v);`
`48`	`48`	`count++;`
`49`		`- upgrade += p[0];`
`50`		`- if (upgrade > k)`
`51`		`- return false;`
	`49`	`+ upgrade += cand[0];`
	`50`	`+ if (upgrade > k) return false;`
`52`	`51`	`}`
`53`	`52`	`}`
`54`	`53`
`55`	`54`	`for (int i=0; i<n; i++)`
`56`	`55`	`if (dsu.find(i)!=dsu.find(0))`
`57`	`56`	`return false;`
`58`	`57`
`59`		`- return count == n-1;`
	`58`	`+ return count==n-1;`
`60`	`59`	`}`
`61`		`-`
	`60`	`+`
`62`	`61`	`int maxStability(int n, vector<vector<int>>& edges, int k) {`
`63`		`- int lo = 0, hi = 0;`
`64`		`- for (auto &e:edges) {`
`65`		`- hi = max(hi, e[2]);`
`66`		`- }`
`67`		`- hi*=2;`
`68`		`-`
`69`		`- while (lo<hi) {`
	`62`	`+ int lo = 1, hi = 1e5*2;`
	`63`	`+ while (lo < hi) {`
`70`	`64`	`int mid = hi-(hi-lo)/2;`
`71`		`- if (isOK(mid, n, edges, k)) {`
	`65`	`+ if (isOK(mid, n, edges, k))`
`72`	`66`	`lo = mid;`
`73`		`- } else {`
	`67`	`+ else`
`74`	`68`	`hi = mid-1;`
`75`		`- }`
`76`	`69`	`}`
`77`		`- if (isOK(lo, n, edges, k)) return lo;`
`78`		`- else return -1;`
	`70`	`+ if (isOK(lo, n, edges, k))`
	`71`	`+ return lo;`
	`72`	`+ else`
	`73`	`+ return -1;`
`79`	`74`	`}`
`80`	`75`	`};`

0 commit comments

Comments

(0)

Navigation Menu

Search code, repositories, users, issues, pull requests...

Provide feedback

Saved searches

Use saved searches to filter your results more quickly

Uh oh!

Commit 461961a

File tree

1 file changed

1 file changed

`‎Union_Find/3600.Maximize-Spanning-Tree-Stability-with-Upgrades/3600.Maximize-Spanning-Tree-Stability-with-Upgrades.cpp‎`

0 commit comments