結果
| 問題 | No.3471 ジャッジサーバーの負荷分散 |
| コンテスト | |
| ユーザー |
👑  ArcAki
|
| 提出日時 | 2026-03-06 21:42:30 |
| 言語 | Rust (1.93.0 + proconio + num + itertools) |
| 結果 |
AC
|
| 実行時間 | 43 ms / 2,000 ms |
| コード長 | 10,425 bytes |
| 記録 | |
| コンパイル時間 | 17,140 ms |
| コンパイル使用メモリ | 213,872 KB |
| 実行使用メモリ | 9,900 KB |
| 最終ジャッジ日時 | 2026-03-06 21:47:27 |
| 合計ジャッジ時間 | 4,759 ms |
|
ジャッジサーバーID （参考情報） |
judge3 / judge1 |
（要ログイン）
| ファイルパターン | 結果 |
|---|---|
| sample | AC * 3 |
| other | AC * 15 |
ソースコード
#[allow(unused_imports)]
use std::{
convert::{Infallible, TryFrom, TryInto as _}, fmt::{self, Debug, Display, Formatter,},
fs::File, hash::{Hash, Hasher, BuildHasherDefault}, iter::{Product, Sum}, marker::PhantomData,
ops::{Add, AddAssign, Sub, SubAssign, Div, DivAssign, Mul, MulAssign, Neg, RangeBounds},
str::FromStr, sync::{atomic::{self, AtomicU32, AtomicU64}, Once},
collections::{*, btree_set::Range, btree_map::Range as BTreeRange}, mem::{swap},
cmp::{self, Reverse, Ordering, Eq, PartialEq, PartialOrd},
thread::LocalKey, f64::consts::PI, time::Instant, cell::RefCell,
io::{self, stdin, Read, read_to_string, BufWriter, BufReader, stdout, Write},
};
pub mod fxhash {
use std::hash::BuildHasherDefault;
const K: u64 = 0x517c_c1b7_2722_0a95;
#[derive(Default)]
pub struct FxHasher {
pub hash: u64,
}
impl FxHasher {
#[inline(always)]
fn mix_u64(mut h: u64, x: u64) -> u64 {
h = h.rotate_left(5) ^ x;
h = h.wrapping_mul(K);
let x2 = x ^ (x >> 33) ^ (x << 11);
h = h.rotate_left(5) ^ x2;
h = h.wrapping_mul(K);
h
}
#[inline(always)]
fn write_u64_impl(&mut self, x: u64) {
self.hash = Self::mix_u64(self.hash, x);
}
}
impl std::hash::Hasher for FxHasher {
#[inline(always)]
fn finish(&self) -> u64 {
self.hash
}
#[inline(always)]
fn write(&mut self, bytes: &[u8]) {
let mut h = self.hash;
for &b in bytes {
h = h.rotate_left(5) ^ (b as u64);
h = h.wrapping_mul(K);
}
self.hash = h;
}
#[inline(always)]
fn write_u64(&mut self, i: u64) { self.write_u64_impl(i); }
#[inline(always)]
fn write_u32(&mut self, i: u32) { self.write_u64_impl(i as u64); }
#[inline(always)]
fn write_u16(&mut self, i: u16) { self.write_u64_impl(i as u64); }
#[inline(always)]
fn write_u8 (&mut self, i: u8 ) { self.write_u64_impl(i as u64); }
#[inline(always)]
fn write_usize(&mut self, i: usize) { self.write_u64_impl(i as u64); }
#[inline(always)]
fn write_i64(&mut self, i: i64) { self.write_u64_impl(i as u64); }
#[inline(always)]
fn write_i32(&mut self, i: i32) { self.write_u64_impl(i as u64); }
#[inline(always)]
fn write_i16(&mut self, i: i16) { self.write_u64_impl(i as u64); }
#[inline(always)]
fn write_i8 (&mut self, i: i8 ) { self.write_u64_impl(i as u64); }
#[inline(always)]
fn write_isize(&mut self, i: isize) { self.write_u64_impl(i as u64); }
}
pub type FxBuildHasher = BuildHasherDefault<FxHasher>;
pub type FxMap<K, V> = std::collections::HashMap<K, V, FxBuildHasher>;
pub type FxSet<K> = std::collections::HashSet<K, FxBuildHasher>;
}
pub fn gcd(mut a: i64, mut b: i64)->i64{if a==0{return b;}else if b==0{return a;}let l1 = a.trailing_zeros();let l2 = b.trailing_zeros();
a >>= l1; b >>= l2;while a!=b{let x = (a^b).trailing_zeros();if a<b{swap(&mut a, &mut b)}a = (a-b)>>x;}a << l1.min(l2)}
pub fn factorial_i64(n: usize)->(Vec<i64>, Vec<i64>){
let mut res = vec![1; n+1];let mut inv = vec![1; n+1];for i in 0..n{ res[i+1] = (res[i]*(i+1)as i64)%MOD; }
inv[n] = mod_inverse(res[n], MOD);for i in (0..n).rev(){ inv[i] = inv[i+1]*(i+1) as i64%MOD; }(res, inv) }
pub fn floor(a:i64, b:i64)->i64{let res=(a%b+b)%b;(a-res)/b}
pub fn modulo(a: i64, b: i64)->i64{(a%b+b)%b}
pub fn extended_gcd(a:i64,b:i64)->(i64,i64,i64)
{if b==0{(a,1,0)}else{let(g,x,y)=extended_gcd(b,a%b);(g,y,x-floor(a,b)*y)}}
pub fn mod_inverse(a:i64,m:i64)->i64{let(_,x,_) =extended_gcd(a,m);(x%m+m)%m}
pub fn comb(a: i64, b: i64, f: &Vec<(i64, i64)>)->i64{
if a<b{return 0;}else if b==0 || a==b{ return 1; }
else{let x=f[a as usize].0;
let y=f[(a-b) as usize].1;let z=f[b as usize].1;return((x*y)%MOD)*z%MOD;}}
pub fn factorial(x: i64)->Vec<(i64, i64)>{
let mut f=vec![(1i64,1i64),(1, 1)];let mut z = 1i64;
let mut inv = vec![0; x as usize+10];inv[1] = 1;
for i in 2..x+1{z=(z*i)%MOD;
let w=(MOD-inv[(MOD%i)as usize]*(MOD/i)%MOD)%MOD;
inv[i as usize] = w;
f.push((z, (f[i as usize-1].1*w)%MOD));}return f;}
pub fn fast_mod_pow(mut x: i64,p: usize, m: i64)->i64{
x %= m;
let mut res=1;let mut t=x;let mut z=p;while z > 0{
if z%2==1{res = (res*t)%m;}t = (t*t)%m;z /= 2; }res}
pub trait SortD{ fn sort_d(&mut self); }
impl<T: Ord> SortD for Vec<T>{ fn sort_d(&mut self) {self.sort_by(|u, v| v.cmp(&u));} }
pub trait Mx{fn max(&self, rhs: Self)->Self;}
impl Mx for f64{ fn max(&self, rhs: Self)->Self{if *self < rhs{ rhs } else { *self } }}
pub trait Mi{ fn min(&self, rhs: Self)->Self; }
impl Mi for f64{ fn min(&self, rhs: Self)->Self{ if *self > rhs{ rhs } else { *self } } }
pub trait Chmax: PartialOrd + Copy {fn chmax(&mut self, rhs: Self) {if *self < rhs { *self = rhs; }}}
impl<T: PartialOrd + Copy> Chmax for T {}
pub trait Chmin: PartialOrd + Copy {fn chmin(&mut self, rhs: Self) {if *self > rhs { *self = rhs; }}}
impl<T: PartialOrd + Copy> Chmin for T {}
#[allow(unused)]
use proconio::{*, marker::*};
#[allow(unused)]
use fxhash::FxMap;
#[allow(dead_code)]
const INF: i64 = 1<<60;
#[allow(dead_code)]
const I: i32 = 1<<30;
#[allow(dead_code)]
const MOD: i64 = 998244353;
#[allow(dead_code)]
const D: [(usize, usize); 4] = [(1, 0), (0, 1), (!0, 0), (0, !0)];
#[allow(dead_code)]
pub fn c2d(c: u8)->(usize, usize){match c{b'U'=>(!0,0),b'D'=>(1,0),b'L'=>(0,!0),b'R'=>(0,1),_=>unreachable!()}}
#[allow(dead_code)]
pub fn c2d_i64(c: u8)->(i64, i64){match c{b'U'=>(-1,0),b'D'=>(1,0),b'L'=>(0,-1),b'R'=>(0,1),_=>unreachable!()}}
#[allow(dead_code)]
const D2: [(usize, usize); 8] = [(1, 0), (1, 1), (0, 1), (!0, 1), (!0, 0), (!0, !0), (0, !0), (1, !0)];
pub trait SegtreeMonoid{
type S: Clone;
fn identity() -> Self::S;
fn op(a: &Self::S, b: &Self::S) -> Self::S;
}
pub struct Segtree<M: SegtreeMonoid> {
n: usize,
data: Vec<M::S>,
}
impl<M: SegtreeMonoid> Segtree<M> {
pub fn new(n: usize) -> Self {
let n = n.next_power_of_two();
let data = vec![M::identity(); 2 * n];
Segtree{ n, data }
}
pub fn set(&mut self, i: usize, x: M::S) {
let mut p = i + self.n;
self.data[p] = x;
while p > 0 {
p /= 2;
self.data[p] = M::op(&self.data[p << 1], &self.data[(p << 1) | 1]);
}
}
pub fn from(a: Vec<M::S>) -> Self{
let n = a.len().next_power_of_two();
let mut data = vec![M::identity(); 2*n];
for (i, v) in a.iter().enumerate(){
data[i+n] = v.clone();
}
for i in (1..n).rev(){
data[i] = M::op(&data[2*i], &data[2*i+1]);
}
Segtree{
n, data,
}
}
pub fn get(&self, p: usize)->M::S{
self.data[self.n+p].clone()
}
pub fn push(&mut self, i: usize, x: M::S) {
let mut p = i + self.n;
self.data[p] = M::op(&self.data[p], &x);
while p > 0 {
p /= 2;
self.data[p] = M::op(&self.data[p << 1], &self.data[(p << 1) | 1]);
}
}
pub fn prod(&self, l: usize, r: usize) -> M::S {
let mut p_l = l + self.n;
let mut p_r = r + self.n;
let mut res_l = M::identity();
let mut res_r = M::identity();
while p_l < p_r {
if p_l & 1 == 1 {
res_l = M::op(&res_l, &self.data[p_l]);
p_l += 1;
}
if p_r & 1 == 1 {
p_r -= 1;
res_r = M::op(&self.data[p_r], &res_r);
}
p_l >>= 1;
p_r >>= 1;
}
M::op(&res_l, &res_r)
}
pub fn all_prod(&self)-> M::S {
self.data[1].clone()
}
pub fn max_right<F>(&self, mut l: usize, f: F) -> usize where F: Fn(&M::S)->bool {
assert!(f(&M::identity())); // これはバグってくれないと多分デバックが悲惨
if l == self.n {
return self.n
}
l += self.n;
let mut ac = M::identity();
while {
while l % 2 == 0 {
l >>= 1;
}
if !f(&M::op(&ac, &self.data[l])) {
while l < self.n {
l <<= 1;
let res = M::op(&ac, &self.data[l]);
if f(&res) {
ac = res;
l += 1;
}
}
return l - self.n;
}
ac = M::op(&ac, &self.data[l]);
l += 1;
let z = l as isize;
(z & -z) != z
} {}
self.n
}
pub fn min_left<F>(&self, mut r: usize, f: F) -> usize where F: Fn(&M::S) -> bool {
assert!(f(&M::identity()));
if r == 0 {return 0}
r += self.n;
let mut ac = M::identity();
while {
r -= 1;
while r > 1 && r % 2 == 1 {
r >>= 1;
}
if !f(&M::op(&self.data[r], &ac)) {
while r < self.n{
r = 2 * r + 1;
let res = M::op(&self.data[r], &ac);
if f(&res) {
ac = res;
r -= 1;
}
}
return r + 1 - self.n;
}
ac = M::op(&self.data[r], &ac);
let z = r as isize;
z & -z != z
} {}
0
}
}
struct M;
impl SegtreeMonoid for M{
type S = i64;
fn identity() -> Self::S {
1<<60
}
fn op(&a: &Self::S, &b: &Self::S) -> Self::S {
a.min(b)
}
}
const MULTI: bool = false;
//#[fastout]
fn solve(){
input!{
n: usize, m: usize,
a: [i64; n],
}
let mut seg = Segtree::<M>::from(vec![0; m]);
for &v in &a{
let mi = seg.all_prod();
let p = seg.max_right(0, |&x| x > mi);
seg.set(p, seg.get(p)+v);
}
let mut ans = 0;
for i in 0..m{
ans.chmax(seg.get(i));
}
println!("{}", ans);
}
fn main() {
if MULTI{
input!{
t: usize,
}
for _ in 0..t{
solve();
}
} else {
solve();
}
}