Submission #51605958

---

Source Code Expand

// -*- coding:utf-8-unix -*-
/*
このコード、と～おれ!
  ∧＿∧　
（｡･ω･｡)つ━☆・*。
⊂    ノ       ・゜+.
 しーＪ       °。+ *´¨)
                  .· ´¸.·*´¨) ¸.·*¨)
                                      (¸.·´ (¸.·'* ☆
*/

use std::cmp::Reverse;
#[allow(unused_imports)]
use ac_library::*;
use itertools::Itertools;
use proconio::input;
use proconio::marker::Chars;
use std::collections::{BinaryHeap, BTreeMap, VecDeque};


static INF: usize = 1e18 as usize;

trait ChLibs<T: std::cmp::Ord> {
    fn chmin(&mut self, elm: T) -> bool;
    fn chmax(&mut self, elm: T) -> bool;
}

impl<T: std::cmp::Ord> ChLibs<T> for T {
    fn chmin(&mut self, elm: T) -> bool {
        return
            if *self > elm { *self = elm; true }
            else { false }
    }

    fn chmax(&mut self, elm: T) -> bool {
        return
            if *self < elm { *self = elm; true }
            else { false }
    }
}

trait Vector<T> {
    fn insertion_sort(&mut self, elem: T);
    fn print_continuous(&self);
    fn print_space_separate(&self);
    fn print_linebreak(&self);
}

impl<T: std::cmp::Ord  + std::fmt::Display> Vector<T> for Vec<T> {
    fn insertion_sort(&mut self, elem: T) { let idx = self.binary_search(&elem).unwrap_or_else(|x| x); self.insert(idx, elem); }
    fn print_continuous(&self) { for i in 0..self.len() { print!("{}", self[i]); } println!() }
    fn print_space_separate(&self) { for i in 0..self.len() { print!("{}", self[i]); if i != self.len()-1 { print!(" ") } } println!() }
    fn print_linebreak(&self) { for i in 0..self.len() { println!("{}", self[i]); } }
}

fn solve(){
    input! {
        h: usize,
        w: usize,
        m: usize,
        queries: [(u64, u64, u64); m]
    }

    // h => t = 1
    let mut h_last_query = vec![(0u64, 0u64, 1u64); h];
    let mut w_last_query = vec![(0u64, 0u64, 2u64); w];

    for (idx, &(t, a, x)) in queries.iter().enumerate() {
        match t {
            1 =>{
                h_last_query[(a-1) as usize] = ((idx + 1) as u64, x, 1);
            },
            2 => {
                w_last_query[(a-1) as usize] = ((idx + 1) as u64, x, 2);
            },
            _ => unreachable!()
        }
    }

    let mut last = vec![];
    for x in &h_last_query {
        last.push(*x);
    }

    for x in &w_last_query {
        last.push(*x)
    }

    last.sort_by_key(|x| Reverse(x.0));
    let mut ans = BTreeMap::new();

    let mut h_sum = 0;
    let mut w_sum = 0;

    for &(_, color, r) in &last {
        if r == 1 {
            h_sum += 1;

            if w as u64 != w_sum {
                *ans.entry(color).or_insert(0u64) += w as u64 - w_sum;
            }
        }else{
            w_sum += 1;

            if h as u64 != h_sum {
                *ans.entry(color).or_insert(0u64) += h as u64 - h_sum;
            }
        }
    }

    println!("{}", ans.len());
    for (k, v) in &ans {
        println!("{} {}", *k, *v);
    }

}

fn main() {
    // input! { i: usize }
    let mut i = 1;
    while i != 0 { solve(); i -= 1; }
}

Submission Info

Compile Error

warning: unused import: `itertools::Itertools`
  --> src/main.rs:15:5
   |
15 | use itertools::Itertools;
   |     ^^^^^^^^^^^^^^^^^^^^
   |
   = note: `#[warn(unused_imports)]` on by default

warning: unused import: `proconio::marker::Chars`
  --> src/main.rs:17:5
   |
17 | use proconio::marker::Chars;
   |     ^^^^^^^^^^^^^^^^^^^^^^^

warning: unused imports: `BinaryHeap`, `VecDeque`
  --> src/main.rs:18:24
   |
18 | use std::collections::{BinaryHeap, BTreeMap, VecDeque};
   |                        ^^^^^^^^^^            ^^^^^^^^

warning: static `INF` is never used
  --> src/main.rs:21:8
   |
21 | static INF: usize = 1e18 as usize;
   |        ^^^
   |
   = note: `#[warn(dead_code)]` on by default

Judge Result