結果

問題 No.2306 [Cherry 5th Tune C] ウソツキタマシイ
ユーザー kenichi
提出日時 2023-07-18 16:19:03
言語 Rust
(1.83.0 + proconio)
結果
AC  
実行時間 162 ms / 2,000 ms
コード長 6,822 bytes
コンパイル時間 13,202 ms
コンパイル使用メモリ 392,136 KB
実行使用メモリ 8,320 KB
最終ジャッジ日時 2024-09-18 15:35:17
合計ジャッジ時間 17,550 ms
ジャッジサーバーID
(参考情報)
judge4 / judge3
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
other AC * 30
権限があれば一括ダウンロードができます

ソースコード

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

//use std::io::*;
//use std::str::FromStr;
/*
const LOW_CASE_ALPHABET: [char; 26] = [
'a', 'b', 'c', 'd', 'e', 'f', 'g', 'h', 'i', 'j', 'k', 'l', 'm', 'n', 'o', 'p', 'q', 'r', 's',
't', 'u', 'v', 'w', 'x', 'y', 'z',
];
*/
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;
fn main() {
let mut scanner = Scanner::new();
let t: usize = 1;
for _ in 0..t {
solve(&mut scanner);
}
}
fn solve(scanner: &mut Scanner) {
let _n: usize = scanner.next();
let m: usize = scanner.next();
let mut now: usize = 0;
let mut a: Vec<usize> = (0..m)
.map(|_| {
let x = scanner.next::<usize>();
now += x * x;
x
})
.collect();
let q: usize = scanner.next();
for _ in 0..q {
let c: usize = scanner.next::<usize>() - 1;
let k: usize = scanner.next::<usize>();
let d: usize = scanner.next::<usize>() - 1;
now -= a[c] * a[c];
now -= a[d] * a[d];
a[c] -= k;
a[d] += k;
now += a[c] * a[c];
now += a[d] * a[d];
println!("{}", now);
}
}
/*
pub fn quicksort(numbers: &mut Vec<u64>) {
if numbers.len() <= 1 {
return;
}
let pivot = numbers.pop().unwrap();
let mut lesser = Vec::new();
let mut greater = Vec::new();
for num in numbers.iter() {
if *num >= pivot {
lesser.push(*num);
} else {
greater.push(*num);
}
}
quicksort(&mut lesser);
quicksort(&mut greater);
numbers.clear();
numbers.extend(lesser);
numbers.push(pivot);
numbers.extend(greater);
}
pub fn is_leap_year(year: isize) -> bool {
if ((year % 4 == 0) && (year % 100 != 0)) || (year % 400 == 0) {
return true;
} else {
return false;
}
}
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_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: 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 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