結果

問題 No.692 square1001 and Permutation 1
ユーザー くれちー
提出日時 2018-06-08 22:21:40
言語 Rust
(1.83.0 + proconio)
結果
AC  
実行時間 1 ms / 2,000 ms
コード長 4,415 bytes
コンパイル時間 12,957 ms
コンパイル使用メモリ 402,452 KB
実行使用メモリ 6,944 KB
最終ジャッジ日時 2024-06-30 10:45:07
合計ジャッジ時間 13,197 ms
ジャッジサーバーID
(参考情報)
judge1 / judge4
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
sample AC * 3
other AC * 5
権限があれば一括ダウンロードができます

ソースコード

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

fn solve<R: BufRead, W: Write>(_reader: R, _writer: &mut W) {
let mut _scanner = Scanner::new(_reader);
#[allow(unused_macros)]
macro_rules! scan {
($t:ty) => {
_scanner.next::<$t>().unwrap()
};
($($t:ty),+) => {
($(scan!($t)),+)
};
($t:ty; $n:expr) => {
scan_iter!($t; $n).collect::<Vec<_>>()
};
($t_0:ty, $t_1:ty; $n:expr) => {
scan!($t_0 = 0, $t_1 = 1; $n)
};
($t_0:ty, $t_1:ty, $t_2:ty; $n:expr) => {
scan!($t_0 = 0, $t_1 = 1, $t_2 = 2; $n)
};
($($t:ty = $i:tt),+; $n:expr) => {{
let mut vecs = ($(Vec::<$t>::with_capacity($n)),+);
for _ in 0..$n {$(
vecs.$i.push(scan!($t));
)+}
vecs
}};
}
#[allow(unused_macros)]
macro_rules! scan_iter {
($t:ty; $n:expr) => {
_scanner.take::<$t>($n).map(|x| x.unwrap())
};
}
#[allow(unused_macros)]
macro_rules! print {
($fmt:expr) => {
write!(_writer, $fmt).unwrap()
};
($fmt:expr, $($arg:tt)*) => {
write!(_writer, $fmt, $($arg)*).unwrap()
};
}
#[allow(unused_macros)]
macro_rules! println {
() => {
writeln!(_writer).unwrap()
};
($fmt:expr) => {
writeln!(_writer, $fmt).unwrap()
};
($fmt:expr, $($arg:tt)*) => {
writeln!(_writer, $fmt, $($arg)*).unwrap()
};
}
let n = scan!(usize);
println!("{}", if n == 1 { "square1001" } else { "Petr" });
}
fn main() {
let stdin = stdin();
let stdout = stdout();
#[cfg(debug_assertions)]
let mut writer = stdout.lock();
#[cfg(not(debug_assertions))]
let mut writer = ::std::io::BufWriter::new(stdout.lock());
solve(stdin.lock(), &mut writer);
writer.flush().unwrap();
}
use io::Scanner;
use std::io::{stdin, stdout, BufRead, Write};
pub mod io {
pub use self::scanner::*;
mod scanner {
use std::io::BufRead;
use std::marker::PhantomData;
use std::str::{from_utf8, FromStr};
pub struct Scanner<R> {
reader: R,
buffer: Vec<u8>,
position: usize,
}
impl<R: BufRead> Scanner<R> {
pub fn new(reader: R) -> Self {
Scanner { reader: reader, buffer: vec![], position: 0 }
}
pub fn next<T: Parse>(&mut self) -> Option<T> {
Parse::parse(self.next_bytes().unwrap_or(&[]))
}
pub fn take<T: Parse>(&mut self, n: usize) -> Take<R, T> {
Take { scanner: self, n: n, _marker: PhantomData }
}
pub fn next_bytes(&mut self) -> Option<&[u8]> {
if self.buffer.is_empty() {
self.read_line();
}
loop {
match self.buffer.get(self.position) {
Some(&b' ') => self.position += 1,
Some(&b'\n') => self.read_line(),
Some(_) => break,
None => return None,
}
}
let start = self.position;
loop {
match self.buffer.get(self.position) {
Some(&b' ') | Some(&b'\n') | None => break,
Some(_) => self.position += 1,
}
}
Some(&self.buffer[start..self.position])
}
fn read_line(&mut self) {
self.position = 0;
self.buffer.clear();
self.reader.read_until(b'\n', &mut self.buffer).unwrap();
}
}
pub struct Take<'a, R: 'a, T> {
scanner: &'a mut Scanner<R>,
n: usize,
_marker: PhantomData<fn() -> T>,
}
impl<'a, R: BufRead, T: Parse> Iterator for Take<'a, R, T> {
type Item = Option<T>;
fn next(&mut self) -> Option<Self::Item> {
if self.n > 0 {
self.n -= 1;
Some(self.scanner.next())
} else {
None
}
}
fn size_hint(&self) -> (usize, Option<usize>) {
(self.n, Some(self.n))
}
}
impl<'a, R: BufRead, T: Parse> ExactSizeIterator for Take<'a, R, T> {}
pub trait Parse: Sized {
fn parse(bytes: &[u8]) -> Option<Self>;
}
impl Parse for u8 {
fn parse(bytes: &[u8]) -> Option<Self> {
if bytes.len() == 1 {
Some(*unsafe { bytes.get_unchecked(0) })
} else {
None
}
}
}
macro_rules! parse_impl {
($($t:ident)+) => {$(
impl Parse for $t {
fn parse(bytes: &[u8]) -> Option<Self> {
from_utf8(bytes).ok().and_then(|s| $t::from_str(s).ok())
}
}
)+};
}
parse_impl! { i32 i64 isize u32 u64 usize String }
}
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0