結果
問題 | No.1489 Repeat Cumulative Sum |
ユーザー |
|
提出日時 | 2021-10-06 09:46:48 |
言語 | Rust (1.83.0 + proconio) |
結果 |
RE
|
実行時間 | - |
コード長 | 2,413 bytes |
コンパイル時間 | 12,271 ms |
コンパイル使用メモリ | 401,772 KB |
実行使用メモリ | 6,948 KB |
最終ジャッジ日時 | 2024-07-23 02:42:42 |
合計ジャッジ時間 | 16,178 ms |
ジャッジサーバーID (参考情報) |
judge3 / judge5 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | RE * 3 |
other | RE * 27 |
ソースコード
#[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); read_value!($next, [$t; len]) }}; ($next:expr, $t:ty) => ($next().parse::<$t>().expect("Parse error")); } trait Change { fn chmax(&mut self, x: Self); fn chmin(&mut self, x: Self); } impl<T: PartialOrd> Change for T { fn chmax(&mut self, x: T) { if *self < x { *self = x; } } fn chmin(&mut self, x: T) { if *self > x { *self = x; } } } fn main() { 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, t: usize, _c: [[i64; n]; t], } let ops = n * (n - 1) / 2 * 5 + 2; puts!("{}\n", ops); for i in 0..n { for j in i + 1..n { // Whenever we find (0, 1), we replace it with (1, 0). puts!("UPD {} 1\n", n); puts!("XOR {} {} {}\n", n, n, i); puts!("AND {} {} {}\n", n, n, j); puts!("XOR {} {} {}\n", i, i, n); puts!("XOR {} {} {}\n", j, j, n); } } puts!("UPD {} 0\n", n); puts!("XOR {} {} {}\n", n, n, k - 1); }