Submission #70592281
Source Code Expand
#![allow(unused_parens)]
#![allow(unused_imports)]
#![allow(non_upper_case_globals)]
#![allow(non_snake_case)]
#![allow(unused_mut)]
#![allow(unused_variables)]
#![allow(dead_code)]
#![allow(unused_macros)]
use itertools::Itertools;
use proconio::input;
use proconio::marker::{Chars, Usize1};
type Vec2<T> = Vec<Vec<T>>;
type Vec3<T> = Vec<Vec<Vec<T>>>;
#[rustfmt::skip]
macro_rules ! max { ( $x : expr ) => ( $x ) ; ( $x : expr , $ ( $xs : expr ) ,+ ) => { { std :: cmp :: max ( $x , max! ( $ ( $xs ) ,+ ) ) } } ; }
#[rustfmt::skip]
macro_rules ! min { ( $x : expr ) => ( $x ) ; ( $x : expr , $ ( $xs : expr ) ,+ ) => { { std :: cmp :: min ( $x , min! ( $ ( $xs ) ,+ ) ) } } ; }
#[rustfmt::skip]
macro_rules! chmin { ($a:expr, $($b:expr),+) => {{ let d = min!($($b),+); if $a > d { $a = d; true } else { false } }}; }
#[rustfmt::skip]
macro_rules! chmax { ($a:expr, $($b:expr),+) => {{ let d = max!($($b),+); if $a < d { $a = d; true } else { false } }};}
#[rustfmt::skip]
macro_rules! chadd { ($a:expr, $b:expr) => {{ $a = $a + $b; }};}
#[rustfmt::skip]
macro_rules! chsub { ($a:expr, $b:expr) => {{ $a = $a - $b; }};}
#[rustfmt::skip]
macro_rules! chmul { ($a:expr, $b:expr) => {{ $a = $a * $b; }};}
#[cfg(debug_assertions)]
macro_rules! mydbg {
//($arg:expr) => (dbg!($arg))
//($arg:expr) => (println!("{:?}",$arg));
($($a:expr),*) => {
eprintln!(concat!($(stringify!($a), " = {:?}, "),*), $($a),*);
}
}
#[cfg(not(debug_assertions))]
macro_rules! mydbg {
($($arg:expr),*) => {};
}
macro_rules! echo {
($($a:expr),*) => {
$(println!("{}",$a))*
}
}
macro_rules! multivec {
($a:expr;$b:expr) => {
vec![$a; $b]
};
($a:expr;$b:expr;$($c:expr);+) => {
multivec![vec![$a;$b];$($c);+]
};
}
use std::cmp::*;
use std::collections::*;
use std::ops::{Add, Div, Mul, Rem, Sub};
fn echoNoReturn() {
echo!("No");
std::process::exit(0);
}
fn echoYesReturn() {
echo!("Yes");
std::process::exit(0);
}
fn echoNo() {
echo!("No");
}
fn echoYes() {
echo!("Yes");
}
#[allow(dead_code)]
static INF_I64: i64 = 92233720368547758;
#[allow(dead_code)]
static INF_I32: i32 = 21474836;
#[allow(dead_code)]
static INF_USIZE: usize = 18446744073709551;
#[allow(dead_code)]
static M_O_D: usize = 1000000007;
#[allow(dead_code)]
static PAI: f64 = 3.1415926535897932;
trait IteratorExt: Iterator {
fn toVec(self) -> Vec<Self::Item>;
}
impl<T: Iterator> IteratorExt for T {
fn toVec(self) -> Vec<Self::Item> {
self.collect()
}
}
fn sin(a: f64) -> f64 {
a.sin()
}
fn cos(a: f64) -> f64 {
a.cos()
}
trait ToNum {
fn toNum(&self) -> Vec<usize>;
}
impl ToNum for Vec<char> {
fn toNum(&self) -> Vec<usize> {
if self[0].is_ascii_digit() {
self.iter().map(|x| x.toNumIndex()).toVec()
} else {
self.iter().map(|x| x.toAlphabetIndex()).toVec()
}
}
}
trait CharExt {
fn toNum(&self) -> usize;
fn toAlphabetIndex(&self) -> usize;
fn toNumIndex(&self) -> usize;
}
impl CharExt for char {
fn toNum(&self) -> usize {
return *self as usize;
}
fn toAlphabetIndex(&self) -> usize {
return self.toNum() - 'a' as usize;
}
fn toNumIndex(&self) -> usize {
return self.toNum() - '0' as usize;
}
}
trait PrimeNumber:
Copy
+ Ord
+ Add<Output = Self>
+ Sub<Output = Self>
+ Mul<Output = Self>
+ Div<Output = Self>
+ Rem<Output = Self>
{
fn is_odd(self) -> bool;
fn is_even(self) -> bool;
fn pow(self, exp: u32) -> Self;
}
macro_rules! impl_prim_int(($($ty:ty),*) => {
$(
impl PrimeNumber for $ty {
fn pow(self, exp: u32) -> Self {
self.pow(exp)
}
fn is_odd(self)->bool{
self & 1==1
}
fn is_even(self)->bool{
self & 1==0
}
}
)*
});
trait SafeRangeContain {
fn safe_contains(&self, x: i64) -> bool;
}
impl SafeRangeContain for std::ops::Range<usize> {
fn safe_contains(&self, x: i64) -> bool {
if x < 0 {
return false;
}
return self.contains(&(x as usize));
}
}
impl_prim_int!(
u8, u16, u32, u64, u128, usize, i8, i16, i32, i64, i128, isize
);
trait VectorExt {
fn joinToString(&self, s: &str) -> String;
}
impl<T: ToString> VectorExt for Vec<T> {
fn joinToString(&self, s: &str) -> String {
return self
.iter()
.map(|x| x.to_string())
.collect::<Vec<_>>()
.join(s);
}
}
trait StringExt {
fn get_reverse(&self) -> String;
}
impl StringExt for String {
fn get_reverse(&self) -> String {
self.chars().rev().collect::<String>()
}
}
trait UsizeExt {
fn pow(&self, n: usize) -> usize;
}
impl UsizeExt for usize {
fn pow(&self, n: usize) -> usize {
return ((*self as u64).pow(n as u32)) as usize;
}
}
use itertools_num::ItertoolsNum as _;
use superslice::*;
fn main() {
input! {
a:usize,
b:usize,
c:usize,
d:usize,
}
let mut flag = true;
if c >= a && d < b {
flag = false;
}
if flag {
echo!("No");
} else {
echo!("Yes");
}
}
Submission Info
| Submission Time |
|
| Task |
A - Candy Cookie Law |
| User |
bqn |
| Language |
Rust (rustc 1.89.0) |
| Score |
100 |
| Code Size |
5681 Byte |
| Status |
AC |
| Exec Time |
1 ms |
| Memory |
2116 KiB |
Judge Result
| Set Name |
Sample |
All |
| Score / Max Score |
0 / 0 |
100 / 100 |
| Status |
|
|
| Set Name |
Test Cases |
| Sample |
sample_01.txt, sample_02.txt, sample_03.txt |
| All |
random_01.txt, random_02.txt, random_03.txt, random_04.txt, random_05.txt, random_06.txt, random_07.txt, random_08.txt, random_09.txt, sample_01.txt, sample_02.txt, sample_03.txt |
| Case Name |
Status |
Exec Time |
Memory |
| random_01.txt |
AC |
1 ms |
1988 KiB |
| random_02.txt |
AC |
0 ms |
1876 KiB |
| random_03.txt |
AC |
0 ms |
1972 KiB |
| random_04.txt |
AC |
1 ms |
1964 KiB |
| random_05.txt |
AC |
0 ms |
1812 KiB |
| random_06.txt |
AC |
0 ms |
2056 KiB |
| random_07.txt |
AC |
0 ms |
1840 KiB |
| random_08.txt |
AC |
0 ms |
1820 KiB |
| random_09.txt |
AC |
1 ms |
2020 KiB |
| sample_01.txt |
AC |
0 ms |
1940 KiB |
| sample_02.txt |
AC |
0 ms |
2116 KiB |
| sample_03.txt |
AC |
0 ms |
1924 KiB |