結果

問題 No.2372 既視感
ユーザー rp523
提出日時 2023-07-08 00:32:54
言語 Rust
(1.83.0 + proconio)
結果
WA  
実行時間 -
コード長 3,007 bytes
コンパイル時間 16,601 ms
コンパイル使用メモリ 401,836 KB
実行使用メモリ 6,948 KB
最終ジャッジ日時 2024-07-21 20:54:30
合計ジャッジ時間 16,984 ms
ジャッジサーバーID
（参考情報） 		judge4 / judge1
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 3
other AC * 9 WA * 17
権限があれば一括ダウンロードができます

ソースコード

diff #
プレゼンテーションモードにする

#![allow(unused_macros, unused_imports, dead_code)]
use std::any::TypeId;
use std::cmp::{max, min, Ordering, Reverse};
use std::collections::{BTreeMap, BTreeSet, BinaryHeap, HashMap, HashSet, VecDeque};
use std::mem::swap;
use std::ops::{Add, AddAssign, Div, DivAssign, Mul, MulAssign, Neg, Rem, Sub, SubAssign};
mod procon_reader {
    use std::fmt::Debug;
    use std::io::Read;
    use std::str::FromStr;
    pub fn read<T: FromStr>() -> T
    where
        <T as FromStr>::Err: Debug,
    {
        let stdin = std::io::stdin();
        let mut stdin_lock = stdin.lock();
        let mut u8b: [u8; 1] = [0];
        loop {
            let mut buf: Vec<u8> = Vec::with_capacity(16);
            loop {
                let res = stdin_lock.read(&mut u8b);
                if res.unwrap_or(0) == 0 || u8b[0] <= b' ' {
                    break;
                } else {
                    buf.push(u8b[0]);
                }
            }
            if !buf.is_empty() {
                let ret = String::from_utf8(buf).unwrap();
                return ret.parse().unwrap();
            }
        }
    }
    pub fn read_vec<T: std::str::FromStr>(n: usize) -> Vec<T>
    where
        <T as FromStr>::Err: Debug,
    {
        (0..n).map(|_| read::<T>()).collect::<Vec<T>>()
    }
    pub fn read_vec_sub1(n: usize) -> Vec<usize> {
        (0..n).map(|_| read::<usize>() - 1).collect::<Vec<usize>>()
    }
    pub fn read_mat<T: std::str::FromStr>(h: usize, w: usize) -> Vec<Vec<T>>
    where
        <T as FromStr>::Err: Debug,
    {
        (0..h).map(|_| read_vec::<T>(w)).collect::<Vec<Vec<T>>>()
    }
}
use procon_reader::*;
//////////////////////////////////////////////////////////////////////////////////////
//////////////////////////////////////////////////////////////////////////////////////
fn main() {
    let mut que = VecDeque::new();
    let mut seen = BTreeMap::new();
    let n = read::<usize>();
    let k = read::<usize>();
    let q = read::<usize>();
    let mut ans =vec![];
    for _qi in 0..q {
        let t = read::<usize>();
        if t == 1 {
            let s = read::<String>();
            if que.len() >= n {
                let d = que.pop_front().unwrap();
                let rem = seen[&d];
                if rem == 1 {
                    seen.remove(&d);
                } else {
                    *seen.get_mut(&d).unwrap() -= 1;
                }
            }
            que.push_back(s.clone());
            *seen.entry(s).or_insert(0) += 1;
            continue;
        }
        let mut a = 0;
        let mut cum = 0;
        for _ in 0..6 {
            let t = read::<String>();
            let d = read::<usize>();
            let need = if seen.contains_key(&t) {
                min(d, k)
            } else {
                d
            };
            cum += need;
            if cum <= 60 {
                a += 1;
            }
        }
        ans.push(a);
    }
    eprintln!();
    for ans in ans {
        println!("{}", ans);
    }
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0