結果
問題 | No.1935 Water Simulation |
ユーザー | Moss_Local |
提出日時 | 2022-05-13 21:47:58 |
言語 | Rust (1.77.0 + proconio) |
結果 |
AC
|
実行時間 | 29 ms / 2,000 ms |
コード長 | 5,936 bytes |
コンパイル時間 | 15,111 ms |
コンパイル使用メモリ | 379,148 KB |
実行使用メモリ | 8,960 KB |
最終ジャッジ日時 | 2024-07-22 04:33:25 |
合計ジャッジ時間 | 15,851 ms |
ジャッジサーバーID (参考情報) |
judge1 / judge4 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 28 ms
8,960 KB |
testcase_01 | AC | 29 ms
8,960 KB |
testcase_02 | AC | 26 ms
8,960 KB |
testcase_03 | AC | 26 ms
8,832 KB |
testcase_04 | AC | 25 ms
8,832 KB |
testcase_05 | AC | 26 ms
8,960 KB |
testcase_06 | AC | 24 ms
8,832 KB |
testcase_07 | AC | 23 ms
8,832 KB |
testcase_08 | AC | 24 ms
8,832 KB |
testcase_09 | AC | 24 ms
8,832 KB |
testcase_10 | AC | 24 ms
8,832 KB |
testcase_11 | AC | 24 ms
8,832 KB |
testcase_12 | AC | 24 ms
8,832 KB |
testcase_13 | AC | 24 ms
8,832 KB |
testcase_14 | AC | 24 ms
8,832 KB |
testcase_15 | AC | 24 ms
8,832 KB |
testcase_16 | AC | 25 ms
8,832 KB |
testcase_17 | AC | 24 ms
8,704 KB |
testcase_18 | AC | 24 ms
8,832 KB |
testcase_19 | AC | 24 ms
8,832 KB |
testcase_20 | AC | 24 ms
8,832 KB |
testcase_21 | AC | 24 ms
8,832 KB |
testcase_22 | AC | 23 ms
8,832 KB |
testcase_23 | AC | 24 ms
8,832 KB |
testcase_24 | AC | 24 ms
8,704 KB |
testcase_25 | AC | 24 ms
8,704 KB |
testcase_26 | AC | 24 ms
8,960 KB |
testcase_27 | AC | 24 ms
8,832 KB |
testcase_28 | AC | 24 ms
8,832 KB |
testcase_29 | AC | 24 ms
8,832 KB |
testcase_30 | AC | 25 ms
8,960 KB |
testcase_31 | AC | 24 ms
8,832 KB |
コンパイルメッセージ
warning: unnecessary parentheses around type --> src/main.rs:73:15 | 73 | fn readi() -> (i64) { | ^ ^ | = note: `#[warn(unused_parens)]` on by default help: remove these parentheses | 73 - fn readi() -> (i64) { 73 + fn readi() -> i64 { | warning: unnecessary parentheses around `if` condition --> src/main.rs:218:12 | 218 | if (i != 0) { | ^ ^ | help: remove these parentheses | 218 - if (i != 0) { 218 + if i != 0 { |
ソースコード
// -*- coding:utf-8-unix -*- // #![feature(map_first_last)] #![allow(dead_code)] #![allow(unused_imports)] #![allow(unused_macros)] use std::any::Any; use std::cmp::Ordering::*; use std::collections::*; use std::convert::*; use std::convert::{From, Into}; use std::error::Error; use std::f64::consts::PI; use std::fmt::Debug; use std::fmt::Display; use std::fs::File; use std::hash::Hash; use std::io::prelude::*; use std::io::*; use std::iter::Filter; use std::marker::Copy; use std::mem::*; use std::ops::Bound::*; use std::ops::RangeBounds; use std::ops::{Add, Mul, Neg, Sub}; use std::process; use std::slice::from_raw_parts; use std::str; use std::vec; const INF: i64 = 1223372036854775807; const UINF: usize = INF as usize; // const FINF: f64 = 122337203685.0; const LINF: i64 = 2147483647; const FINF: f64 = LINF as f64; const INF128: i128 = 1223372036854775807000000000000; // const MOD: i64 = 1000000007; const MOD: i64 = 998244353; const UMOD: usize = MOD as usize; const MPI: f64 = 3.14159265358979323846264338327950288f64; // const MOD: i64 = INF; use std::cmp::*; use std::collections::*; use std::io::stdin; use std::io::stdout; use std::io::Write; macro_rules! p { ($x:expr) => { println!("{}", $x); }; } macro_rules! d { ($x:expr) => { println!("{:?}", $x); }; } fn main() { solve(); } // use str::Chars; #[allow(dead_code)] fn read<T: std::str::FromStr>() -> T { let mut s = String::new(); std::io::stdin().read_line(&mut s).ok(); s.trim().parse().ok().unwrap() } #[allow(dead_code)] fn readi() -> (i64) { let mut str = String::new(); let _ = stdin().read_line(&mut str).unwrap(); let mut iter = str.split_whitespace(); iter.next().unwrap().parse::<i64>().unwrap() } #[allow(dead_code)] fn read_vec<T: std::str::FromStr>() -> Vec<T> { read::<String>() .split_whitespace() .map(|e| e.parse().ok().unwrap()) .collect() } #[allow(dead_code)] fn read_mat<T: std::str::FromStr>(n: u32) -> Vec<Vec<T>> { (0..n).map(|_| read_vec()).collect() } #[allow(dead_code)] fn readii() -> (i64, i64) { let mut str = String::new(); let _ = stdin().read_line(&mut str).unwrap(); let mut iter = str.split_whitespace(); ( iter.next().unwrap().parse::<i64>().unwrap(), iter.next().unwrap().parse::<i64>().unwrap(), ) } fn readff() -> (f64, f64) { let mut str = String::new(); let _ = stdin().read_line(&mut str).unwrap(); let mut iter = str.split_whitespace(); ( iter.next().unwrap().parse::<f64>().unwrap(), iter.next().unwrap().parse::<f64>().unwrap(), ) } #[allow(dead_code)] fn readiii() -> (i64, i64, i64) { let mut str = String::new(); let _ = stdin().read_line(&mut str).unwrap(); let mut iter = str.split_whitespace(); ( iter.next().unwrap().parse::<i64>().unwrap(), iter.next().unwrap().parse::<i64>().unwrap(), iter.next().unwrap().parse::<i64>().unwrap(), ) } #[allow(dead_code)] fn readuu() -> (usize, usize) { let mut str = String::new(); let _ = stdin().read_line(&mut str).unwrap(); let mut iter = str.split_whitespace(); ( iter.next().unwrap().parse::<usize>().unwrap(), iter.next().unwrap().parse::<usize>().unwrap(), ) } fn readcc() -> (char, char) { let mut str = String::new(); let _ = stdin().read_line(&mut str).unwrap(); let mut iter = str.split_whitespace(); ( iter.next().unwrap().parse::<char>().unwrap(), iter.next().unwrap().parse::<char>().unwrap(), ) } fn readuuu() -> (usize, usize, usize) { let mut str = String::new(); let _ = stdin().read_line(&mut str).unwrap(); let mut iter = str.split_whitespace(); ( iter.next().unwrap().parse::<usize>().unwrap(), iter.next().unwrap().parse::<usize>().unwrap(), iter.next().unwrap().parse::<usize>().unwrap(), ) } #[allow(dead_code)] fn readiiii() -> (i64, i64, i64, i64) { let mut str = String::new(); let _ = stdin().read_line(&mut str).unwrap(); let mut iter = str.split_whitespace(); ( iter.next().unwrap().parse::<i64>().unwrap(), iter.next().unwrap().parse::<i64>().unwrap(), iter.next().unwrap().parse::<i64>().unwrap(), iter.next().unwrap().parse::<i64>().unwrap(), ) } #[allow(dead_code)] fn readuuuu() -> (usize, usize, usize, usize) { let mut str = String::new(); let _ = stdin().read_line(&mut str).unwrap(); let mut iter = str.split_whitespace(); ( iter.next().unwrap().parse::<usize>().unwrap(), iter.next().unwrap().parse::<usize>().unwrap(), iter.next().unwrap().parse::<usize>().unwrap(), iter.next().unwrap().parse::<usize>().unwrap(), ) } fn solve() { let mut vec: Vec<i64> = read_vec(); let n = vec.pop().unwrap(); let mut state = vec![]; let mut cur = vec![0; 4]; cur[0] = vec[0]; state.push(cur.clone()); let mut loop_str = UINF; let mut st = BTreeSet::new(); let mut st2 = BTreeSet::new(); st.insert((cur.clone(), 3)); let n = n as usize; for i in 0..100000 { let fr = i % 4; let to = (i + 1) % 4; let can_move = min(cur[fr], vec[to] - cur[to]); cur[fr] -= can_move; cur[to] += can_move; state.push(cur.clone()); if st.contains(&(cur.clone(), i % 4)) { st2.insert((cur.clone(), i % 4)); } if st.contains(&((cur.clone(), i % 4))) && loop_str == UINF { loop_str = i; } else { st.insert((cur.clone(), i % 4)); } } let len = st2.len(); let res = if n >= loop_str { state[(n - loop_str) % len + loop_str].clone() } else { state[n].clone() }; for i in 0..res.len() { if (i != 0) { print!(" "); } print!("{}", res[i]) } println!(); return; }