結果
問題 | No.2372 既視感 |
ユーザー |
|
提出日時 | 2023-07-07 21:41:24 |
言語 | Rust (1.83.0 + proconio) |
結果 |
AC
|
実行時間 | 9 ms / 2,000 ms |
コード長 | 2,459 bytes |
コンパイル時間 | 13,559 ms |
コンパイル使用メモリ | 378,448 KB |
実行使用メモリ | 5,376 KB |
最終ジャッジ日時 | 2024-07-21 17:28:03 |
合計ジャッジ時間 | 14,755 ms |
ジャッジサーバーID (参考情報) |
judge2 / judge1 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 26 |
ソースコード
pub mod scanner {pub struct Scanner {buf: Vec<String>,}impl Scanner {pub fn new() -> Self {Self { buf: vec![] }}pub fn new_from(source: &str) -> Self {let source = String::from(source);let buf = Self::split(source);Self { buf }}pub fn next<T: std::str::FromStr>(&mut self) -> T {loop {if let Some(x) = self.buf.pop() {return x.parse().ok().expect("");}let mut source = String::new();std::io::stdin().read_line(&mut source).expect("");self.buf = Self::split(source);}}fn split(source: String) -> Vec<String> {source.split_whitespace().rev().map(String::from).collect::<Vec<_>>()}}}use crate::scanner::Scanner;use std::io::Write;fn main() {let mut scanner = Scanner::new();let out = std::io::stdout();let mut out = std::io::BufWriter::new(out.lock());let t: usize = 1;for _ in 0..t {solve(&mut scanner, &mut out);}}fn solve(scanner: &mut Scanner, out: &mut std::io::BufWriter<std::io::StdoutLock>) {let n: usize = scanner.next();let k: usize = scanner.next();let q: usize = scanner.next();let mut a = vec![];for _ in 0..q {let t: usize = scanner.next();if t == 1 {let s: String = scanner.next();a.push(s);}if t == 2 {let td = (0..6).map(|_| (scanner.next::<String>(), scanner.next::<usize>())).collect::<Vec<_>>();let mut rem = 60;let mut now = 0;while now < 6 {let mut found = false;let l = if a.len() > n { a.len() - n } else { 0 };for i in l..a.len() {found |= a[i] == td[now].0;}let x = if found { k.min(td[now].1) } else { td[now].1 };if x <= rem {rem -= x;now += 1;} else {break;}}for i in 0..now {a.push(td[i].0.clone());}writeln!(out, "{}", now).unwrap();}}}