結果
問題 | No.1029 JJOOII 3 |
ユーザー | koba-e964 |
提出日時 | 2020-04-26 02:10:46 |
言語 | Rust (1.77.0 + proconio) |
結果 |
AC
|
実行時間 | 73 ms / 2,000 ms |
コード長 | 3,419 bytes |
コンパイル時間 | 2,207 ms |
コンパイル使用メモリ | 176,220 KB |
実行使用メモリ | 6,944 KB |
最終ジャッジ日時 | 2024-04-26 05:22:29 |
合計ジャッジ時間 | 4,348 ms |
ジャッジサーバーID (参考情報) |
judge1 / judge4 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 1 ms
6,812 KB |
testcase_01 | AC | 1 ms
6,944 KB |
testcase_02 | AC | 1 ms
6,944 KB |
testcase_03 | AC | 5 ms
6,944 KB |
testcase_04 | AC | 15 ms
6,940 KB |
testcase_05 | AC | 67 ms
6,940 KB |
testcase_06 | AC | 49 ms
6,944 KB |
testcase_07 | AC | 61 ms
6,940 KB |
testcase_08 | AC | 65 ms
6,940 KB |
testcase_09 | AC | 55 ms
6,940 KB |
testcase_10 | AC | 57 ms
6,944 KB |
testcase_11 | AC | 70 ms
6,940 KB |
testcase_12 | AC | 40 ms
6,940 KB |
testcase_13 | AC | 73 ms
6,940 KB |
testcase_14 | AC | 72 ms
6,940 KB |
testcase_15 | AC | 49 ms
6,940 KB |
testcase_16 | AC | 57 ms
6,940 KB |
testcase_17 | AC | 64 ms
6,940 KB |
testcase_18 | AC | 67 ms
6,940 KB |
testcase_19 | AC | 1 ms
6,940 KB |
testcase_20 | AC | 1 ms
6,944 KB |
testcase_21 | AC | 1 ms
6,940 KB |
testcase_22 | AC | 2 ms
6,940 KB |
testcase_23 | AC | 2 ms
6,944 KB |
testcase_24 | AC | 2 ms
6,940 KB |
testcase_25 | AC | 2 ms
6,940 KB |
testcase_26 | AC | 1 ms
6,940 KB |
testcase_27 | AC | 2 ms
6,940 KB |
testcase_28 | AC | 2 ms
6,940 KB |
testcase_29 | AC | 1 ms
6,940 KB |
testcase_30 | AC | 2 ms
6,944 KB |
testcase_31 | AC | 1 ms
6,940 KB |
testcase_32 | AC | 71 ms
6,944 KB |
testcase_33 | AC | 71 ms
6,940 KB |
testcase_34 | AC | 72 ms
6,940 KB |
testcase_35 | AC | 73 ms
6,940 KB |
testcase_36 | AC | 72 ms
6,940 KB |
testcase_37 | AC | 1 ms
6,940 KB |
testcase_38 | AC | 1 ms
6,940 KB |
testcase_39 | AC | 1 ms
6,944 KB |
testcase_40 | AC | 1 ms
6,944 KB |
ソースコード
#[allow(unused_imports)] use std::cmp::*; #[allow(unused_imports)] use std::collections::*; use std::io::{Write, BufWriter}; // https://qiita.com/tanakh/items/0ba42c7ca36cd29d0ac8 macro_rules! input { ($($r:tt)*) => { let stdin = std::io::stdin(); let mut bytes = std::io::Read::bytes(std::io::BufReader::new(stdin.lock())); let mut next = move || -> String{ bytes .by_ref() .map(|r|r.unwrap() as char) .skip_while(|c|c.is_whitespace()) .take_while(|c|!c.is_whitespace()) .collect() }; input_inner!{next, $($r)*} }; } macro_rules! input_inner { ($next:expr) => {}; ($next:expr, ) => {}; ($next:expr, $var:ident : $t:tt $($r:tt)*) => { let $var = read_value!($next, $t); input_inner!{$next $($r)*} }; } macro_rules! read_value { ($next:expr, ( $($t:tt),* )) => { ( $(read_value!($next, $t)),* ) }; ($next:expr, [ $t:tt ; $len:expr ]) => { (0..$len).map(|_| read_value!($next, $t)).collect::<Vec<_>>() }; ($next:expr, chars) => { read_value!($next, String).chars().collect::<Vec<char>>() }; ($next:expr, usize1) => { read_value!($next, usize) - 1 }; ($next:expr, [ $t:tt ]) => {{ let len = read_value!($next, usize); (0..len).map(|_| read_value!($next, $t)).collect::<Vec<_>>() }}; ($next:expr, $t:ty) => { $next().parse::<$t>().expect("Parse error") }; } #[allow(unused)] macro_rules! debug { ($($format:tt)*) => (write!(std::io::stderr(), $($format)*).unwrap()); } #[allow(unused)] macro_rules! debugln { ($($format:tt)*) => (writeln!(std::io::stderr(), $($format)*).unwrap()); } fn solve() { let out = std::io::stdout(); let mut out = BufWriter::new(out.lock()); macro_rules! puts { ($($format:tt)*) => (let _ = write!(out,$($format)*);); } input! { n: usize, k: usize, sc: [(chars, i64); n], } const INF: i64 = 1 << 50; let mut dp = vec![INF; 3 * k + 1]; let mut pre = vec![vec![0; n]; 3]; for i in 0..n { let (ref s, _c) = sc[i]; for j in 0..3 { let ch = ['J', 'O', 'I'][j]; pre[j][i] = s.iter().filter(|&&cc| cc == ch).count(); } } let mut target = vec!['+'; 3 * k]; for i in 0..3 { let c = ['J', 'O', 'I'][i]; for j in 0..k { target[i * k + j] = c; } } dp[0] = 0; for i in 0..3 * k { let ph = i / k; let idx = i % k; for j in 0..n { let (ref s, c) = sc[j]; if idx + pre[ph][j] < k { dp[i + pre[ph][j]] = min(dp[i + pre[ph][j]], dp[i] + c); } else { // full scan let mut pos = i; for &ch in s { if pos < 3 * k && ch == target[pos] { pos += 1; } } dp[pos] = min(dp[pos], dp[i] + c); } } } puts!("{}\n", if dp[3 * k] >= INF { -1 } else { dp[3 * k] }); } fn main() { // In order to avoid potential stack overflow, spawn a new thread. let stack_size = 104_857_600; // 100 MB let thd = std::thread::Builder::new().stack_size(stack_size); thd.spawn(|| solve()).unwrap().join().unwrap(); }