Skip to content

feat: add solutions to lc problem: No.2322 #4573

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Merged
merged 1 commit into from
Jul 17, 2025
Merged

feat: add solutions to lc problem: No.2322 #4573

Show file tree
Hide file tree
Changes from all commits
Commits
Show all changes
1 commit
Select commit
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
288 changes: 192 additions & 96 deletions solution/2300-2399/2322.Minimum Score After Removals on a Tree/README.md
View file
Open in desktop

Large diffs are not rendered by default.

290 changes: 196 additions & 94 deletions solution/2300-2399/2322.Minimum Score After Removals on a Tree/README_EN.md
View file
Open in desktop

Large diffs are not rendered by default.

67 changes: 32 additions & 35 deletions solution/2300-2399/2322.Minimum Score After Removals on a Tree/Solution.cpp
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -1,49 +1,46 @@
class Solution {
public:
vector<int> nums;
int s;
int s1;
int n;
int ans = INT_MAX;
vector<vector<int>> g;

int minimumScore(vector<int>& nums, vector<vector<int>>& edges) {
n = nums.size();
g.resize(n, vector<int>());
for (auto& e : edges) {
int n = nums.size();
vector<int> g[n];
for (const auto& e : edges) {
int a = e[0], b = e[1];
g[a].push_back(b);
g[b].push_back(a);
}
for (int& v : nums) s ^= v;
this->nums = nums;
int s = 0, s1 = 0;
int ans = INT_MAX;
for (int x : nums) {
s ^= x;
}
auto dfs = [&](this auto&& dfs, int i, int fa) -> int {
int res = nums[i];
for (int j : g[i]) {
if (j != fa) {
res ^= dfs(j, i);
}
}
return res;
};
auto dfs2 = [&](this auto&& dfs2, int i, int fa) -> int {
int res = nums[i];
for (int j : g[i]) {
if (j != fa) {
int s2 = dfs2(j, i);
res ^= s2;
int mx = max({s ^ s1, s2, s1 ^ s2});
int mn = min({s ^ s1, s2, s1 ^ s2});
ans = min(ans, mx - mn);
}
}
return res;
};
for (int i = 0; i < n; ++i) {
for (int j : g[i]) {
s1 = dfs(i, -1, j);
dfs2(i, -1, j);
s1 = dfs(i, j);
dfs2(i, j);
}
}
return ans;
}

int dfs(int i, int fa, int x) {
int res = nums[i];
for (int j : g[i])
if (j != fa && j != x) res ^= dfs(j, i, x);
return res;
}

int dfs2(int i, int fa, int x) {
int res = nums[i];
for (int j : g[i])
if (j != fa && j != x) {
int a = dfs2(j, i, x);
res ^= a;
int b = s1 ^ a;
int c = s ^ s1;
int t = max(max(a, b), c) - min(min(a, b), c);
ans = min(ans, t);
}
return res;
}
};
38 changes: 18 additions & 20 deletions solution/2300-2399/2322.Minimum Score After Removals on a Tree/Solution.go
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -6,41 +6,39 @@ func minimumScore(nums []int, edges [][]int) int {
g[a] = append(g[a], b)
g[b] = append(g[b], a)
}
s := 0
for _, v := range nums {
s ^= v
}
s1 := 0
s, s1 := 0, 0
ans := math.MaxInt32
var dfs func(int, int, int) int
var dfs2 func(int, int, int) int
dfs = func(i, fa, x int) int {
for _, x := range nums {
s ^= x
}
var dfs func(i, fa int) int
dfs = func(i, fa int) int {
res := nums[i]
for _, j := range g[i] {
if j != fa && j != x {
res ^= dfs(j, i, x)
if j != fa {
res ^= dfs(j, i)
}
}
return res
}
dfs2 = func(i, fa, x int) int {
var dfs2 func(i, fa int) int
dfs2 = func(i, fa int) int {
res := nums[i]
for _, j := range g[i] {
if j != fa && j != x {
a := dfs2(j, i, x)
res ^= a
b := s1 ^ a
c := s ^ s1
t := max(max(a, b), c) - min(min(a, b), c)
ans = min(ans, t)
if j != fa {
s2 := dfs2(j, i)
res ^= s2
mx := max(s^s1, s2, s1^s2)
mn := min(s^s1, s2, s1^s2)
ans = min(ans, mx-mn)
}
}
return res
}
for i := 0; i < n; i++ {
for _, j := range g[i] {
s1 = dfs(i, -1, j)
dfs2(i, -1, j)
s1 = dfs(i, j)
dfs2(i, j)
}
}
return ans
Expand Down
40 changes: 19 additions & 21 deletions solution/2300-2399/2322.Minimum Score After Removals on a Tree/Solution.java
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -1,53 +1,51 @@
class Solution {
private int s;
private int s1;
private int n;
private int ans = Integer.MAX_VALUE;
private int[] nums;
private List<Integer>[] g;
private int ans = Integer.MAX_VALUE;
private int s;
private int s1;

public int minimumScore(int[] nums, int[][] edges) {
n = nums.length;
g = new List[n];
int n = nums.length;
this.nums = nums;
g = new List[n];
Arrays.setAll(g, k -> new ArrayList<>());
for (int[] e : edges) {
int a = e[0], b = e[1];
g[a].add(b);
g[b].add(a);
}
for (int v : nums) {
s ^= v;
for (int x : nums) {
s ^= x;
}
for (int i = 0; i < n; ++i) {
for (int j : g[i]) {
s1 = dfs(i, -1, j);
dfs2(i, -1, j);
s1 = dfs(i, j);
dfs2(i, j);
}
}
return ans;
}

private int dfs(int i, int fa, int x) {
private int dfs(int i, int fa) {
int res = nums[i];
for (int j : g[i]) {
if (j != fa && j != x) {
res ^= dfs(j, i, x);
if (j != fa) {
res ^= dfs(j, i);
}
}
return res;
}

private int dfs2(int i, int fa, int x) {
private int dfs2(int i, int fa) {
int res = nums[i];
for (int j : g[i]) {
if (j != fa && j != x) {
int a = dfs2(j, i, x);
res ^= a;
int b = s1 ^ a;
int c = s ^ s1;
int t = Math.max(Math.max(a, b), c) - Math.min(Math.min(a, b), c);
ans = Math.min(ans, t);
if (j != fa) {
int s2 = dfs2(j, i);
res ^= s2;
int mx = Math.max(Math.max(s ^ s1, s2), s1 ^ s2);
int mn = Math.min(Math.min(s ^ s1, s2), s1 ^ s2);
ans = Math.min(ans, mx - mn);
}
}
return res;
Expand Down
30 changes: 13 additions & 17 deletions solution/2300-2399/2322.Minimum Score After Removals on a Tree/Solution.py
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -1,37 +1,33 @@
class Solution:
def minimumScore(self, nums: List[int], edges: List[List[int]]) -> int:
def dfs(i, fa, x):
def dfs(i: int, fa: int) -> int:
res = nums[i]
for j in g[i]:
if j != fa and j != x:
res ^= dfs(j, i, x)
if j != fa:
res ^= dfs(j, i)
return res

def dfs2(i, fa, x):
def dfs2(i: int, fa: int) -> int:
nonlocal s, s1, ans
res = nums[i]
for j in g[i]:
if j != fa and j != x:
a = dfs2(j, i, x)
res ^= a
b = s1 ^ a
c = s ^ s1
t = max(a, b, c) - min(a, b, c)
ans = min(ans, t)
if j != fa:
s2 = dfs2(j, i)
res ^= s2
mx = max(s ^ s1, s2, s1 ^ s2)
mn = min(s ^ s1, s2, s1 ^ s2)
ans = min(ans, mx - mn)
return res

g = defaultdict(list)
for a, b in edges:
g[a].append(b)
g[b].append(a)

s = 0
for v in nums:
s ^= v
s = reduce(lambda x, y: x ^ y, nums)
n = len(nums)
ans = inf
for i in range(n):
for j in g[i]:
s1 = dfs(i, -1, j)
dfs2(i, -1, j)
s1 = dfs(i, j)
dfs2(i, j)
return ans
55 changes: 55 additions & 0 deletions solution/2300-2399/2322.Minimum Score After Removals on a Tree/Solution.rs
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -0,0 +1,55 @@
impl Solution {
pub fn minimum_score(nums: Vec<i32>, edges: Vec<Vec<i32>>) -> i32 {
let n = nums.len();
let mut g = vec![vec![]; n];
for e in edges.iter() {
let a = e[0] as usize;
let b = e[1] as usize;
g[a].push(b);
g[b].push(a);
}
let mut s1 = 0;
let mut ans = i32::MAX;
let s = nums.iter().fold(0, |acc, &x| acc ^ x);

fn dfs(i: usize, fa: usize, g: &Vec<Vec<usize>>, nums: &Vec<i32>) -> i32 {
let mut res = nums[i];
for &j in &g[i] {
if j != fa {
res ^= dfs(j, i, g, nums);
}
}
res
}

fn dfs2(
i: usize,
fa: usize,
g: &Vec<Vec<usize>>,
nums: &Vec<i32>,
s: i32,
s1: i32,
ans: &mut i32,
) -> i32 {
let mut res = nums[i];
for &j in &g[i] {
if j != fa {
let s2 = dfs2(j, i, g, nums, s, s1, ans);
res ^= s2;
let mx = (s ^ s1).max(s2).max(s1 ^ s2);
let mn = (s ^ s1).min(s2).min(s1 ^ s2);
*ans = (*ans).min(mx - mn);
}
}
res
}

for i in 0..n {
for &j in &g[i] {
s1 = dfs(i, j, &g, &nums);
dfs2(i, j, &g, &nums, s, s1, &mut ans);
}
}
ans
}
}
40 changes: 40 additions & 0 deletions solution/2300-2399/2322.Minimum Score After Removals on a Tree/Solution.ts
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -0,0 +1,40 @@
function minimumScore(nums: number[], edges: number[][]): number {
const n = nums.length;
const g: number[][] = Array.from({ length: n }, () => []);
for (const [a, b] of edges) {
g[a].push(b);
g[b].push(a);
}
const s = nums.reduce((a, b) => a ^ b, 0);
let s1 = 0;
let ans = Number.MAX_SAFE_INTEGER;
function dfs(i: number, fa: number): number {
let res = nums[i];
for (const j of g[i]) {
if (j !== fa) {
res ^= dfs(j, i);
}
}
return res;
}
function dfs2(i: number, fa: number): number {
let res = nums[i];
for (const j of g[i]) {
if (j !== fa) {
const s2 = dfs2(j, i);
res ^= s2;
const mx = Math.max(s ^ s1, s2, s1 ^ s2);
const mn = Math.min(s ^ s1, s2, s1 ^ s2);
ans = Math.min(ans, mx - mn);
}
}
return res;
}
for (let i = 0; i < n; ++i) {
for (const j of g[i]) {
s1 = dfs(i, j);
dfs2(i, j);
}
}
return ans;
}