Lehmät

use std::io::{BufRead, BufReader};

fn find_everything(input: String, n: u8, m: u8) -> ((u8, u8), (u8, u8), Vec<(u8, u8)>) {
    let (mut a, mut b) = ((0, 0), (0, 0));
    let mut a_set = false;
    let mut cow_positions = Vec::new();
    for x in 0..n {
        for y in 0..m {
            let i = x*(m+1)+y;
            let c = input.chars().nth(i.into()).unwrap();
            if c == '*' {
                if !a_set {
                    a = (x, y);
                    a_set = true;
                } else {
                    b = (x, y);
                }
            }
            else if c == '@' {
                cow_positions.push((x, y));
            }
        }
    }
    (a, b, cow_positions)
}

fn solve(a: (u8, u8), b: (u8, u8), cows: Vec<(u8, u8)>) -> u8 {
    let mut count = 0;
    for cow in cows.iter() {
        if cow.0 > a.0
        && cow.1 > a.1
        && cow.0 < b.0
        && cow.1 < b.1 {
            count += 1;
        }
    }
    count
}

fn main() {
    let mut line = String::new();
    let mut input = BufReader::new(std::io::stdin());
    input.read_line(&mut line).unwrap();
    let mut split = line.split_whitespace();
    let n: u8 = split.next().unwrap().parse().unwrap();
    let m: u8 = split.next().unwrap().parse().unwrap();
    line.clear();
    for _ in 0..n {
        input.read_line(&mut line).unwrap();
    }
    let (a, b, cows) = find_everything(line, n, m);
    let ans = solve(a, b, cows);
    println!("{}", ans);
}

Test 1

Group: 1, 2

Verdict: ACCEPTED

Test 2

Group: 1, 2

Verdict: ACCEPTED

Test 3

Group: 1, 2

Verdict: ACCEPTED

Test 4

Group: 1, 2

Verdict: ACCEPTED

Test 5

Group: 1, 2

Verdict: ACCEPTED

Test 6

Group: 2

Verdict: WRONG ANSWER

Test 7

Group: 2

Verdict: WRONG ANSWER

Test 8

Group: 2

Verdict: WRONG ANSWER

Test 9

Group: 2

Verdict: WRONG ANSWER