結果

問題 No.586 ダブルブッキング
ユーザー kenichikenichi
提出日時 2023-06-09 18:53:03
言語 Rust
(1.83.0 + proconio)
結果
AC  
実行時間 1 ms / 2,000 ms
コード長 3,845 bytes
コンパイル時間 12,379 ms
コンパイル使用メモリ 396,984 KB
実行使用メモリ 6,820 KB
最終ジャッジ日時 2025-01-01 23:29:00
合計ジャッジ時間 13,041 ms
ジャッジサーバーID
(参考情報)
judge1 / judge4
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
sample AC * 3
other AC * 5
権限があれば一括ダウンロードができます

ソースコード

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

use std::io::*;
use std::str::FromStr;
//use std::num;
//use std::cmp;
//use std::collections::VecDeque;
//use std::io::{self, BufRead};
fn main() {
let p1: usize = read();
let p2: usize = read();
let n: usize = read();
let mut p = vec![0; n];
let mut tmp = vec![0; 999];
let mut ans = 0;
for _i in 0..p.len(){
p[_i] = read();
tmp[p[_i] - 1] += 1;
}
for _i in 0..tmp.len(){
if tmp[_i] >= 1{
ans += tmp[_i] - 1;
}
}
print!("{}",(p1 + p2) * ans);
}
pub fn ctoi(c: char) -> isize {
let n = c as isize - '0' as isize;
return n;
}
pub fn stoi(c: String) -> isize {
let n = c.parse::<isize>().unwrap();
return n;
}
pub fn find_char(sentence: Vec<char>, target: char, start: isize) -> isize {
for _i in start as usize..sentence.len() {
if sentence[_i] == target {
return _i as isize;
}
}
return -1;
}
pub fn hex_to_binary(hex_string: &str, x: u32) -> Option<String> {
match i64::from_str_radix(hex_string, x) {
Ok(decimal) => Some(format!("{}", decimal)),
Err(_) => None,
}
}
pub fn my_floor(x: f64) -> f64 {
let rounded = (x * 1000.0).floor() / 1000.0;
rounded
}
pub fn upper_lower(x: char) -> char {
let result: char;
if x.is_uppercase() {
result = x.to_ascii_lowercase();
} else if x.is_lowercase() {
result = x.to_ascii_uppercase();
} else {
result = x;
}
result
}
pub fn maxf_2(x: f64, y: f64) -> f64 {
let result;
if x >= y {
result = x;
} else {
result = y;
}
result
}
pub fn max_2(x: isize, y: isize) -> isize {
let result;
if x >= y {
result = x;
} else {
result = y;
}
result
}
pub fn max_u_2(x: usize, y: usize) -> usize {
let result;
if x >= y {
result = x;
} else {
result = y;
}
result
}
pub fn min_2(x: isize, y: isize) -> isize {
let result;
if x >= y {
result = y;
} else {
result = x;
}
result
}
pub fn min_2_i32(x: i32, y: i32) -> i32 {
let result;
if x >= y {
result = y;
} else {
result = x;
}
result
}
pub fn max_3(x: isize, y: isize, z: isize) -> isize {
let result;
if x >= y && y >= z {
result = x;
} else if x >= z && z >= y {
result = x;
} else if y >= x && x >= z {
result = y;
} else if y >= z && z >= x {
result = y;
} else if z >= x && x >= y {
result = z;
} else {
result = z;
}
result
}
pub fn max_u_3(x: usize, y: usize, z: usize) -> usize {
let result;
if x >= y && y >= z {
result = x;
} else if x >= z && z >= y {
result = x;
} else if y >= x && x >= z {
result = y;
} else if y >= z && z >= x {
result = y;
} else if z >= x && x >= y {
result = z;
} else {
result = z;
}
result
}
pub fn min_3(x: usize, y: usize, z: usize) -> usize {
let result;
if x <= y && y <= z {
result = x;
} else if x <= z && z <= y {
result = x;
} else if y <= x && x <= z {
result = y;
} else if y <= z && z <= x {
result = y;
} else if z <= x && x <= y {
result = z;
} else {
result = z;
}
result
}
pub fn min_u_3(x: usize, y: usize, z: usize) -> usize {
let result;
if x <= y && y <= z {
result = x;
} else if x <= z && z <= y {
result = x;
} else if y <= x && x <= z {
result = y;
} else if y <= z && z <= x {
result = y;
} else if z <= x && x <= y {
result = z;
} else {
result = z;
}
result
}
pub fn read_text() -> String {
let mut word = String::new();
std::io::stdin().read_line(&mut word).ok();
let answer = word.trim().to_string();
answer
}
pub fn read_array() -> Vec<char> {
let array: String = read();
let chars: Vec<char> = array.trim().chars().collect::<Vec<char>>();
chars
}
pub fn read<T: FromStr>() -> T {
let stdin = stdin();
let stdin = stdin.lock();
let token: String = stdin
.bytes()
.map(|c| c.expect("failed to read char") as char)
.skip_while(|c| c.is_whitespace())
.take_while(|c| !c.is_whitespace())
.collect();
token.parse().ok().expect("failed to parse token")
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0