結果
問題 | No.2372 既視感 |
ユーザー |
|
提出日時 | 2023-07-08 00:22:38 |
言語 | Rust (1.83.0 + proconio) |
結果 |
AC
|
実行時間 | 65 ms / 2,000 ms |
コード長 | 2,399 bytes |
コンパイル時間 | 14,240 ms |
コンパイル使用メモリ | 388,296 KB |
実行使用メモリ | 6,948 KB |
最終ジャッジ日時 | 2024-07-21 20:46:02 |
合計ジャッジ時間 | 13,694 ms |
ジャッジサーバーID (参考情報) |
judge5 / judge3 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
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::collections::*;fn main() {let mut scanner = Scanner::new();let t = 1;for _ in 0..t {solve(&mut scanner);}}fn solve(scanner: &mut Scanner) {let n: usize = scanner.next();let k: usize = scanner.next();let q: usize = scanner.next();let mut que1 = VecDeque::new();for _ in 0..q {let p: usize = scanner.next();if p == 1 {let s: String = scanner.next();que1.push_back(s);} else {let mut ans = (0, 0);let mut flag = true;let mut que2 = VecDeque::new();for _ in 0..6 {let t: String = scanner.next();let d: usize = scanner.next();let mut time = d;for past in que1.clone() {if past == t {time = time.min(k);break;}}if ans.0 + time <= 60 && flag {ans.0 += time;ans.1 += 1;que2.push_back(t);} else {flag = false;}}println!("{}", ans.1);for past in que2.clone() {que1.push_back(past);}}while que1.len() > n {que1.pop_front();}}}