Skip to content

fix: replace bit-packing magic numbers with tuple keys (#23) #28

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

Open
traitimtrongvag wants to merge 1 commit into
base: main
Choose a base branch
from
Open

fix: replace bit-packing magic numbers with tuple keys (#23) #28

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
17 changes: 7 additions & 10 deletions hard/3625. Count Number of Trapezoids II/solution.rs
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -2,11 +2,11 @@ use std::collections::HashMap;

impl Solution {
pub fn count_trapezoids(points: Vec<Vec<i32>>) -> i32 {
let mut t: HashMap<i32, HashMap<i32, i32>> = HashMap::new();
let mut v: HashMap<i32, HashMap<i32, i32>> = HashMap::new();
let mut t: HashMap<(i32, i32), HashMap<i32, i32>> = HashMap::new();
let mut v: HashMap<(i32, i32), HashMap<i32, i32>> = HashMap::new();
let n = points.len();

fn add(map: &mut HashMap<i32, HashMap<i32, i32>>, key: i32, des: i32) {
fn add(map: &mut HashMap<(i32, i32), HashMap<i32, i32>>, key: (i32, i32), des: i32) {
let inner = map.entry(key).or_insert_with(HashMap::new);
*inner.entry(des).or_insert(0) += 1;
}
Expand All @@ -32,15 +32,12 @@ impl Solution {

let des = sx * y1 - sy * x1;

let key1 = (sx << 12) | (sy + 2000);
let key2 = (dx << 12) | (dy + 2000);

add(&mut t, key1, des);
add(&mut v, key2, des);
add(&mut t, (sx, sy), des);
add(&mut v, (dx, dy), des);
}
}

count(&t) - count(&v)/2
count(&t) - count(&v) / 2
}
}

Expand All @@ -55,7 +52,7 @@ fn gcd(mut a: i32, mut b: i32) -> i32 {
a
}

fn count(mp: &HashMap<i32, HashMap<i32, i32>>) -> i32 {
fn count(mp: &HashMap<(i32, i32), HashMap<i32, i32>>) -> i32 {
let mut ans: i64 = 0;

for inner in mp.values() {
Expand Down