結果

問題 No.1650 Moving Coins
ユーザー manta1130
提出日時 2021-08-20 22:14:44
言語 Rust
(1.83.0 + proconio)
結果
WA  
実行時間 -
コード長 6,242 bytes
コンパイル時間 13,703 ms
コンパイル使用メモリ 378,592 KB
実行使用メモリ 11,516 KB
最終ジャッジ日時 2024-10-14 04:02:01
合計ジャッジ時間 17,311 ms
ジャッジサーバーID
(参考情報)
judge5 / judge4
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
sample AC * 3
other AC * 6 WA * 18
権限があれば一括ダウンロードができます

ソースコード

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

#[allow(unused_imports)]
use std::io::{stdout, BufWriter, Write};
fn main() {
let out = stdout();
let mut out = BufWriter::new(out.lock());
inputv! {
n:usize,
}
let mut a = input_vector::<i64>();
let mut b = input_vector::<i64>();
a.insert(0, -999);
b.insert(0, -999);
a.push(1 << 60);
b.push(1 << 60);
let mut ans = vec![];
for f in 1..=n {
if a[f] < b[f] && a[f] + 1 != a[f + 1] {
a[f] += 1;
ans.push((f, 'R'));
} else if a[f] > b[f] && a[f] - 1 != a[f - 1] {
a[f] -= 1;
ans.push((f, 'L'));
}
}
for t in (1..=n).rev() {
if a[t] < b[t] && a[t] + 1 != a[t + 1] {
a[t] += 1;
ans.push((t, 'R'));
} else if a[t] > b[t] && a[t] - 1 != a[t - 1] {
a[t] -= 1;
ans.push((t, 'L'));
}
}
for f in (1..=n).rev() {
if a[f] < b[f] && a[f] + 1 != a[f + 1] {
a[f] += 1;
ans.push((f, 'R'));
} else if a[f] > b[f] && a[f] - 1 != a[f - 1] {
a[f] -= 1;
ans.push((f, 'L'));
}
}
for t in 1..=n {
if a[t] < b[t] && a[t] + 1 != a[t + 1] {
a[t] += 1;
ans.push((t, 'R'));
} else if a[t] > b[t] && a[t] - 1 != a[t - 1] {
a[t] -= 1;
ans.push((t, 'L'));
}
}
for f in 1..=n {
if a[f] < b[f] && a[f] + 1 != a[f + 1] {
a[f] += 1;
ans.push((f, 'R'));
} else if a[f] > b[f] && a[f] - 1 != a[f - 1] {
a[f] -= 1;
ans.push((f, 'L'));
}
}
for t in (1..=n).rev() {
if a[t] < b[t] && a[t] + 1 != a[t + 1] {
a[t] += 1;
ans.push((t, 'R'));
} else if a[t] > b[t] && a[t] - 1 != a[t - 1] {
a[t] -= 1;
ans.push((t, 'L'));
}
}
writeln!(out, "{}", ans.len()).unwrap();
for (i, j) in ans {
writeln!(out, "{} {}", i, j).unwrap();
}
}
//https://github.com/manta1130/competitive-template-rs
use input::*;
pub mod input {
use std::cell::RefCell;
use std::io;
pub const SPLIT_DELIMITER: char = ' ';
pub use std::io::prelude::*;
thread_local! {
pub static INPUT_BUFFER:RefCell<std::collections::VecDeque<String>>=RefCell::new(std::collections::VecDeque::new());
}
#[macro_export]
macro_rules! input_internal {
($x:ident : $t:ty) => {
INPUT_BUFFER.with(|p| {
if p.borrow().len() == 0 {
let temp_str = input_line_str();
let mut split_result_iter = temp_str
.split(SPLIT_DELIMITER)
.map(|q| q.to_string())
.collect::<std::collections::VecDeque<_>>();
p.borrow_mut().append(&mut split_result_iter)
}
});
let mut buf_split_result = String::new();
INPUT_BUFFER.with(|p| buf_split_result = p.borrow_mut().pop_front().unwrap());
let $x: $t = buf_split_result.parse().unwrap();
};
(mut $x:ident : $t:ty) => {
INPUT_BUFFER.with(|p| {
if p.borrow().len() == 0 {
let temp_str = input_line_str();
let mut split_result_iter = temp_str
.split(SPLIT_DELIMITER)
.map(|q| q.to_string())
.collect::<std::collections::VecDeque<_>>();
p.borrow_mut().append(&mut split_result_iter)
}
});
let mut buf_split_result = String::new();
INPUT_BUFFER.with(|p| buf_split_result = p.borrow_mut().pop_front().unwrap());
let mut $x: $t = buf_split_result.parse().unwrap();
};
}
#[macro_export]
macro_rules! inputv {
($i:ident : $t:ty) => {
input_internal!{$i : $t}
};
(mut $i:ident : $t:ty) => {
input_internal!{mut $i : $t}
};
($i:ident : $t:ty $(,)*) => {
input_internal!{$i : $t}
};
(mut $i:ident : $t:ty $(,)*) => {
input_internal!{mut $i : $t}
};
(mut $i:ident : $t:ty,$($q:tt)*) => {
input_internal!{mut $i : $t}
inputv!{$($q)*}
};
($i:ident : $t:ty,$($q:tt)*) => {
input_internal!{$i : $t}
inputv!{$($q)*}
};
}
pub fn input_all() {
INPUT_BUFFER.with(|p| {
if p.borrow().len() == 0 {
let mut temp_str = String::new();
std::io::stdin().read_to_string(&mut temp_str).unwrap();
let mut split_result_iter = temp_str
.split_whitespace()
.map(|q| q.to_string())
.collect::<std::collections::VecDeque<_>>();
p.borrow_mut().append(&mut split_result_iter)
}
});
}
pub fn input_line_str() -> String {
let mut s = String::new();
io::stdin().read_line(&mut s).unwrap();
s.trim().to_string()
}
#[allow(clippy::match_wild_err_arm)]
pub fn input_vector<T>() -> Vec<T>
where
T: std::str::FromStr,
{
let mut v: Vec<T> = Vec::new();
let s = input_line_str();
let split_result = s.split(SPLIT_DELIMITER);
for z in split_result {
let buf = match z.parse() {
Ok(r) => r,
Err(_) => panic!("Parse Error",),
};
v.push(buf);
}
v
}
#[allow(clippy::match_wild_err_arm)]
pub fn input_vector_row<T>(n: usize) -> Vec<T>
where
T: std::str::FromStr,
{
let mut v = Vec::with_capacity(n);
for _ in 0..n {
let buf = match input_line_str().parse() {
Ok(r) => r,
Err(_) => panic!("Parse Error",),
};
v.push(buf);
}
v
}
pub trait ToCharVec {
fn to_charvec(&self) -> Vec<char>;
}
impl ToCharVec for String {
fn to_charvec(&self) -> Vec<char> {
self.to_string().chars().collect::<Vec<_>>()
}
}
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0