結果
問題 | No.1470 Mex Sum |
ユーザー | mai |
提出日時 | 2021-04-20 01:35:37 |
言語 | Rust (1.77.0) |
結果 |
AC
|
実行時間 | 27 ms / 2,000 ms |
コード長 | 2,447 bytes |
コンパイル時間 | 822 ms |
コンパイル使用メモリ | 154,192 KB |
実行使用メモリ | 14,524 KB |
最終ジャッジ日時 | 2023-09-17 08:35:34 |
合計ジャッジ時間 | 3,831 ms |
ジャッジサーバーID (参考情報) |
judge14 / judge13 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 1 ms
4,380 KB |
testcase_01 | AC | 1 ms
4,376 KB |
testcase_02 | AC | 3 ms
4,380 KB |
testcase_03 | AC | 4 ms
4,376 KB |
testcase_04 | AC | 4 ms
4,376 KB |
testcase_05 | AC | 3 ms
4,376 KB |
testcase_06 | AC | 4 ms
4,380 KB |
testcase_07 | AC | 3 ms
4,376 KB |
testcase_08 | AC | 3 ms
4,380 KB |
testcase_09 | AC | 3 ms
4,380 KB |
testcase_10 | AC | 3 ms
4,380 KB |
testcase_11 | AC | 3 ms
4,376 KB |
testcase_12 | AC | 25 ms
13,236 KB |
testcase_13 | AC | 26 ms
13,140 KB |
testcase_14 | AC | 26 ms
13,308 KB |
testcase_15 | AC | 26 ms
14,004 KB |
testcase_16 | AC | 25 ms
14,012 KB |
testcase_17 | AC | 25 ms
13,036 KB |
testcase_18 | AC | 25 ms
12,980 KB |
testcase_19 | AC | 25 ms
13,000 KB |
testcase_20 | AC | 25 ms
13,068 KB |
testcase_21 | AC | 27 ms
13,600 KB |
testcase_22 | AC | 27 ms
13,536 KB |
testcase_23 | AC | 26 ms
13,624 KB |
testcase_24 | AC | 26 ms
13,472 KB |
testcase_25 | AC | 26 ms
13,532 KB |
testcase_26 | AC | 26 ms
13,576 KB |
testcase_27 | AC | 26 ms
13,540 KB |
testcase_28 | AC | 26 ms
13,612 KB |
testcase_29 | AC | 26 ms
13,540 KB |
testcase_30 | AC | 26 ms
13,540 KB |
testcase_31 | AC | 26 ms
13,548 KB |
testcase_32 | AC | 26 ms
13,588 KB |
testcase_33 | AC | 26 ms
13,580 KB |
testcase_34 | AC | 26 ms
13,504 KB |
testcase_35 | AC | 26 ms
13,504 KB |
testcase_36 | AC | 25 ms
13,616 KB |
testcase_37 | AC | 23 ms
13,508 KB |
testcase_38 | AC | 23 ms
13,476 KB |
testcase_39 | AC | 23 ms
13,476 KB |
testcase_40 | AC | 23 ms
13,440 KB |
testcase_41 | AC | 24 ms
13,472 KB |
testcase_42 | AC | 24 ms
13,480 KB |
testcase_43 | AC | 23 ms
14,524 KB |
testcase_44 | AC | 24 ms
13,396 KB |
testcase_45 | AC | 23 ms
14,008 KB |
testcase_46 | AC | 24 ms
13,468 KB |
testcase_47 | AC | 24 ms
13,480 KB |
testcase_48 | AC | 23 ms
14,128 KB |
testcase_49 | AC | 24 ms
13,436 KB |
testcase_50 | AC | 24 ms
13,488 KB |
ソースコード
use std::collections::*; struct Scanner<R: std::io::BufRead> { stack: VecDeque<Vec<String>>, input: R, } impl<R: std::io::BufRead> Scanner<R> { fn new(input: R) -> Self { Self { stack: VecDeque::<Vec<String>>::new(), input: input, } } fn take(&mut self) -> Option<String> { while let Some(s) = self.stack.front_mut() { if let Some(t) = s.pop() { return Some(t); } self.stack.pop_front(); } self.enqueue_line(); if !self.stack.is_empty() { return self.take(); } None } fn enqueue(&mut self, t: String) { self.stack.push_back( t.trim() .split_ascii_whitespace() .map(|s| s.to_owned()) .rev() .collect(), ) } #[allow(unused)] fn enqueue_line(&mut self) { let mut t = String::new(); self.input.read_line(&mut t).ok(); self.enqueue(t); } #[allow(unused)] fn enqueue_to_end(&mut self) { let mut t = String::new(); self.input.read_to_string(&mut t).ok(); self.enqueue(t); } } #[allow(unused)] macro_rules! scan { ($io:expr => $t:ty) => { $io.take().unwrap().parse::<$t>().unwrap() }; ($io:expr => $t:tt * $n:expr) => ((0..$n).map(|_| scan!($io => $t)).collect::<Vec<_>>()); ($io:expr => $($t:tt),*) => (($(scan!($io => $t)),*)); } macro_rules! scan { ($io:expr => $t:ty) => { $io.take().unwrap().parse::<$t>().unwrap() }; ($io:expr => $t:tt * $n:expr) => ((0..$n).map(|_| scan!($io => $t)).collect::<Vec<_>>()); ($io:expr => $($t:tt),*) => (($(scan!($io => $t)),*)); } fn main() { solve(Scanner::<std::io::StdinLock>::new(std::io::stdin().lock())) } fn solve<R: std::io::BufRead>(mut cin: Scanner<R>) { let n = scan!(cin => i32); let aa = scan!(cin => i32 * n); let mut one = 0 as i64; let mut two = 0 as i64; let mut three = 0 as i64; for a in aa { match a { 1 => one += 1, 2 => two += 1, _ => three += 1, } } let mut total = 0; total += 2 * one * (one - 1) / 2; total += 1 * two * (two - 1) / 2; total += 1 * three * (three - 1) / 2; total += 3 * one * two; total += 2 * one * three; total += 1 * two * three; println!("{}", total); }