結果

問題 No.2372 既視感
ユーザー so-heyso-hey
提出日時 2023-07-08 00:12:45
言語 Rust
(1.83.0 + proconio)
結果
WA  
実行時間 -
コード長 2,232 bytes
コンパイル時間 11,608 ms
コンパイル使用メモリ 404,164 KB
実行使用メモリ 6,948 KB
最終ジャッジ日時 2024-07-21 20:36:39
合計ジャッジ時間 12,750 ms
ジャッジサーバーID
(参考情報)
judge4 / judge3
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
sample AC * 3
other AC * 5 WA * 21
権限があれば一括ダウンロードができます
コンパイルメッセージ
warning: unused variable: `n`
  --> src/main.rs:50:9
   |
50 |     let n: usize = scanner.next();
   |         ^ help: if this is intentional, prefix it with an underscore: `_n`
   |
   = note: `#[warn(unused_variables)]` on by default

ソースコード

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

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 que = VecDeque::new();
for _ in 0..q {
let p: usize = scanner.next();
if p == 1 {
let s: String = scanner.next();
que.push_back(s);
while que.len() > 5 {
que.pop_front();
}
} else {
let mut ans = (0, 0);
for _ in 0..6 {
let t: String = scanner.next();
let d: usize = scanner.next();
let mut time = d;
for past in que.clone() {
if past == t {
time = time.min(k);
}
}
if ans.0 + time <= 60 {
ans.0 += time;
ans.1 += 1;
que.push_back(t);
}
while que.len() > 5 {
que.pop_front();
}
}
println!("{}", ans.1);
}
}
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0