Submission #68515670
Source Code Expand
use library::utils::input::Input;
fn solve(ip: &mut Input) {
let s = ip.next::<String>();
let ans = match s.as_str() {
"red" => "SSS",
"blue" => "FFF",
"green" => "MMM",
_ => "Unknown",
};
println!("{}", ans);
}
fn main() {
static IS_MULTI_TEST_CASE :bool = false;
let mut ip = Input::new();
let t = if IS_MULTI_TEST_CASE {
ip.next::<usize>()
} else {
1
};
for _ in 0..t {
solve(&mut ip);
}
}
// ===== bundled library =====
pub mod library {
pub mod utils {
pub mod input {
use std::str::{from_utf8, FromStr};
pub struct Input {
buf: Vec<u8>,
pos: usize,
}
impl Input {
pub fn new() -> Self {
Self { buf: Vec::new(), pos: 0 }
}
pub fn next<T: FromStr>(&mut self) -> T {
while self.pos < self.buf.len()
&& self.buf[self.pos].is_ascii_whitespace()
{
self.pos += 1;
}
let start = self.pos;
while self.pos < self.buf.len()
&& !self.buf[self.pos].is_ascii_whitespace()
{
self.pos += 1;
}
if start == self.pos {
let mut input = String::new();
std::io::stdin()
.read_line(&mut input)
.expect("Failed to read line");
self.buf.clear();
self.buf.extend(input.as_bytes());
self.pos = 0;
return self.next();
}
from_utf8(&self.buf[start..self.pos])
.unwrap()
.parse::<T>()
.ok()
.expect(
&format!(
"Failed to parse input: {}", from_utf8(& self.buf[start
..self.pos]).unwrap()
),
)
}
#[allow(non_snake_case)]
pub fn vector<T: FromStr>(&mut self, n: usize) -> Vec<T> {
(0..n).map(|_| self.next()).collect()
}
pub fn graph(
&mut self,
n: usize,
m: usize,
is_one_way: bool,
) -> Vec<Vec<usize>> {
let mut graph = vec![Vec::new(); n];
for _ in 0..m {
let (u, v): (usize, usize) = self.pair();
graph[u - 1].push(v - 1);
if !is_one_way {
graph[v - 1].push(u - 1);
}
}
graph
}
pub fn weighted_graph<T: Copy + FromStr>(
&mut self,
n: usize,
m: usize,
is_one_way: bool,
is_one_based: bool,
) -> Vec<Vec<(usize, T)>> {
let mut graph = vec![Vec::new(); n];
for _ in 0..m {
let (u, v, w): (usize, usize, T) = self.triple();
let u = if is_one_based { u - 1 } else { u };
let v = if is_one_based { v - 1 } else { v };
graph[u].push((v, w));
if !is_one_way {
graph[v].push((u, w));
}
}
graph
}
pub fn pair<T: FromStr, U: FromStr>(&mut self) -> (T, U) {
(self.next(), self.next())
}
pub fn triple<T: FromStr, U: FromStr, V: FromStr>(
&mut self,
) -> (T, U, V) {
(self.next(), self.next(), self.next())
}
}
}
}
}
Submission Info
Submission Time |
|
Task |
A - AtCoder Language |
User |
ardRiriy |
Language |
Rust (rustc 1.70.0) |
Score |
100 |
Code Size |
4397 Byte |
Status |
AC |
Exec Time |
1 ms |
Memory |
2060 KiB |
Judge Result
Set Name |
Sample |
All |
Score / Max Score |
0 / 0 |
100 / 100 |
Status |
|
|
Set Name |
Test Cases |
Sample |
sample00.txt, sample01.txt |
All |
sample00.txt, sample01.txt, testcase00.txt, testcase01.txt, testcase02.txt, testcase03.txt, testcase04.txt, testcase05.txt, testcase06.txt, testcase07.txt, testcase08.txt, testcase09.txt, testcase10.txt, testcase11.txt, testcase12.txt |
Case Name |
Status |
Exec Time |
Memory |
sample00.txt |
AC |
1 ms |
1856 KiB |
sample01.txt |
AC |
1 ms |
1840 KiB |
testcase00.txt |
AC |
0 ms |
2060 KiB |
testcase01.txt |
AC |
1 ms |
1948 KiB |
testcase02.txt |
AC |
0 ms |
1900 KiB |
testcase03.txt |
AC |
0 ms |
1980 KiB |
testcase04.txt |
AC |
0 ms |
1884 KiB |
testcase05.txt |
AC |
0 ms |
1900 KiB |
testcase06.txt |
AC |
1 ms |
1884 KiB |
testcase07.txt |
AC |
0 ms |
1904 KiB |
testcase08.txt |
AC |
1 ms |
1992 KiB |
testcase09.txt |
AC |
1 ms |
1904 KiB |
testcase10.txt |
AC |
0 ms |
1884 KiB |
testcase11.txt |
AC |
1 ms |
1916 KiB |
testcase12.txt |
AC |
0 ms |
1836 KiB |