Apartments

#![allow(unused)]

use std::{io, usize};

fn take_tuple() -> (usize, usize, usize) {
    let mut input = String::new();
    io::stdin().read_line(&mut input).unwrap();
    let mut it = input
        .trim()
        .split_whitespace()
        .map(|x| x.parse::<usize>().unwrap());
    (it.next().unwrap(), it.next().unwrap(), it.next().unwrap())
}

fn take_vector() -> Vec<usize> {
    let mut input = String::new();
    io::stdin().read_line(&mut input).unwrap();
    let arr: Vec<usize> = input
        .trim()
        .split_whitespace()
        .map(|x| x.parse::<usize>().unwrap())
        .collect();
    return arr;
}

fn find_suitable(
    min: &usize,
    max: &usize,
    num_apartments: &usize,
    apartments: &Vec<usize>,
    start_index: &mut usize,
    count: &mut usize,
) {
    for i in *start_index..*num_apartments {
        // println!("{}", i);
        let current_apartment = apartments[i];
        // println!(
        //     "    current apartment is {} with size {}",
        //     i, current_apartment
        // );

        if current_apartment > *max {
            return;
        }

        if *min <= current_apartment && current_apartment <= *max {
            // println!("Found a match!");
            *count += 1;
            *start_index = i+1;
            return;
        }
    }
}

fn main() {
    let (num_applicants, num_apartments, allowed_diff): (usize, usize, usize) = take_tuple();
    let mut applicants: Vec<usize> = take_vector();
    applicants.sort_unstable();
    let mut apartments: Vec<usize> = take_vector();
    apartments.sort_unstable();

    let mut count: usize = 0;
    let mut start_index: usize = 0;

    for applicant_index in 0..num_applicants {
        let min_size = applicants[applicant_index] - allowed_diff;
        let max_size = applicants[applicant_index] + allowed_diff;

        // println!(
        //     "Looking at applicant {}, with desired size range: {}-{}:",
        //     applicant_index, min_size, max_size
        // );
        find_suitable(&min_size, &max_size, &num_apartments, &apartments, &mut start_index, &mut count);
    }

    println!("{}", count);
}

Test 1

Verdict: ACCEPTED

Test 2

Verdict: ACCEPTED

Test 3

Verdict: WRONG ANSWER

Test 4

Verdict: WRONG ANSWER

Test 5

Verdict: ACCEPTED

Test 6

Verdict: WRONG ANSWER

Test 7

Verdict: TIME LIMIT EXCEEDED

Test 8

Verdict: TIME LIMIT EXCEEDED

Test 9

Verdict: ACCEPTED

Test 10

Verdict: ACCEPTED

Test 11

Verdict: ACCEPTED

Test 12

Verdict: WRONG ANSWER

Test 13

Verdict: ACCEPTED

Test 14

Verdict: ACCEPTED

Test 15

Verdict: ACCEPTED

Test 16

Verdict: TIME LIMIT EXCEEDED

Test 17

Verdict: ACCEPTED

Test 18

Verdict: ACCEPTED

Test 19

Verdict: ACCEPTED