結果
問題 | No.2030 Googol Strings |
ユーザー | Moss_Local |
提出日時 | 2022-08-05 22:37:42 |
言語 | Rust (1.77.0 + proconio) |
結果 |
WA
|
実行時間 | - |
コード長 | 5,698 bytes |
コンパイル時間 | 14,278 ms |
コンパイル使用メモリ | 379,096 KB |
実行使用メモリ | 44,032 KB |
最終ジャッジ日時 | 2024-09-15 19:54:28 |
合計ジャッジ時間 | 15,714 ms |
ジャッジサーバーID (参考情報) |
judge6 / judge4 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 46 ms
5,248 KB |
testcase_01 | AC | 23 ms
5,248 KB |
testcase_02 | AC | 20 ms
8,152 KB |
testcase_03 | AC | 1 ms
5,376 KB |
testcase_04 | AC | 41 ms
5,376 KB |
testcase_05 | AC | 17 ms
5,376 KB |
testcase_06 | AC | 44 ms
33,620 KB |
testcase_07 | AC | 58 ms
44,032 KB |
testcase_08 | AC | 57 ms
43,988 KB |
testcase_09 | AC | 26 ms
5,376 KB |
testcase_10 | AC | 27 ms
5,376 KB |
testcase_11 | AC | 26 ms
5,376 KB |
testcase_12 | AC | 46 ms
5,376 KB |
testcase_13 | WA | - |
testcase_14 | WA | - |
testcase_15 | WA | - |
testcase_16 | AC | 63 ms
7,776 KB |
コンパイルメッセージ
warning: unnecessary parentheses around type --> src/main.rs:71:15 | 71 | fn readi() -> (i64) { | ^ ^ | = note: `#[warn(unused_parens)]` on by default help: remove these parentheses | 71 - fn readi() -> (i64) { 71 + fn readi() -> i64 { | warning: unused variable: `i` --> src/main.rs:227:9 | 227 | for i in 0..n { | ^ help: if this is intentional, prefix it with an underscore: `_i` | = note: `#[warn(unused_variables)]` on by default
ソースコード
// -*- 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::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::iter::FromIterator; use std::marker::Copy; use std::mem::*; use std::ops::BitAnd; 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 LINF: i64 = 2147483647; const INF128: i128 = 1223372036854775807000000000000; // const MOD: i64 = 1000000007; const MOD: i64 = 998244353; const UMOD: usize = MOD as usize; const M_PI: f64 = 3.14159265358979323846; // 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(), ) } #[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(), ) } pub struct Rheap { heap: BinaryHeap<Reverse<i64>>, } impl Rheap { // 0 <= size <= 10^8 is constrained. pub fn new() -> Self { Self { heap: BinaryHeap::new(), } } pub fn push(&mut self, x: i64) { self.heap.push(Reverse(x)); } pub fn peak(&mut self) -> i64 { let Reverse(x) = self.heap.peek().unwrap(); *x } pub fn pop(&mut self) -> Option<i64> { let x = self.heap.pop(); if x == None { return None; } let Reverse(x) = x.unwrap(); return Some(x); } } fn solve_part() { let s: String = read(); let mut v: Vec<char> = s.chars().collect(); let s: String = read(); let mut v2: Vec<char> = s.chars().collect(); for i in 0..v.len() { v.push(v[i]); } for i in 0..v2.len() { v2.push(v2[i]); } for i in 0..v.len() { v.push(v[i]); } for i in 0..v2.len() { v2.push(v2[i]); } let s1 = v.iter().collect::<String>(); let s2 = v2.iter().collect::<String>(); if s1 > s2 { p!("X"); } else { p!("Y"); } return; } fn solve() { let n: usize = read(); for i in 0..n { solve_part(); } return; }