Submission #61203019

---

Source Code Expand

use std::collections::{BTreeMap, HashMap};

use proconio::{input, marker::Chars};

pub fn main() {
    input! {
        n: usize,
        m: usize,
        mut yxcm: [(usize, usize, char); m]
    };
    yxcm.sort_by(|a, b| b.0.cmp(&a.0).then(a.1.cmp(&b.1)));
    let mut w_row_forbidden_map: BTreeMap<usize, usize> = BTreeMap::new();
    let mut b_row_forbidden_map: BTreeMap<usize, usize> = BTreeMap::new();
    let mut w_column_forbidden_map: BTreeMap<usize, usize> = BTreeMap::new();
    let mut b_column_forbidden_map: BTreeMap<usize, usize> = BTreeMap::new();
    for &(y, x, c) in yxcm.iter().cycle().take(2 * n) {
        if c == 'W' {
            if let Some((k, v)) = w_row_forbidden_map.range(&x..).next() {
                if *v > y {
                    println!("{}", "No");
                    return;
                }
            }
            if let Some(v) = b_row_forbidden_map.get_mut(&x) {
                if *v < y {
                    *v = y;
                }
            } else {
                b_row_forbidden_map.insert(x, y);
            }
            if let Some((k, v)) = w_column_forbidden_map.range(&y..).next() {
                if *v > x {
                    println!("{}", "No");
                    return;
                }
            }
            if let Some(v) = b_column_forbidden_map.get_mut(&y) {
                if *v < x {
                    *v = x;
                }
            } else {
                b_column_forbidden_map.insert(y, x);
            }
        } else {
            if let Some((k, v)) = b_row_forbidden_map.range(..=&x).rev().next() {
                if *v < y {
                    println!("{}", "No");
                    return;
                }
            }
            if let Some(v) = w_row_forbidden_map.get_mut(&x) {
                if *v > y {
                    *v = y;
                }
            } else {
                w_row_forbidden_map.insert(x, y);
            }
            if let Some((k, v)) = b_column_forbidden_map.range(..=&y).rev().next() {
                if *v < x {
                    println!("{}", "No");
                    return;
                }
            }
            if let Some(v) = w_column_forbidden_map.get_mut(&y) {
                if *v > x {
                    *v = x;
                }
            } else {
                w_column_forbidden_map.insert(y, x);
            }
        }
    }
    println!("{}", "Yes");
}

Submission Info

Compile Error

warning: unused import: `HashMap`
 --> src/main.rs:1:34
  |
1 | use std::collections::{BTreeMap, HashMap};
  |                                  ^^^^^^^
  |
  = note: `#[warn(unused_imports)]` on by default

warning: unused import: `marker::Chars`
 --> src/main.rs:3:23
  |
3 | use proconio::{input, marker::Chars};
  |                       ^^^^^^^^^^^^^

warning: unused variable: `k`
  --> src/main.rs:18:26
   |
18 |             if let Some((k, v)) = w_row_forbidden_map.range(&x..).next() {
   |                          ^ help: if this is intentional, prefix it with an underscore: `_k`
   |
   = note: `#[warn(unused_variables)]` on by default

warning: unused variable: `k`
  --> src/main.rs:31:26
   |
31 |             if let Some((k, v)) = w_column_forbidden_map.range(&y..).next() {
   |                          ^ help: if this is intentional, prefix it with an underscore: `_k`

warning: unused variable: `k`
  --> src/main.rs:45:26
   |
45 |             if let Some((k, v)) = b_row_forbidden_map.range(..=&x).rev().next() {
   |                          ^ help: if this is intentional, prefix it with an underscore: `_k`

warning: unused variable: `k`
  --> src/main.rs:58:26
   |
58 |             if let Some((k, v)) = b_column_forbidden_map.range(..=&y).rev().next() {
   |                          ^ help: if this is intentional, prefix it with an underscore: `_k`

Judge Result