Submission #3924420
Source Code Expand
#[allow(unused_imports)]
use std::cmp::{min,max};
#[allow(unused_imports)]
use std::collections::{BTreeMap,BTreeSet};
#[allow(unused_imports)]
use std::ops::*;
#[allow(unused_imports)]
use std::collections::BinaryHeap;
#[allow(unused_macros)]
macro_rules! ite {
($c:expr, $t:expr, $f:expr) => {{
if $c { $t } else { $f }
}};
}
// ref: tanakh <https://qiita.com/tanakh/items/0ba42c7ca36cd29d0ac8>
// diff: using Parser
#[macro_export]
macro_rules! input {
(source = $s:expr, $($r:tt)*) => {
let mut parser = Parser::from_str($s);
input_inner!{parser, $($r)*}
};
(parser = $parser:ident, $($r:tt)*) => {
input_inner!{$parser, $($r)*}
};
(new_stdin_parser = $parser:ident, $($r:tt)*) => {
let stdin = std::io::stdin();
let reader = std::io::BufReader::new(stdin.lock());
let mut $parser = Parser::new(reader);
input_inner!{$parser, $($r)*}
};
($($r:tt)*) => {
input!{new_stdin_parser = parser, $($r)*}
};
}
#[macro_export]
macro_rules! input_inner {
($parser:ident) => {};
($parser:ident, ) => {};
($parser:ident, $var:ident : $t:tt $($r:tt)*) => {
let $var = read_value!($parser, $t);
input_inner!{$parser $($r)*}
};
}
#[macro_export]
macro_rules! read_value {
($parser:ident, ( $($t:tt),* )) => {
( $(read_value!($parser, $t)),* )
};
($parser:ident, [ $t:tt ; $len:expr ]) => {
(0..$len).map(|_| read_value!($parser, $t)).collect::<Vec<_>>()
};
($parser:ident, chars) => {
read_value!($parser, String).chars().collect::<Vec<char>>()
};
($parser:ident, usize1) => {
read_value!($parser, usize) - 1
};
($parser:ident, $t:ty) => {
$parser.next::<$t>().expect("Parse error")
};
}
fn main() {
input! {
s: chars,
m: usize,
}
let n = s.len();
let mut xs = vec![];
for i in 0..n {
for k in i+1..min(n+1,i+5+1) {
xs.push(&s[i..k]);
}
}
xs.sort();
let mut t = 1;
for i in 1..xs.len() {
if t == m {
let mut ss = String::new();
for &c in xs[i-1].iter() {
ss.push(c);
}
println!("{}", ss);
return;
}
if xs[i-1] != xs[i] {
t += 1;
}
}
let mut ss = String::new();
for &c in xs[xs.len()-1].iter() {
ss.push(c);
}
println!("{}", ss);
}
use std::io::BufRead;
use std::io;
use std::str;
// ref: tatsuya6502 <https://qiita.com/tatsuya6502/items/cd448486f7ef7b5b8c7e>
// ref: wariuni <https://qiita.com/tatsuya6502/items/cd448486f7ef7b5b8c7e#comment-7040a5ae96305e884eb9>
// diff: using std::io::BufRead::fill_buf()
pub struct Parser<R> {
reader: R,
buf: Vec<u8>,
pos: usize,
}
impl Parser<io::Empty> {
pub fn from_str(s: &str) -> Parser<io::Empty> {
Parser {
reader: io::empty(),
buf: s.as_bytes().to_vec(),
pos: 0,
}
}
}
impl<R:BufRead> Parser<R> {
pub fn new(reader: R) -> Parser<R> {
Parser {
reader: reader,
buf: vec![],
pos: 0,
}
}
pub fn update_buf(&mut self) {
self.buf.clear();
self.pos = 0;
loop {
let (len,complete) = {
let buf2 = self.reader.fill_buf().unwrap();
self.buf.extend_from_slice(buf2);
let len = buf2.len();
(len, buf2[len-1] <= 0x20)
};
self.reader.consume(len);
if complete {
break;
}
}
}
pub fn next<T:str::FromStr>(&mut self) -> Result<T, T::Err> {
loop {
let mut begin = self.pos;
while begin < self.buf.len() && (self.buf[begin] <= 0x20) {
begin += 1;
}
let mut end = begin;
while end < self.buf.len() && (self.buf[end] > 0x20) {
end += 1;
}
if begin != self.buf.len() {
self.pos = end;
return str::from_utf8(&self.buf[begin..end]).unwrap().parse::<T>();
}
else {
self.update_buf();
}
}
}
}
use std::fmt::Display;
#[allow(dead_code)]
fn write_vec<T: Display>(xs: &Vec<T>) {
if xs.len() == 0 {
println!();
return;
}
print!("{}", xs[0]);
for i in 1..xs.len() {
print!(" {}", xs[i]);
}
println!();
}
Submission Info
Submission Time |
|
Task |
C - K-th Substring |
User |
spica314 |
Language |
Rust (1.15.1) |
Score |
300 |
Code Size |
4732 Byte |
Status |
AC |
Exec Time |
4 ms |
Memory |
4352 KB |
Judge Result
Set Name |
Sample |
Subtask |
All |
Score / Max Score |
0 / 0 |
200 / 200 |
100 / 100 |
Status |
|
|
|
Set Name |
Test Cases |
Sample |
0_000.txt, 0_001.txt, 0_002.txt |
Subtask |
0_000.txt, 0_001.txt, 0_002.txt, 1_003.txt, 1_004.txt, 1_005.txt, 1_006.txt, 1_007.txt, 1_008.txt, 1_009.txt, 1_010.txt |
All |
0_000.txt, 0_001.txt, 0_002.txt, 1_003.txt, 1_004.txt, 1_005.txt, 1_006.txt, 1_007.txt, 1_008.txt, 1_009.txt, 1_010.txt, 2_011.txt, 2_012.txt, 2_013.txt, 2_014.txt, 2_015.txt, 2_016.txt, 2_017.txt, 2_018.txt |
Case Name |
Status |
Exec Time |
Memory |
0_000.txt |
AC |
2 ms |
4352 KB |
0_001.txt |
AC |
2 ms |
4352 KB |
0_002.txt |
AC |
2 ms |
4352 KB |
1_003.txt |
AC |
2 ms |
4352 KB |
1_004.txt |
AC |
2 ms |
4352 KB |
1_005.txt |
AC |
2 ms |
4352 KB |
1_006.txt |
AC |
2 ms |
4352 KB |
1_007.txt |
AC |
2 ms |
4352 KB |
1_008.txt |
AC |
2 ms |
4352 KB |
1_009.txt |
AC |
2 ms |
4352 KB |
1_010.txt |
AC |
2 ms |
4352 KB |
2_011.txt |
AC |
4 ms |
4352 KB |
2_012.txt |
AC |
4 ms |
4352 KB |
2_013.txt |
AC |
4 ms |
4352 KB |
2_014.txt |
AC |
4 ms |
4352 KB |
2_015.txt |
AC |
3 ms |
4352 KB |
2_016.txt |
AC |
4 ms |
4352 KB |
2_017.txt |
AC |
4 ms |
4352 KB |
2_018.txt |
AC |
4 ms |
4352 KB |