QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#285679 | #7942. $K$ Subsequences | ucup-team296# | AC ✓ | 44ms | 11648kb | Rust | 16.3kb | 2023-12-16 21:27:14 | 2023-12-16 21:27:14 |
Judging History
answer
pub mod solution {
//{"name":"k","group":"Manual","url":"","interactive":false,"timeLimit":2000,"tests":[{"input":"","output":""}],"testType":"multiNumber","input":{"type":"stdin","fileName":null,"pattern":null},"output":{"type":"stdout","fileName":null,"pattern":null},"languages":{"java":{"taskClass":"k"}}}
use std::collections::BTreeSet;
use crate::algo_lib::io::output::output;
use crate::algo_lib::io::task_io_settings::TaskIoType;
use crate::algo_lib::io::task_runner::run_task;
use crate::algo_lib::io::input::Input;
use crate::algo_lib::io::task_io_settings::TaskIoSettings;
#[allow(unused)]
use crate::dbg;
use crate::out;
use crate::out_line;
#[derive(Clone, Copy, PartialEq, Eq, PartialOrd, Ord)]
struct Seq {
max_suf: i32,
id: usize,
}
fn solve(input: &mut Input, _test_case: usize) {
let n = input.usize();
let k = input.usize();
let a = input.vec::<i32>(n);
let mut set = BTreeSet::new();
for id in 1..=k {
set.insert(Seq { max_suf: 0, id });
}
let mut res = vec![];
for &x in a.iter() {
let mut use_set = if x == 1 {
let use_set = set.iter().next().unwrap().clone();
set.remove(&use_set);
use_set
} else {
assert_eq!(x, -1);
let use_set = set.iter().next_back().unwrap().clone();
set.remove(&use_set);
use_set
};
res.push(use_set.id);
use_set.max_suf += x;
if use_set.max_suf < 0 {
use_set.max_suf = 0;
}
set.insert(use_set);
}
out_line!(res);
}
pub(crate) fn run(mut input: Input) -> bool {
let t = input.read();
for i in 0usize..t {
solve(&mut input, i + 1);
}
output().flush();
true
}
#[allow(unused)]
pub fn submit() -> bool {
let io = TaskIoSettings {
is_interactive: false,
input: TaskIoType::Std,
output: TaskIoType::Std,
};
run_task(io, run)
}
}
pub mod algo_lib {
pub mod io {
pub mod input {
use std::fmt::Debug;
use std::io::Read;
use std::marker::PhantomData;
use std::path::Path;
use std::str::FromStr;
pub struct Input {
input: Box<dyn Read>,
buf: Vec<u8>,
at: usize,
buf_read: usize,
}
macro_rules! read_integer_fun {
($t:ident) => {
#[allow(unused)]
pub fn $t(&mut self) -> $t {
self.read_integer()
}
};
}
impl Input {
const DEFAULT_BUF_SIZE: usize = 4096;
///
/// Using with stdin:
/// ```no_run
/// use algo_lib::io::input::Input;
/// let stdin = std::io::stdin();
/// let input = Input::new(Box::new(stdin));
/// ```
///
/// For read files use ``new_file`` instead.
///
///
pub fn new(input: Box<dyn Read>) -> Self {
Self {
input,
buf: vec![0; Self::DEFAULT_BUF_SIZE],
at: 0,
buf_read: 0,
}
}
pub fn new_file<P: AsRef<Path>>(path: P) -> Self {
let file = std::fs::File::open(&path)
.unwrap_or_else(|_| panic!("Can't open file: {:?}", path.as_ref().as_os_str()));
Self::new(Box::new(file))
}
pub fn new_with_size(input: Box<dyn Read>, buf_size: usize) -> Self {
Self {
input,
buf: vec![0; buf_size],
at: 0,
buf_read: 0,
}
}
pub fn new_file_with_size<P: AsRef<Path>>(path: P, buf_size: usize) -> Self {
let file = std::fs::File::open(&path)
.unwrap_or_else(|_| panic!("Can't open file: {:?}", path.as_ref().as_os_str()));
Self::new_with_size(Box::new(file), buf_size)
}
pub fn get(&mut self) -> Option<u8> {
if self.refill_buffer() {
let res = self.buf[self.at];
self.at += 1;
Some(res)
} else {
None
}
}
pub fn peek(&mut self) -> Option<u8> {
if self.refill_buffer() {
Some(self.buf[self.at])
} else {
None
}
}
pub fn skip_whitespace(&mut self) {
while let Some(b) = self.peek() {
if !char::from(b).is_whitespace() {
return;
}
self.get();
}
}
pub fn next_token(&mut self) -> Option<Vec<u8>> {
self.skip_whitespace();
let mut res = Vec::new();
while let Some(c) = self.get() {
if char::from(c).is_whitespace() {
break;
}
res.push(c);
}
if res.is_empty() {
None
} else {
Some(res)
}
}
//noinspection RsSelfConvention
pub fn is_exhausted(&mut self) -> bool {
self.peek().is_none()
}
pub fn has_more_elements(&mut self) -> bool {
!self.is_exhausted()
}
pub fn read<T: Readable>(&mut self) -> T {
T::read(self)
}
pub fn vec<T: Readable>(&mut self, size: usize) -> Vec<T> {
let mut res = Vec::with_capacity(size);
for _ in 0usize..size {
res.push(self.read());
}
res
}
pub fn string_vec(&mut self, size: usize) -> Vec<Vec<u8>> {
let mut res = Vec::with_capacity(size);
for _ in 0usize..size {
res.push(self.string());
}
res
}
pub fn read_line(&mut self) -> String {
let mut res = String::new();
while let Some(c) = self.get() {
if c == b'\n' {
break;
}
if c == b'\r' {
if self.peek() == Some(b'\n') {
self.get();
}
break;
}
res.push(c.into());
}
res
}
#[allow(clippy::should_implement_trait)]
pub fn into_iter<T: Readable>(self) -> InputIterator<T> {
InputIterator {
input: self,
phantom: Default::default(),
}
}
fn read_integer<T: FromStr>(&mut self) -> T
where
<T as FromStr>::Err: Debug,
{
let res = self.read_string();
res.parse::<T>().unwrap()
}
fn read_string(&mut self) -> String {
match self.next_token() {
None => {
panic!("Input exhausted");
}
Some(res) => unsafe { String::from_utf8_unchecked(res) },
}
}
pub fn string_as_string(&mut self) -> String {
self.read_string()
}
pub fn string(&mut self) -> Vec<u8> {
self.read_string().into_bytes()
}
fn read_char(&mut self) -> char {
self.skip_whitespace();
self.get().unwrap().into()
}
fn read_float(&mut self) -> f64 {
self.read_string().parse().unwrap()
}
pub fn f64(&mut self) -> f64 {
self.read_float()
}
fn refill_buffer(&mut self) -> bool {
if self.at == self.buf_read {
self.at = 0;
self.buf_read = self.input.read(&mut self.buf).unwrap();
self.buf_read != 0
} else {
true
}
}
read_integer_fun!(i32);
read_integer_fun!(i64);
read_integer_fun!(i128);
read_integer_fun!(u32);
read_integer_fun!(u64);
read_integer_fun!(usize);
}
pub trait Readable {
fn read(input: &mut Input) -> Self;
}
impl Readable for String {
fn read(input: &mut Input) -> Self {
input.read_string()
}
}
impl Readable for char {
fn read(input: &mut Input) -> Self {
input.read_char()
}
}
impl Readable for f64 {
fn read(input: &mut Input) -> Self {
input.read_string().parse().unwrap()
}
}
impl Readable for f32 {
fn read(input: &mut Input) -> Self {
input.read_string().parse().unwrap()
}
}
impl<T: Readable> Readable for Vec<T> {
fn read(input: &mut Input) -> Self {
let size = input.read();
input.vec(size)
}
}
pub struct InputIterator<T: Readable> {
input: Input,
phantom: PhantomData<T>,
}
impl<T: Readable> Iterator for InputIterator<T> {
type Item = T;
fn next(&mut self) -> Option<Self::Item> {
self.input.skip_whitespace();
self.input.peek().map(|_| self.input.read())
}
}
macro_rules! read_integer {
($t:ident) => {
impl Readable for $t {
fn read(input: &mut Input) -> Self {
input.read_integer()
}
}
};
}
read_integer!(i8);
read_integer!(i16);
read_integer!(i32);
read_integer!(i64);
read_integer!(i128);
read_integer!(isize);
read_integer!(u8);
read_integer!(u16);
read_integer!(u32);
read_integer!(u64);
read_integer!(u128);
read_integer!(usize);
}
pub mod output {
use std::io::Write;
pub struct Output {
output: Box<dyn Write>,
buf: Vec<u8>,
at: usize,
auto_flush: bool,
}
impl Output {
const DEFAULT_BUF_SIZE: usize = 4096;
pub fn new(output: Box<dyn Write>) -> Self {
Self {
output,
buf: vec![0; Self::DEFAULT_BUF_SIZE],
at: 0,
auto_flush: false,
}
}
pub fn new_with_auto_flush(output: Box<dyn Write>) -> Self {
Self {
output,
buf: vec![0; Self::DEFAULT_BUF_SIZE],
at: 0,
auto_flush: true,
}
}
pub fn flush(&mut self) {
if self.at != 0 {
self.output.write_all(&self.buf[..self.at]).unwrap();
self.at = 0;
self.output.flush().expect("Couldn't flush output");
}
}
pub fn print<T: Writable>(&mut self, s: &T) {
s.write(self);
}
pub fn put(&mut self, b: u8) {
self.buf[self.at] = b;
self.at += 1;
if self.at == self.buf.len() {
self.flush();
}
}
pub fn maybe_flush(&mut self) {
if self.auto_flush {
self.flush();
}
}
pub fn print_per_line<T: Writable>(&mut self, arg: &[T]) {
for i in arg {
i.write(self);
self.put(b'\n');
}
}
pub fn print_iter<T: Writable, I: Iterator<Item = T>>(&mut self, iter: I) {
let mut first = true;
for e in iter {
if first {
first = false;
} else {
self.put(b' ');
}
e.write(self);
}
}
pub fn print_iter_ref<'a, T: 'a + Writable, I: Iterator<Item = &'a T>>(&mut self, iter: I) {
let mut first = true;
for e in iter {
if first {
first = false;
} else {
self.put(b' ');
}
e.write(self);
}
}
}
impl Write for Output {
fn write(&mut self, buf: &[u8]) -> std::io::Result<usize> {
let mut start = 0usize;
let mut rem = buf.len();
while rem > 0 {
let len = (self.buf.len() - self.at).min(rem);
self.buf[self.at..self.at + len].copy_from_slice(&buf[start..start + len]);
self.at += len;
if self.at == self.buf.len() {
self.flush();
}
start += len;
rem -= len;
}
if self.auto_flush {
self.flush();
}
Ok(buf.len())
}
fn flush(&mut self) -> std::io::Result<()> {
self.flush();
Ok(())
}
}
pub trait Writable {
fn write(&self, output: &mut Output);
}
impl Writable for &str {
fn write(&self, output: &mut Output) {
output.write_all(self.as_bytes()).unwrap();
}
}
impl Writable for String {
fn write(&self, output: &mut Output) {
output.write_all(self.as_bytes()).unwrap();
}
}
impl Writable for char {
fn write(&self, output: &mut Output) {
output.put(*self as u8);
}
}
impl<T: Writable> Writable for [T] {
fn write(&self, output: &mut Output) {
output.print_iter_ref(self.iter());
}
}
impl<T: Writable> Writable for Vec<T> {
fn write(&self, output: &mut Output) {
self[..].write(output);
}
}
macro_rules! write_to_string {
($t:ident) => {
impl Writable for $t {
fn write(&self, output: &mut Output) {
self.to_string().write(output);
}
}
};
}
write_to_string!(u8);
write_to_string!(u16);
write_to_string!(u32);
write_to_string!(u64);
write_to_string!(u128);
write_to_string!(usize);
write_to_string!(i8);
write_to_string!(i16);
write_to_string!(i32);
write_to_string!(i64);
write_to_string!(i128);
write_to_string!(isize);
write_to_string!(f32);
write_to_string!(f64);
impl<T: Writable, U: Writable> Writable for (T, U) {
fn write(&self, output: &mut Output) {
self.0.write(output);
output.put(b' ');
self.1.write(output);
}
}
impl<T: Writable, U: Writable, V: Writable> Writable for (T, U, V) {
fn write(&self, output: &mut Output) {
self.0.write(output);
output.put(b' ');
self.1.write(output);
output.put(b' ');
self.2.write(output);
}
}
pub static mut OUTPUT: Option<Output> = None;
pub fn set_global_output_to_stdout() {
unsafe {
OUTPUT = Some(Output::new(Box::new(std::io::stdout())));
}
}
pub fn set_global_output_to_file(path: &str) {
unsafe {
let out_file =
std::fs::File::create(path).unwrap_or_else(|_| panic!("Can't create file {}", path));
OUTPUT = Some(Output::new(Box::new(out_file)));
}
}
pub fn set_global_output_to_none() {
unsafe {
match &mut OUTPUT {
None => {}
Some(output) => output.flush(),
}
OUTPUT = None;
}
}
pub fn output() -> &'static mut Output {
unsafe {
match &mut OUTPUT {
None => {
panic!("Global output wasn't initialized");
}
Some(output) => output,
}
}
}
#[macro_export]
macro_rules! out {
($first: expr $(,$args:expr )*) => {
output().print(&$first);
$(output().put(b' ');
output().print(&$args);
)*
output().maybe_flush();
}
}
#[macro_export]
macro_rules! out_line {
($first: expr $(, $args:expr )* ) => {
{
out!($first $(,$args)*);
output().put(b'\n');
output().maybe_flush();
}
};
() => {
{
output().put(b'\n');
output().maybe_flush();
}
};
}
}
pub mod task_io_settings {
pub enum TaskIoType {
Std,
File(String),
}
pub struct TaskIoSettings {
pub is_interactive: bool,
pub input: TaskIoType,
pub output: TaskIoType,
}
}
pub mod task_runner {
use std::io::Write;
use super::input::Input;
use super::output::Output;
use super::output::OUTPUT;
use super::task_io_settings::TaskIoSettings;
use super::task_io_settings::TaskIoType;
pub fn run_task<Res>(io: TaskIoSettings, run: impl FnOnce(Input) -> Res) -> Res {
let output: Box<dyn Write> = match io.output {
TaskIoType::Std => Box::new(std::io::stdout()),
TaskIoType::File(file) => {
let out_file = std::fs::File::create(file).unwrap();
Box::new(out_file)
}
};
unsafe {
OUTPUT = Some(Output::new(output));
}
let input = match io.input {
TaskIoType::Std => {
let sin = std::io::stdin();
Input::new(Box::new(sin))
}
TaskIoType::File(file) => Input::new_file(file),
};
run(input)
}
}
}
pub mod misc {
pub mod dbg_macro {
#[macro_export]
#[allow(unused_macros)]
macro_rules! dbg {
($first_val:expr, $($val:expr),+ $(,)?) => {
eprint!("[{}:{}] {} = {:?}",
file!(), line!(), stringify!($first_val), &$first_val);
($(eprint!(", {} = {:?}", stringify!($val), &$val)),+,);
eprintln!();
};
($first_val:expr) => {
eprintln!("[{}:{}] {} = {:?}",
file!(), line!(), stringify!($first_val), &$first_val)
};
}
}
}
}
fn main() {
crate::solution::submit();
}
这程序好像有点Bug,我给组数据试试?
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 0ms
memory: 2180kb
input:
5 3 2 1 -1 1 4 2 -1 1 1 -1 7 3 1 1 1 1 1 1 1 10 3 1 1 1 1 -1 -1 1 1 1 1 12 4 1 1 1 1 -1 -1 -1 -1 1 1 1 1
output:
1 1 1 2 1 2 2 1 2 3 1 2 3 1 1 2 3 1 1 3 3 1 2 3 1 2 3 4 4 3 2 1 1 2 3 4
result:
ok Correct (5 test cases)
Test #2:
score: 0
Accepted
time: 20ms
memory: 2056kb
input:
18434 10 1 -1 1 1 -1 -1 1 -1 -1 1 1 10 2 -1 -1 -1 1 1 -1 1 1 1 1 10 2 1 -1 -1 -1 -1 1 1 -1 1 1 10 7 1 1 -1 1 -1 1 1 -1 -1 1 9 1 -1 1 -1 1 1 -1 1 -1 1 8 1 -1 -1 -1 -1 1 1 -1 -1 10 3 -1 -1 -1 1 1 1 1 -1 -1 -1 9 1 1 -1 -1 1 -1 -1 -1 -1 -1 10 10 -1 1 1 1 1 1 1 1 1 1 10 4 -1 1 -1 1 -1 1 1 -1 1 1 9 3 1 1 ...
output:
1 1 1 1 1 1 1 1 1 1 2 2 2 1 2 2 2 1 2 1 1 1 2 2 2 1 2 2 2 1 1 2 2 2 2 2 3 3 2 2 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 3 3 3 1 2 3 1 1 3 2 1 1 1 1 1 1 1 1 1 10 1 2 3 4 5 6 7 8 9 4 1 1 1 1 1 2 2 2 3 1 2 2 1 1 1 1 1 3 1 2 2 2 3 4 4 4 7 1 2 3 4 5 6 7 7 7 1 1 6 1 1 6 1 2 2 1 1 1 1 1 1 1 1 1 1 2 3 1 1 1 1 1 2...
result:
ok Correct (18434 test cases)
Test #3:
score: 0
Accepted
time: 21ms
memory: 4548kb
input:
1 199996 3 1 -1 1 1 1 1 -1 -1 -1 1 1 -1 1 -1 1 1 -1 -1 1 1 1 1 -1 1 -1 -1 -1 1 -1 1 1 1 1 1 1 1 -1 -1 -1 1 -1 -1 1 1 -1 -1 -1 1 -1 1 1 -1 1 -1 -1 1 1 1 1 -1 1 1 1 1 1 1 1 1 -1 -1 -1 -1 1 1 -1 1 1 -1 1 -1 -1 -1 -1 -1 1 1 -1 -1 1 1 -1 1 -1 1 1 -1 1 1 1 -1 1 -1 1 1 1 -1 -1 -1 1 1 -1 -1 1 -1 -1 -1 -1 -1...
output:
1 1 1 2 3 1 1 3 2 2 3 3 3 3 3 1 1 3 3 1 2 3 3 3 3 2 1 1 1 1 2 3 1 2 3 1 1 3 2 2 2 1 1 2 2 1 3 3 3 3 1 1 1 1 3 3 1 2 3 3 3 1 2 3 1 2 3 1 1 3 2 1 1 2 2 2 3 3 3 3 2 1 3 2 2 3 3 2 2 3 3 3 3 3 1 1 1 2 3 3 3 3 3 1 2 2 1 3 3 1 1 3 3 3 2 1 3 2 1 1 2 3 3 3 1 2 3 1 2 2 2 2 2 3 1 1 3 2 1 1 1 1 1 1 2 2 1 1 1 1 ...
result:
ok Correct (1 test case)
Test #4:
score: 0
Accepted
time: 22ms
memory: 4556kb
input:
1 199998 152 -1 1 -1 -1 1 -1 -1 -1 -1 -1 -1 1 -1 -1 1 -1 -1 -1 1 -1 -1 1 -1 1 1 -1 -1 1 1 1 -1 -1 -1 1 -1 1 -1 1 1 -1 -1 -1 -1 -1 -1 -1 -1 1 -1 1 1 -1 -1 1 1 -1 1 -1 1 -1 1 -1 1 -1 1 -1 1 -1 -1 1 -1 1 1 1 1 -1 1 1 1 -1 -1 1 -1 -1 1 1 -1 -1 -1 -1 1 -1 -1 1 -1 1 1 -1 1 1 -1 -1 1 -1 -1 1 -1 1 -1 1 1 -1...
output:
152 1 1 152 1 1 152 152 152 152 152 1 1 152 1 1 152 152 1 1 152 1 1 1 2 2 1 1 2 3 3 2 1 1 1 1 1 1 2 2 1 152 152 152 152 152 152 1 1 1 2 2 1 1 2 2 2 2 2 2 2 2 2 2 2 2 2 2 1 1 1 1 2 3 4 4 4 5 6 6 5 5 5 4 4 5 5 4 3 2 2 2 1 1 1 1 2 2 2 3 3 2 2 2 1 1 1 1 1 1 2 2 2 2 2 3 4 5 5 4 4 5 5 5 6 7 8 9 10 10 9 9 ...
result:
ok Correct (1 test case)
Test #5:
score: 0
Accepted
time: 26ms
memory: 4400kb
input:
1 199996 136 -1 1 1 1 1 1 -1 1 -1 -1 1 -1 1 1 -1 -1 1 1 1 1 1 -1 1 -1 -1 1 -1 1 1 -1 -1 1 -1 -1 1 -1 1 1 1 1 1 1 -1 -1 -1 -1 1 -1 -1 -1 -1 -1 -1 -1 -1 1 1 1 -1 1 1 1 -1 1 1 1 1 1 -1 -1 1 -1 1 -1 -1 1 1 1 1 -1 1 -1 -1 -1 -1 1 1 -1 -1 -1 -1 1 -1 1 1 1 1 1 -1 -1 1 1 1 1 1 1 1 1 1 1 1 -1 -1 -1 1 1 1 1 1...
output:
136 1 2 3 4 5 5 5 5 4 4 4 4 5 5 4 4 5 6 7 8 8 8 8 7 7 7 7 8 8 7 7 7 6 6 6 6 7 8 9 10 11 11 10 9 8 8 8 7 6 5 4 3 2 1 1 2 3 3 3 4 5 5 5 6 7 8 9 9 8 8 8 8 8 7 7 8 9 10 10 10 10 9 8 7 7 8 8 7 6 5 5 5 5 6 7 8 9 9 8 8 9 10 11 12 13 14 15 16 17 18 18 17 16 16 17 18 19 20 20 20 21 21 21 22 23 23 23 24 24 23...
result:
ok Correct (1 test case)
Test #6:
score: 0
Accepted
time: 36ms
memory: 7668kb
input:
1 199998 86240 1 1 -1 1 1 1 1 1 1 -1 1 1 -1 1 -1 -1 -1 1 1 1 1 1 1 1 -1 1 1 1 1 1 -1 1 -1 -1 -1 -1 -1 -1 -1 -1 1 -1 -1 1 -1 -1 -1 -1 1 1 -1 -1 -1 1 1 -1 -1 1 1 -1 1 -1 1 -1 1 -1 1 1 1 1 1 -1 1 -1 1 -1 1 -1 -1 1 1 1 -1 -1 -1 -1 -1 -1 1 1 1 1 -1 -1 -1 1 1 -1 -1 1 -1 1 1 1 -1 -1 -1 1 -1 -1 -1 -1 1 1 -1...
output:
1 2 2 2 3 4 5 6 7 7 7 8 8 8 8 7 6 6 7 8 9 10 11 12 12 12 13 14 15 16 16 16 16 15 14 13 12 11 10 9 9 9 8 8 8 7 6 5 5 6 6 5 4 4 5 5 4 4 5 5 5 5 5 5 5 5 5 6 7 8 9 9 9 9 9 9 9 9 8 8 9 10 10 9 8 7 6 5 5 6 7 8 8 7 6 6 7 7 6 6 6 6 7 8 8 7 6 6 6 5 4 3 3 4 4 3 3 3 3 3 2 2 2 1 86240 86240 86240 86240 1 1 1 2 ...
result:
ok Correct (1 test case)
Test #7:
score: 0
Accepted
time: 44ms
memory: 11648kb
input:
1 199998 196586 1 -1 -1 -1 1 -1 1 -1 1 -1 -1 -1 1 -1 -1 -1 1 -1 -1 -1 -1 -1 1 -1 1 1 1 -1 -1 -1 1 -1 -1 -1 1 1 -1 1 -1 1 -1 1 1 1 -1 -1 -1 -1 1 -1 -1 -1 1 -1 -1 1 -1 -1 -1 1 1 1 1 1 -1 1 1 -1 1 1 1 1 -1 -1 -1 1 1 -1 -1 1 1 -1 -1 -1 1 -1 -1 -1 1 -1 -1 -1 1 -1 -1 1 -1 1 -1 -1 1 -1 1 -1 1 1 -1 -1 -1 -1...
output:
1 1 196586 196586 1 1 1 1 1 1 196586 196586 1 1 196586 196586 1 1 196586 196586 196586 196586 1 1 1 2 3 3 2 1 1 1 196586 196586 1 2 2 2 2 2 2 2 3 4 4 3 2 1 1 1 196586 196586 1 1 196586 1 1 196586 196586 1 2 3 4 5 5 5 6 6 6 7 8 9 9 8 7 7 8 8 7 7 8 8 7 6 6 6 5 4 4 4 3 2 2 2 1 1 1 1 1 196586 1 1 1 1 1 ...
result:
ok Correct (1 test case)
Test #8:
score: 0
Accepted
time: 42ms
memory: 8408kb
input:
2 53064 32664 1 1 1 -1 1 1 1 -1 1 1 1 -1 -1 1 -1 -1 1 1 1 -1 -1 1 -1 1 1 1 -1 -1 -1 1 -1 -1 -1 -1 -1 1 -1 1 -1 -1 1 -1 -1 1 1 -1 -1 -1 -1 1 1 1 -1 1 -1 -1 -1 -1 1 1 1 1 -1 1 1 -1 1 -1 1 -1 -1 1 -1 1 -1 -1 1 -1 1 1 -1 1 1 -1 -1 -1 1 1 1 1 1 -1 1 1 -1 1 1 -1 -1 -1 -1 1 1 -1 -1 -1 1 -1 1 1 -1 -1 1 1 1 ...
output:
1 2 3 3 3 4 5 5 5 6 7 7 6 6 6 5 5 6 7 7 6 6 6 6 7 8 8 7 6 6 6 5 4 3 2 2 2 2 2 1 1 1 32664 1 2 2 1 32664 32664 1 2 3 3 3 3 2 1 32664 1 2 3 4 4 4 5 5 5 5 5 5 4 4 4 4 4 3 3 3 3 4 4 4 5 5 4 3 3 4 5 6 7 7 7 8 8 8 9 9 8 7 6 6 7 7 6 5 5 5 5 6 6 5 5 6 7 7 6 5 5 5 4 3 3 3 2 2 2 2 3 4 4 3 3 4 5 5 5 6 6 5 5 6 ...
result:
ok Correct (2 test cases)
Test #9:
score: 0
Accepted
time: 20ms
memory: 3268kb
input:
2 86135 2 1 1 -1 -1 -1 1 1 -1 1 -1 -1 1 -1 1 -1 -1 -1 1 -1 1 1 1 1 -1 -1 1 -1 -1 1 1 1 -1 -1 1 1 -1 -1 -1 1 1 1 1 1 1 1 1 -1 -1 1 1 1 1 1 -1 1 -1 1 1 -1 1 -1 -1 1 -1 -1 -1 -1 1 -1 -1 1 1 1 -1 1 -1 1 1 -1 1 1 1 -1 1 -1 1 -1 1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 1 1 -1 1 -1 1 1 1 1 1 1 1 -1 1 -1 1 -1 1 -1 1...
output:
1 2 2 1 2 1 2 2 2 2 1 1 1 1 1 2 2 1 1 1 2 1 2 2 1 1 1 2 2 1 2 2 1 1 2 2 1 2 2 1 2 1 2 1 2 1 1 2 2 1 2 1 2 2 2 2 2 1 1 1 1 2 2 2 1 2 1 1 1 2 2 1 2 2 2 2 2 1 1 1 2 1 1 1 1 1 1 1 1 2 1 2 1 2 1 2 1 2 2 1 1 1 1 1 2 1 2 1 2 1 1 1 1 1 1 1 1 1 2 2 1 2 2 1 2 2 2 2 2 2 1 2 1 2 1 2 2 2 2 2 2 1 1 2 2 1 1 1 2 2 ...
result:
ok Correct (2 test cases)
Test #10:
score: 0
Accepted
time: 31ms
memory: 4168kb
input:
2 114819 248 -1 -1 -1 -1 -1 1 -1 1 -1 -1 1 -1 1 1 -1 1 -1 -1 1 -1 -1 1 -1 1 -1 1 -1 -1 -1 -1 -1 -1 -1 -1 1 -1 1 -1 -1 1 -1 1 1 1 1 -1 -1 -1 -1 1 1 1 1 1 -1 -1 1 -1 -1 -1 1 -1 -1 -1 1 -1 -1 1 1 -1 -1 -1 1 1 -1 -1 -1 1 -1 1 -1 -1 -1 1 1 -1 -1 -1 -1 1 1 1 -1 -1 -1 -1 1 -1 -1 -1 1 1 1 -1 -1 -1 -1 -1 1 -...
output:
248 248 248 248 248 1 1 1 1 248 1 1 1 2 2 2 2 1 1 1 248 1 1 1 1 1 1 248 248 248 248 248 248 248 1 1 1 1 248 1 1 1 2 3 4 4 3 2 1 1 2 3 4 5 5 4 4 4 3 2 2 2 1 248 1 1 248 1 2 2 1 248 1 2 2 1 248 1 1 1 1 248 248 1 2 2 1 248 248 1 2 3 3 2 1 248 1 1 248 248 1 2 3 3 2 1 248 248 1 1 248 248 248 248 248 1 2 ...
result:
ok Correct (2 test cases)
Test #11:
score: 0
Accepted
time: 28ms
memory: 5312kb
input:
2 51745 1 -1 1 1 -1 1 -1 -1 1 -1 1 -1 1 1 1 -1 -1 1 -1 1 1 1 1 1 -1 1 -1 -1 1 -1 -1 1 -1 1 1 -1 1 -1 1 1 -1 1 1 -1 1 1 1 -1 -1 1 -1 1 -1 -1 -1 1 -1 -1 1 1 -1 -1 1 1 -1 -1 -1 1 1 -1 1 -1 -1 1 1 1 -1 -1 1 -1 -1 1 -1 -1 -1 1 -1 -1 -1 1 -1 -1 1 -1 1 -1 -1 -1 -1 1 1 1 1 1 1 -1 -1 -1 -1 1 1 -1 1 1 -1 1 1 ...
output:
1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ...
result:
ok Correct (2 test cases)
Test #12:
score: 0
Accepted
time: 19ms
memory: 4292kb
input:
2 190655 1 1 -1 -1 -1 1 -1 -1 1 -1 -1 -1 -1 -1 -1 -1 1 -1 -1 -1 -1 -1 -1 1 1 1 -1 -1 1 1 -1 -1 -1 1 -1 -1 -1 1 1 -1 -1 1 -1 -1 1 1 1 1 1 -1 -1 1 -1 1 1 -1 1 1 -1 -1 -1 1 -1 -1 1 1 -1 -1 -1 1 1 1 -1 1 -1 -1 -1 1 1 1 -1 -1 -1 -1 -1 1 1 -1 1 -1 1 -1 1 -1 -1 -1 -1 1 1 -1 -1 -1 1 -1 -1 1 1 1 1 1 1 -1 -1 ...
output:
1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ...
result:
ok Correct (2 test cases)
Test #13:
score: 0
Accepted
time: 24ms
memory: 3832kb
input:
3 509 3 -1 -1 1 1 -1 -1 1 1 -1 -1 -1 1 -1 -1 -1 -1 -1 -1 -1 1 1 -1 -1 1 1 1 -1 1 -1 1 -1 -1 1 -1 1 -1 1 -1 -1 -1 1 -1 -1 -1 1 1 1 -1 -1 -1 -1 -1 1 -1 1 -1 -1 -1 -1 1 -1 -1 -1 1 -1 -1 1 -1 1 -1 -1 1 -1 1 1 -1 -1 -1 1 -1 1 1 -1 -1 1 1 -1 -1 1 -1 -1 1 1 1 -1 1 -1 1 -1 -1 -1 1 1 1 -1 1 1 1 1 -1 1 -1 1 -...
output:
3 3 1 2 2 1 1 2 2 1 3 1 1 3 3 3 3 3 3 1 2 2 1 1 2 3 3 3 3 3 3 2 2 2 2 2 2 2 1 3 1 1 3 3 1 2 3 3 2 1 3 3 1 1 1 1 3 3 3 1 1 3 3 1 1 3 1 1 1 1 3 1 1 1 2 2 1 3 1 1 1 2 2 1 1 2 2 1 1 1 3 1 2 3 3 3 3 3 3 2 1 1 2 3 3 3 1 2 3 3 3 3 3 3 3 1 2 2 1 3 2 1 1 1 3 2 2 3 1 1 3 2 2 2 2 2 1 3 3 3 3 1 2 3 1 1 3 2 2 2 ...
result:
ok Correct (3 test cases)
Test #14:
score: 0
Accepted
time: 14ms
memory: 3712kb
input:
4 25729 81 -1 -1 -1 -1 1 -1 -1 -1 -1 -1 -1 -1 -1 1 -1 1 -1 -1 -1 1 -1 -1 1 -1 1 1 1 -1 -1 1 1 -1 1 -1 -1 1 -1 -1 -1 1 -1 1 -1 -1 -1 -1 -1 -1 1 1 -1 -1 1 -1 1 1 1 1 1 1 -1 1 1 1 -1 -1 -1 1 1 1 1 1 1 1 -1 -1 -1 -1 1 -1 -1 -1 -1 1 -1 1 -1 1 1 -1 1 -1 1 1 -1 -1 1 1 1 1 1 1 -1 -1 1 1 -1 1 1 -1 -1 1 -1 1 ...
output:
81 81 81 81 1 1 81 81 81 81 81 81 81 1 1 1 1 81 81 1 1 81 1 1 1 2 3 3 2 2 3 3 3 3 2 2 2 1 81 1 1 1 1 81 81 81 81 81 1 2 2 1 1 1 1 2 3 4 5 6 6 6 7 8 8 7 6 6 7 8 9 10 11 12 12 11 10 9 9 9 8 7 6 6 6 6 6 6 7 7 7 7 7 8 8 7 7 8 9 10 11 12 12 11 11 12 12 12 13 13 12 12 12 12 13 13 12 11 11 11 10 10 10 9 9 ...
result:
ok Correct (4 test cases)
Test #15:
score: 0
Accepted
time: 33ms
memory: 4628kb
input:
5 7824 2 -1 -1 -1 -1 1 1 1 1 -1 1 1 1 -1 1 -1 -1 1 1 -1 -1 -1 1 -1 1 -1 1 -1 1 1 -1 1 1 1 1 -1 1 1 -1 1 1 1 -1 1 -1 -1 -1 1 -1 -1 -1 1 -1 -1 1 -1 -1 -1 1 -1 -1 -1 -1 -1 -1 -1 1 1 -1 -1 1 1 1 1 -1 1 -1 -1 1 -1 1 -1 1 -1 1 -1 -1 1 1 -1 1 -1 1 -1 1 1 1 1 -1 1 -1 -1 -1 -1 -1 1 1 -1 1 -1 1 -1 1 1 1 -1 -1...
output:
2 2 2 2 1 2 1 2 2 2 1 2 2 2 2 1 1 2 2 1 2 2 2 2 2 2 2 2 1 1 1 2 1 2 2 2 1 1 1 2 1 1 1 1 2 1 1 1 2 1 1 1 2 2 2 1 2 2 2 1 2 1 2 2 2 1 2 2 1 1 2 1 2 2 2 2 1 1 1 1 1 1 1 1 1 2 2 1 1 1 1 1 1 1 2 1 2 2 2 2 1 2 1 2 2 1 1 1 1 1 1 1 2 1 1 2 1 1 1 2 2 1 1 1 1 2 1 2 2 2 1 2 1 1 1 1 2 1 1 2 1 2 1 2 2 1 1 2 1 2 ...
result:
ok Correct (5 test cases)
Test #16:
score: 0
Accepted
time: 26ms
memory: 3456kb
input:
6 7149 4795 -1 -1 1 -1 -1 1 1 -1 1 1 1 1 -1 1 -1 -1 -1 -1 -1 -1 -1 1 -1 -1 1 -1 -1 1 -1 -1 -1 -1 1 1 1 1 -1 1 -1 1 1 1 -1 -1 1 -1 1 1 1 -1 1 1 1 1 -1 1 -1 1 -1 1 -1 1 1 1 1 1 1 1 1 -1 1 -1 -1 -1 -1 -1 -1 -1 -1 -1 1 1 -1 1 1 -1 -1 -1 -1 1 1 1 -1 1 1 -1 1 -1 1 -1 1 1 -1 1 -1 -1 -1 1 1 1 1 1 1 -1 -1 -1...
output:
4795 4795 1 1 4795 1 2 2 2 3 4 5 5 5 5 4 3 2 1 4795 4795 1 1 4795 1 1 4795 1 1 4795 4795 4795 1 2 3 4 4 4 4 4 5 6 6 5 5 5 5 6 7 7 7 8 9 10 10 10 10 10 10 10 10 10 11 12 13 14 15 16 17 17 17 17 16 15 14 13 12 11 10 9 9 10 10 10 11 11 10 9 8 8 9 10 10 10 11 11 11 11 11 11 11 12 12 12 12 11 10 10 11 12...
result:
ok Correct (6 test cases)
Test #17:
score: 0
Accepted
time: 20ms
memory: 4008kb
input:
7 16819 1 1 1 1 1 1 1 -1 -1 -1 1 1 1 -1 1 1 1 -1 1 1 -1 -1 -1 1 1 1 1 -1 1 1 -1 1 -1 1 1 -1 -1 1 1 -1 1 -1 1 -1 1 1 -1 -1 1 -1 -1 -1 1 -1 1 -1 -1 -1 -1 -1 -1 -1 1 -1 1 1 -1 -1 1 -1 1 -1 1 1 -1 -1 -1 1 -1 -1 -1 -1 1 -1 1 -1 1 -1 -1 -1 1 1 1 1 1 1 -1 1 -1 1 -1 1 1 1 1 -1 -1 1 1 1 -1 1 -1 -1 1 -1 -1 1 ...
output:
1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ...
result:
ok Correct (7 test cases)
Test #18:
score: 0
Accepted
time: 30ms
memory: 3620kb
input:
8 29021 106 -1 -1 -1 -1 1 -1 1 -1 1 -1 1 1 1 -1 -1 1 1 1 1 1 -1 -1 1 1 -1 -1 -1 1 1 -1 -1 -1 -1 -1 -1 1 1 -1 1 1 1 -1 -1 -1 1 1 1 1 1 1 1 1 -1 1 -1 1 -1 -1 1 -1 1 -1 1 -1 1 1 -1 1 1 -1 1 -1 -1 -1 1 1 1 1 -1 -1 -1 -1 1 -1 1 -1 -1 1 1 -1 -1 -1 1 -1 1 1 -1 1 1 1 -1 1 -1 1 1 -1 -1 -1 1 -1 -1 -1 1 -1 -1 ...
output:
106 106 106 106 1 1 1 1 1 1 1 2 3 3 2 2 3 4 5 6 6 5 5 6 6 5 4 4 5 5 4 3 2 1 106 1 2 2 2 3 4 4 3 2 2 3 4 5 6 7 8 9 9 9 9 9 9 8 8 8 8 8 8 8 8 9 9 9 10 10 10 10 9 8 8 9 10 11 11 10 9 8 8 8 8 8 7 7 8 8 7 6 6 6 6 7 7 7 8 9 9 9 9 9 10 10 9 8 8 8 7 6 6 6 5 5 6 6 6 7 7 7 7 6 5 4 3 3 4 5 5 5 5 5 6 7 7 6 5 4 ...
result:
ok Correct (8 test cases)
Test #19:
score: 0
Accepted
time: 20ms
memory: 2876kb
input:
9 37136 1 -1 1 -1 -1 -1 -1 1 -1 1 -1 -1 1 1 1 1 1 1 1 -1 1 1 -1 1 1 1 -1 -1 1 1 1 1 -1 1 -1 1 -1 -1 1 -1 1 -1 -1 -1 -1 -1 1 -1 1 -1 1 1 -1 -1 1 -1 -1 1 1 1 1 1 -1 -1 -1 -1 -1 -1 -1 1 1 1 -1 -1 1 1 -1 1 1 1 1 1 1 -1 -1 -1 -1 -1 1 1 1 -1 1 -1 -1 -1 1 -1 -1 1 -1 1 1 1 1 1 -1 -1 1 -1 -1 1 1 1 1 -1 1 -1 ...
output:
1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ...
result:
ok Correct (9 test cases)
Test #20:
score: 0
Accepted
time: 33ms
memory: 4644kb
input:
10 5543 1596 1 1 1 -1 1 1 1 -1 -1 -1 1 1 -1 -1 -1 1 -1 1 -1 -1 1 -1 -1 -1 -1 -1 -1 -1 1 1 -1 1 -1 -1 -1 1 1 -1 1 -1 -1 -1 1 -1 1 1 -1 -1 1 1 1 1 1 -1 -1 1 1 -1 1 1 -1 1 -1 1 1 -1 -1 -1 1 -1 1 -1 -1 1 -1 -1 -1 1 -1 -1 1 -1 -1 1 -1 1 -1 -1 1 -1 -1 -1 -1 -1 -1 1 1 1 1 -1 -1 -1 -1 1 1 1 1 -1 -1 -1 -1 1 ...
output:
1 2 3 3 3 4 5 5 4 3 3 4 4 3 2 2 2 2 2 1 1 1 1596 1596 1596 1596 1596 1596 1 2 2 2 2 1 1596 1 2 2 2 2 1 1596 1 1 1 2 2 1 1 2 3 4 5 5 4 4 5 5 5 6 6 6 6 6 7 7 6 5 5 5 5 5 4 4 4 3 2 2 2 1 1 1 1596 1 1 1 1 1596 1 1 1596 1596 1596 1596 1596 1 2 3 4 4 3 2 1 1 2 3 4 4 3 2 1 1 1 1 2 2 1 1596 1 1 1596 1596 1 ...
result:
ok Correct (10 test cases)
Test #21:
score: 0
Accepted
time: 24ms
memory: 2272kb
input:
100 2336 29 -1 -1 -1 1 -1 1 1 -1 -1 -1 1 -1 -1 1 1 1 1 1 1 -1 -1 1 1 -1 1 -1 -1 -1 1 -1 -1 1 1 1 1 -1 1 1 -1 1 -1 1 1 1 -1 -1 -1 -1 -1 1 1 -1 1 1 -1 -1 1 1 -1 -1 1 1 -1 -1 1 -1 -1 -1 1 -1 -1 -1 1 1 1 1 1 -1 -1 1 -1 -1 -1 -1 -1 -1 1 -1 1 1 1 1 1 -1 1 1 1 -1 1 1 1 -1 1 -1 1 -1 1 1 1 1 1 -1 1 -1 -1 -1 ...
output:
29 29 29 1 1 1 2 2 1 29 1 1 29 1 2 3 4 5 6 6 5 5 6 6 6 6 5 4 4 4 3 3 4 5 6 6 6 7 7 7 7 7 8 9 9 8 7 6 5 5 6 6 6 7 7 6 6 7 7 6 6 7 7 6 6 6 5 4 4 4 3 2 2 3 4 5 6 6 5 5 5 4 3 2 1 29 1 1 1 2 3 4 5 5 5 6 7 7 7 8 9 9 9 9 9 9 9 10 11 12 13 13 13 13 12 11 11 12 12 11 11 12 13 14 15 15 14 13 12 12 13 13 13 14...
result:
ok Correct (100 test cases)
Test #22:
score: 0
Accepted
time: 22ms
memory: 2308kb
input:
101 92 1 1 1 -1 1 1 -1 -1 -1 -1 -1 1 -1 -1 1 -1 1 1 -1 1 -1 1 1 1 1 -1 -1 -1 1 -1 -1 -1 -1 -1 1 -1 -1 -1 -1 -1 -1 1 -1 -1 -1 -1 -1 1 1 -1 1 -1 -1 1 -1 -1 1 -1 -1 -1 -1 -1 1 -1 1 -1 -1 -1 -1 1 1 -1 1 1 -1 1 1 1 1 -1 -1 1 1 1 1 1 1 1 1 1 1 -1 -1 2647 2314 -1 1 -1 -1 1 1 1 -1 1 1 1 1 -1 1 -1 -1 1 -1 -1...
output:
1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 2314 1 1 2314 1 2 3 3 3 4 5 6 6 6 6 5 5 5 4 3 3 3 2 1 1 2 2 1 1 1 2314 2314 2314 2314 1 2 2 1 2314 2314 1 2 3 3 2 2 ...
result:
ok Correct (101 test cases)
Test #23:
score: 0
Accepted
time: 26ms
memory: 2476kb
input:
102 8381 7064 -1 -1 1 1 -1 -1 1 -1 1 1 1 1 1 -1 -1 1 -1 1 -1 1 1 1 -1 -1 -1 1 -1 1 1 1 1 -1 -1 -1 -1 1 1 1 -1 -1 1 1 -1 1 -1 1 -1 -1 1 -1 -1 1 -1 1 1 -1 -1 1 1 1 -1 -1 -1 1 1 1 1 1 1 -1 -1 1 -1 1 -1 -1 -1 -1 1 1 -1 1 1 -1 -1 1 -1 -1 1 -1 -1 -1 1 -1 -1 1 -1 1 1 -1 -1 1 1 1 1 -1 -1 1 1 1 -1 1 -1 -1 -1...
output:
7064 7064 1 2 2 1 1 1 1 2 3 4 5 5 4 4 4 4 4 4 5 6 6 5 4 4 4 4 5 6 7 7 6 5 4 4 5 6 6 5 5 6 6 6 6 6 6 5 5 5 4 4 4 4 5 5 4 4 5 6 6 5 4 4 5 6 7 8 9 9 8 8 8 8 8 7 6 5 5 6 6 6 7 7 6 6 6 5 5 5 4 3 3 3 2 2 2 2 3 3 2 2 3 4 5 5 4 4 5 6 6 6 6 5 4 4 4 4 4 3 2 2 2 1 1 1 1 2 2 1 1 1 7064 7064 7064 1 2 2 1 1 1 1 1...
result:
ok Correct (102 test cases)
Test #24:
score: 0
Accepted
time: 24ms
memory: 2324kb
input:
103 1976 404 1 -1 -1 1 -1 -1 -1 -1 1 1 1 -1 1 1 -1 -1 1 -1 1 -1 1 -1 -1 1 1 1 1 -1 -1 1 1 1 -1 1 -1 -1 1 -1 1 -1 1 -1 1 1 1 1 1 1 -1 -1 1 -1 -1 1 1 1 1 1 1 -1 -1 1 1 1 1 -1 -1 -1 1 -1 1 -1 1 1 1 1 -1 1 -1 -1 -1 -1 1 -1 -1 1 -1 -1 -1 1 -1 -1 -1 1 -1 1 1 -1 1 1 -1 1 -1 1 -1 -1 -1 -1 -1 -1 1 1 1 1 -1 -...
output:
1 1 404 1 1 404 404 404 1 2 3 3 3 4 4 3 3 3 3 3 3 3 2 2 3 4 5 5 4 4 5 6 6 6 6 5 5 5 5 5 5 5 5 6 7 8 9 10 10 9 9 9 8 8 9 10 11 12 13 13 12 12 13 14 15 15 14 13 13 13 13 13 13 14 15 16 16 16 16 15 14 13 13 13 12 12 12 11 10 10 10 9 8 8 8 8 9 9 9 10 10 10 10 10 10 9 8 7 6 5 5 6 7 8 8 7 6 6 7 7 7 8 8 8 ...
result:
ok Correct (103 test cases)
Test #25:
score: 0
Accepted
time: 21ms
memory: 2376kb
input:
104 3135 3 1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1 1 1 -1 -1 1 1 1 -1 -1 -1 -1 1 1 -1 1 -1 -1 -1 -1 -1 -1 1 1 -1 -1 -1 1 1 -1 -1 1 1 -1 -1 -1 1 -1 1 1 -1 -1 -1 -1 1 -1 -1 -1 1 -1 1 -1 1 -1 1 -1 -1 1 1 -1 -1 1 -1 -1 -1 -1 1 -1 1 1 1 1 1 1 -1 1 -1 -1 1 1 1 1 1 1 1 1 -1 -1 1 1 1 1 1 1 -1 1 1 1 1 -1 1 -1 1 1 -1...
output:
1 1 3 3 3 3 3 3 3 3 3 1 2 2 1 1 2 3 3 2 1 3 1 2 2 2 2 1 3 3 3 3 1 2 2 1 3 1 2 2 1 1 2 2 1 3 1 1 1 2 2 1 3 3 1 1 3 3 1 1 1 1 1 1 1 1 3 1 2 2 1 1 1 3 3 3 1 1 1 2 3 1 2 3 3 3 3 2 2 3 1 2 3 1 2 3 3 2 2 3 1 2 3 1 1 1 2 3 1 1 1 1 1 2 2 1 3 3 1 2 3 3 3 1 2 2 1 1 1 1 2 3 1 1 1 2 2 1 3 2 2 3 3 3 1 2 3 3 3 1 ...
result:
ok Correct (104 test cases)
Test #26:
score: 0
Accepted
time: 22ms
memory: 2456kb
input:
105 1344 10 1 1 1 -1 1 -1 1 -1 -1 -1 -1 -1 1 1 1 1 1 -1 1 1 1 -1 1 -1 1 1 1 1 1 -1 -1 -1 1 1 -1 -1 -1 1 -1 -1 1 -1 -1 -1 1 -1 1 1 -1 1 -1 1 1 -1 1 -1 -1 -1 -1 -1 -1 -1 -1 1 -1 1 -1 -1 -1 1 -1 -1 1 -1 1 1 1 -1 1 -1 1 1 1 1 -1 1 1 1 -1 1 -1 -1 -1 1 -1 1 1 -1 1 -1 1 1 1 -1 1 -1 1 -1 -1 1 1 -1 -1 1 1 -1...
output:
1 2 3 3 3 3 3 3 2 1 10 10 1 2 3 4 5 5 5 6 7 7 7 7 7 8 9 10 1 1 10 9 9 10 10 9 8 8 8 7 7 7 6 5 5 5 5 6 6 6 6 6 7 7 7 7 6 5 4 3 2 1 10 1 1 1 1 10 10 1 1 10 1 1 1 2 3 3 3 3 3 4 5 6 6 6 7 8 8 8 8 7 6 6 6 6 7 7 7 7 7 8 9 9 9 9 9 9 8 8 9 9 8 8 9 9 9 9 8 7 6 6 6 5 4 4 5 6 6 6 7 7 6 6 7 7 7 8 9 10 1 2 2 2 3...
result:
ok Correct (105 test cases)
Test #27:
score: 0
Accepted
time: 26ms
memory: 2164kb
input:
1000 1284 8 1 1 1 1 -1 1 -1 -1 -1 -1 1 1 -1 -1 1 1 1 1 -1 1 -1 1 1 -1 1 1 1 1 -1 -1 1 -1 1 -1 1 1 1 -1 1 -1 -1 1 -1 -1 -1 1 1 1 -1 -1 1 1 -1 -1 -1 -1 1 1 1 -1 1 1 -1 -1 1 -1 -1 1 1 1 1 -1 1 -1 1 1 1 -1 1 1 1 -1 1 1 -1 1 -1 1 -1 -1 -1 1 1 -1 1 1 1 1 1 -1 -1 -1 1 -1 -1 -1 1 -1 1 -1 -1 -1 -1 1 1 1 1 -1...
output:
1 2 3 4 4 4 4 3 2 1 1 2 2 1 1 2 3 4 4 4 4 4 5 5 5 6 7 8 8 7 7 7 7 7 7 8 1 1 1 1 8 8 8 7 6 6 7 8 8 7 7 8 8 7 6 5 5 6 7 7 7 8 8 7 7 7 6 6 7 8 1 1 1 1 1 2 3 3 3 4 5 5 5 6 6 6 6 6 6 5 4 4 5 5 5 6 7 8 1 1 8 7 7 7 6 5 5 5 5 5 4 3 2 2 3 4 5 5 5 6 6 5 4 3 2 2 3 3 3 4 4 3 2 2 3 4 4 3 3 3 3 4 4 3 3 4 5 5 5 5 ...
result:
ok Correct (1000 test cases)
Test #28:
score: 0
Accepted
time: 25ms
memory: 2212kb
input:
1001 151 3 1 1 -1 1 -1 1 -1 1 1 -1 1 1 1 1 1 1 1 -1 1 1 -1 -1 1 1 -1 1 -1 1 -1 1 1 -1 1 1 -1 -1 1 -1 -1 1 1 -1 -1 1 -1 -1 1 1 -1 -1 -1 -1 -1 1 1 1 1 -1 -1 1 1 -1 -1 -1 1 -1 -1 -1 -1 -1 1 1 -1 1 -1 -1 -1 -1 1 1 -1 -1 -1 -1 -1 1 1 1 -1 1 -1 1 -1 -1 -1 -1 -1 -1 1 -1 -1 -1 -1 1 -1 1 1 -1 1 1 -1 -1 -1 -1...
output:
1 2 2 2 2 2 2 2 3 3 3 1 2 3 1 2 3 3 3 1 1 3 3 1 1 1 1 1 1 1 2 2 2 3 3 2 2 2 1 1 2 2 1 1 1 3 3 1 1 3 2 1 3 3 1 2 3 3 2 2 3 3 2 1 1 1 3 2 1 3 3 1 1 1 1 3 2 1 1 2 2 1 3 3 3 1 2 3 3 3 3 3 3 2 1 3 3 3 1 1 3 3 3 1 1 1 2 2 2 3 3 2 1 3 3 1 1 1 2 2 2 2 1 1 1 1 1 3 3 3 1 1 3 1 1 1 1 3 1 2 2 1 3 1 1 1 1 1 1 1 ...
result:
ok Correct (1001 test cases)
Test #29:
score: 0
Accepted
time: 25ms
memory: 2404kb
input:
1002 182 6 1 1 1 1 -1 -1 1 -1 -1 1 1 -1 1 1 -1 1 1 1 1 1 -1 -1 -1 -1 1 -1 1 1 1 -1 -1 1 1 1 1 -1 1 1 -1 -1 -1 -1 -1 1 -1 -1 1 1 -1 -1 -1 1 -1 1 -1 -1 -1 1 1 1 -1 1 1 1 1 -1 -1 -1 -1 -1 1 -1 1 -1 1 1 -1 -1 1 1 1 1 -1 1 1 -1 -1 -1 -1 1 1 1 1 1 1 1 -1 1 -1 -1 -1 1 -1 -1 -1 -1 1 1 -1 -1 -1 -1 1 -1 1 1 1...
output:
1 2 3 4 4 3 3 3 2 2 3 3 3 4 4 4 5 6 1 2 2 1 6 5 5 5 5 6 1 1 6 6 1 2 3 3 3 4 4 3 2 1 6 6 6 5 5 6 6 5 4 4 4 4 4 3 2 2 3 4 4 4 5 6 1 1 6 5 4 3 3 3 3 3 3 4 4 3 3 4 5 6 6 6 1 1 6 5 4 4 5 6 1 2 3 4 4 4 4 3 2 2 2 1 6 5 5 6 6 5 4 3 3 3 3 4 5 6 6 6 1 2 2 2 2 1 6 5 5 5 4 3 3 3 2 2 2 1 6 1 1 6 1 1 1 2 3 4 4 3 ...
result:
ok Correct (1002 test cases)
Test #30:
score: 0
Accepted
time: 18ms
memory: 2228kb
input:
1003 95 16 1 -1 -1 1 1 1 -1 -1 -1 -1 -1 1 1 1 -1 -1 -1 -1 1 1 1 -1 1 -1 1 1 -1 -1 -1 -1 1 -1 1 -1 -1 -1 1 -1 -1 1 -1 1 -1 -1 1 -1 -1 1 -1 -1 -1 1 1 1 -1 1 1 1 -1 -1 -1 -1 1 1 -1 1 1 1 1 1 -1 -1 1 1 -1 -1 -1 1 -1 -1 -1 -1 -1 1 -1 -1 -1 1 1 1 1 -1 -1 1 1 526 3 1 -1 -1 1 1 -1 -1 -1 -1 -1 -1 -1 -1 -1 -1...
output:
1 1 16 1 2 3 3 2 1 16 16 1 2 3 3 2 1 16 1 2 3 3 3 3 3 4 4 3 2 1 1 1 1 1 16 16 1 1 16 1 1 1 1 16 1 1 16 1 1 16 16 1 2 3 3 3 4 5 5 4 3 2 2 3 3 3 4 5 6 7 7 6 6 7 7 6 5 5 5 4 3 2 1 1 1 16 16 1 2 3 4 4 3 3 4 1 1 3 1 2 2 1 3 3 3 3 3 3 3 3 1 1 1 2 3 3 2 2 3 1 1 1 2 2 2 2 1 3 2 2 3 1 1 1 1 3 3 1 1 1 1 1 2 3...
result:
ok Correct (1003 test cases)
Test #31:
score: 0
Accepted
time: 26ms
memory: 2332kb
input:
1004 322 257 -1 1 1 1 1 1 1 -1 -1 1 1 -1 -1 -1 1 -1 -1 1 -1 1 -1 -1 -1 1 1 1 1 1 1 -1 1 1 -1 1 -1 1 -1 1 1 -1 1 -1 1 1 1 -1 1 1 -1 -1 1 -1 1 1 -1 -1 -1 1 -1 1 -1 1 -1 1 1 1 -1 1 1 1 -1 -1 1 1 -1 -1 -1 1 1 1 1 1 1 1 -1 -1 1 1 1 1 1 1 1 1 -1 -1 -1 1 -1 1 -1 1 1 -1 -1 -1 1 -1 1 1 1 1 -1 -1 1 -1 -1 1 -1...
output:
257 1 2 3 4 5 6 6 5 5 6 6 5 4 4 4 3 3 3 3 3 2 1 1 2 3 4 5 6 6 6 7 7 7 7 7 7 7 8 8 8 8 8 9 10 10 10 11 11 10 10 10 10 11 11 10 9 9 9 9 9 9 9 9 10 11 11 11 12 13 13 12 12 13 13 12 11 11 12 13 14 15 16 17 17 16 16 17 18 19 20 21 22 23 23 22 21 21 21 21 21 21 22 22 21 20 20 20 20 21 22 23 23 22 22 22 21...
result:
ok Correct (1004 test cases)
Test #32:
score: 0
Accepted
time: 25ms
memory: 2212kb
input:
1005 508 4 1 -1 -1 -1 1 1 1 1 1 1 1 -1 1 1 1 -1 1 -1 1 -1 1 1 -1 1 -1 -1 1 -1 -1 1 -1 -1 1 1 -1 1 1 -1 1 -1 -1 -1 -1 1 -1 -1 1 1 1 1 -1 1 -1 1 -1 1 1 1 -1 -1 -1 -1 1 1 -1 1 -1 1 -1 1 -1 1 -1 1 1 1 -1 -1 1 -1 -1 -1 -1 1 1 -1 -1 -1 -1 1 -1 1 -1 1 1 -1 -1 1 -1 -1 1 1 -1 -1 1 -1 -1 -1 1 1 1 -1 -1 1 1 1 ...
output:
1 1 4 4 1 2 3 4 1 2 3 3 3 4 1 1 1 1 1 1 1 2 2 2 2 1 1 1 4 4 4 3 3 4 4 4 1 1 1 1 4 3 2 2 2 1 1 2 3 4 4 4 4 4 4 4 1 2 2 1 4 3 3 4 4 4 4 4 4 4 4 4 4 4 1 2 2 1 1 1 4 3 2 2 3 3 2 1 4 4 4 4 4 4 1 1 4 4 4 3 3 4 4 3 3 3 2 1 1 2 3 3 2 2 3 4 1 2 2 2 3 4 1 2 2 2 3 4 4 3 3 3 2 1 1 2 2 2 3 4 1 1 4 3 3 3 2 1 4 3 ...
result:
ok Correct (1005 test cases)
Test #33:
score: 0
Accepted
time: 27ms
memory: 2296kb
input:
9995 9 7 -1 1 -1 -1 -1 1 -1 -1 1 1 1 -1 7 1 -1 -1 -1 -1 1 -1 -1 25 1 1 1 1 1 1 1 1 -1 -1 -1 -1 1 -1 -1 1 1 1 -1 1 -1 1 1 -1 -1 -1 24 22 1 -1 1 -1 1 -1 1 1 1 -1 1 1 1 1 -1 1 1 -1 1 -1 -1 1 -1 -1 6 3 1 -1 1 1 -1 -1 6 4 -1 1 -1 -1 -1 1 14 9 -1 -1 1 -1 1 -1 1 1 1 1 1 1 1 -1 24 3 1 -1 -1 -1 1 1 -1 1 1 1 ...
output:
7 1 1 7 7 1 1 7 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 2 3 3 3 4 5 6 6 6 7 7 7 7 6 6 6 5 1 1 1 2 2 1 4 1 1 4 4 1 9 9 1 1 1 1 1 2 3 4 5 6 7 7 1 1 3 3 1 2 2 2 3 1 2 3 3 3 1 2 2 1 3 2 1 1 1 1 8 8 8 1 1 8 1 1 1 1 1 2 2 2 3 3 3 3 3 3 3 4 4 4 5 5 5 5 4 3 2 1 1 1 ...
result:
ok Correct (9995 test cases)
Test #34:
score: 0
Accepted
time: 27ms
memory: 2128kb
input:
9996 27 1 1 1 -1 -1 -1 -1 -1 -1 -1 1 1 1 -1 -1 -1 -1 1 -1 1 -1 -1 -1 1 1 -1 1 1 7 2 1 1 1 1 -1 -1 1 22 3 -1 -1 1 1 -1 -1 -1 1 1 1 -1 -1 -1 -1 -1 1 -1 1 1 -1 -1 1 37 4 -1 -1 -1 1 -1 1 -1 -1 -1 1 1 -1 1 1 -1 1 -1 1 -1 1 -1 1 -1 1 -1 1 -1 1 1 1 1 1 1 -1 1 1 1 7 1 -1 1 -1 -1 1 1 1 29 1 -1 -1 1 -1 1 -1 1...
output:
1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 2 1 2 2 1 1 3 3 1 2 2 1 3 1 2 3 3 2 1 3 3 1 1 1 2 2 1 1 4 4 4 1 1 1 1 4 4 1 2 2 2 3 3 3 3 3 3 3 3 3 3 3 3 3 3 3 4 1 2 3 4 4 4 1 2 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 10 1 2 3 4 5 6 7 7 6 5 4 3 3 1 2 2 2 3 3 3...
result:
ok Correct (9996 test cases)
Test #35:
score: 0
Accepted
time: 24ms
memory: 2180kb
input:
9997 15 9 -1 1 1 -1 1 1 -1 1 -1 1 1 1 1 1 1 1 1 1 37 20 -1 1 -1 -1 1 -1 -1 1 -1 -1 -1 1 -1 1 1 -1 1 1 -1 -1 -1 -1 1 1 -1 1 -1 -1 -1 1 -1 1 1 1 1 1 -1 64 2 -1 -1 -1 -1 -1 1 1 1 1 1 1 1 1 -1 -1 -1 -1 -1 -1 1 1 -1 -1 -1 -1 -1 1 -1 1 -1 1 1 1 1 -1 1 -1 -1 -1 1 1 -1 -1 1 1 -1 -1 1 -1 -1 -1 -1 1 1 -1 -1 -...
output:
9 1 2 2 2 3 3 3 3 3 4 5 6 7 8 1 20 1 1 20 1 1 20 1 1 20 20 1 1 1 2 2 2 3 3 2 1 20 1 2 2 2 2 1 20 1 1 1 2 3 4 5 5 2 2 2 2 2 1 2 1 2 1 2 1 2 2 1 2 1 2 1 1 2 2 1 2 1 2 1 1 1 1 1 2 1 2 2 2 2 1 2 2 1 1 2 2 1 1 2 2 2 1 2 2 1 2 2 1 2 1 1 1 1 1 1 2 1 2 1 2 2 2 1 2 1 2 2 2 1 1 2 1 2 2 2 1 2 2 2 1 1 1 1 1 2 1...
result:
ok Correct (9997 test cases)
Test #36:
score: 0
Accepted
time: 27ms
memory: 2148kb
input:
9998 28 3 -1 1 1 -1 -1 -1 -1 -1 1 1 1 -1 -1 1 -1 1 -1 -1 -1 -1 -1 -1 -1 1 1 1 1 1 12 2 -1 -1 -1 1 -1 -1 1 -1 1 1 -1 1 8 6 -1 1 1 -1 1 1 1 1 3 1 1 1 -1 12 1 1 -1 1 1 1 -1 1 -1 -1 1 1 -1 3 1 1 -1 -1 77 3 -1 -1 1 1 1 -1 1 -1 1 1 1 1 1 1 1 -1 -1 -1 1 -1 -1 1 -1 -1 1 1 -1 1 -1 1 1 -1 -1 -1 -1 -1 1 -1 1 -...
output:
3 1 2 2 1 3 3 3 1 2 3 3 2 2 2 2 2 1 3 3 3 3 3 1 2 3 1 2 2 2 2 1 1 2 1 1 1 2 2 2 6 1 2 2 2 3 4 5 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 3 3 1 2 3 3 3 3 3 1 2 3 1 2 3 3 2 1 1 1 3 3 3 2 2 3 3 3 3 3 1 1 3 2 1 3 3 3 3 3 2 1 1 1 1 1 1 1 3 1 2 3 3 2 1 1 2 3 3 3 3 3 1 2 3 3 2 2 3 3 2 1 3 3 1 1 1 1 1 3 3 1 1 1 ...
result:
ok Correct (9998 test cases)
Test #37:
score: 0
Accepted
time: 28ms
memory: 2172kb
input:
9999 65 2 -1 -1 1 1 -1 -1 -1 1 -1 -1 -1 1 1 -1 -1 -1 -1 1 -1 1 1 -1 -1 1 -1 1 1 1 -1 -1 1 1 1 1 -1 1 -1 1 -1 1 -1 -1 -1 1 1 -1 -1 -1 -1 1 1 1 1 -1 -1 1 -1 1 1 1 1 1 1 1 1 12 3 1 1 1 1 -1 -1 -1 -1 1 1 -1 -1 75 2 1 -1 1 -1 -1 -1 1 1 -1 1 -1 1 -1 -1 -1 1 1 1 -1 1 -1 1 1 -1 1 -1 -1 1 -1 -1 -1 1 1 -1 1 1...
output:
2 2 1 2 2 1 2 1 1 2 2 1 2 2 1 2 2 1 1 1 2 2 1 1 1 1 2 1 1 2 2 1 2 1 1 1 1 1 1 1 1 2 1 1 2 2 1 2 1 1 2 1 2 2 1 1 1 1 2 1 2 1 2 1 2 1 2 3 1 1 3 2 1 1 2 2 1 1 1 1 1 2 2 1 2 2 2 2 2 2 1 2 1 2 1 1 1 1 1 2 2 2 2 1 1 1 2 1 1 2 2 2 1 1 1 1 2 2 2 2 2 2 1 2 2 1 2 1 2 2 1 1 1 1 2 2 1 2 1 2 2 1 1 2 1 2 2 2 2 2 ...
result:
ok Correct (9999 test cases)
Test #38:
score: 0
Accepted
time: 27ms
memory: 2296kb
input:
10000 15 3 -1 1 -1 1 -1 -1 1 -1 1 -1 1 -1 -1 -1 1 3 3 -1 1 1 34 2 -1 -1 -1 -1 1 -1 1 -1 -1 -1 -1 1 -1 -1 -1 1 -1 -1 1 -1 1 -1 -1 1 -1 1 1 -1 -1 -1 1 -1 1 1 3 2 1 1 -1 25 2 -1 -1 1 1 1 -1 1 -1 1 -1 -1 -1 1 1 1 -1 1 1 1 1 -1 1 -1 1 -1 11 1 1 -1 -1 -1 -1 -1 1 -1 -1 -1 1 29 2 -1 -1 -1 1 -1 1 -1 -1 -1 -1...
output:
3 1 1 1 1 3 1 1 1 1 1 1 3 3 1 3 1 2 2 2 2 2 1 1 1 1 2 2 2 1 1 2 2 1 1 2 1 1 1 1 2 1 1 1 2 2 1 2 1 1 1 2 1 2 2 2 2 1 2 1 1 1 1 1 1 2 1 1 2 1 1 1 2 1 2 2 2 2 2 2 1 1 1 1 1 1 1 1 1 1 1 2 2 2 1 1 1 1 2 2 2 2 2 1 2 1 2 2 1 2 2 2 2 2 1 1 2 2 2 1 1 1 4 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ...
result:
ok Correct (10000 test cases)
Extra Test:
score: 0
Extra Test Passed