結果
| 問題 | No.2942 Sigma Music Game Level Problem |
| ユーザー |
 Moss_Local
|
| 提出日時 | 2024-10-18 22:34:39 |
| 言語 | Rust (1.77.0 + proconio) |
| 結果 |
TLE
|
| 実行時間 | - |
| コード長 | 6,812 bytes |
| コンパイル時間 | 12,187 ms |
| コンパイル使用メモリ | 404,348 KB |
| 実行使用メモリ | 19,908 KB |
| 最終ジャッジ日時 | 2024-10-18 22:52:57 |
| 合計ジャッジ時間 | 24,986 ms |
|
ジャッジサーバーID （参考情報） |
judge / judge8 |
（要ログイン）
テストケース
テストケース表示| 入力 | 結果 | 実行時間 実行使用メモリ |
|---|---|---|
| testcase_00 | AC | 1 ms
6,816 KB |
| testcase_01 | AC | 1 ms
6,816 KB |
| testcase_02 | AC | 1 ms
6,820 KB |
| testcase_03 | AC | 1 ms
6,816 KB |
| testcase_04 | AC | 1 ms
6,820 KB |
| testcase_05 | AC | 1 ms
6,816 KB |
| testcase_06 | AC | 1 ms
6,820 KB |
| testcase_07 | AC | 1 ms
6,816 KB |
| testcase_08 | AC | 10 ms
6,820 KB |
| testcase_09 | AC | 6 ms
6,816 KB |
| testcase_10 | AC | 4 ms
6,820 KB |
| testcase_11 | AC | 1,992 ms
14,676 KB |
| testcase_12 | TLE | - |
| testcase_13 | TLE | - |
| testcase_14 | -- | - |
| testcase_15 | -- | - |
| testcase_16 | -- | - |
| testcase_17 | -- | - |
| testcase_18 | -- | - |
| testcase_19 | -- | - |
| testcase_20 | -- | - |
| testcase_21 | -- | - |
| testcase_22 | -- | - |
| testcase_23 | -- | - |
| testcase_24 | -- | - |
| testcase_25 | -- | - |
| testcase_26 | -- | - |
コンパイルメッセージ
warning: unnecessary parentheses around match arm expression
--> src/main.rs:214:46
|
214 | std::ops::Bound::Included(&x) => (x + 1),
| ^ ^
|
= note: `#[warn(unused_parens)]` on by default
help: remove these parentheses
|
214 - std::ops::Bound::Included(&x) => (x + 1),
214 + std::ops::Bound::Included(&x) => x + 1,
|
warning: variable does not need to be mutable
--> src/main.rs:119:9
|
119 | let mut vec: Vec<i64> = read_vec();
| ----^^^
| |
| help: remove this `mut`
|
= note: `#[warn(unused_mut)]` on by default
warning: variable does not need to be mutable
--> src/main.rs:125:9
|
125 | let mut vec: Vec<i64> = read_vec();
| ----^^^
| |
| help: remove this `mut`
warning: variable does not need to be mutable
--> src/main.rs:130:9
|
130 | let mut vec: Vec<usize> = read_vec();
| ----^^^
| |
| help: remove this `mut`
warning: variable does not need to be mutable
--> src/main.rs:136:9
|
136 | let mut vec: Vec<f64> = read_vec();
| ----^^^
| |
| help: remove this `mut`
warning: variable does not need to be mutable
--> src/main.rs:141:9
|
141 | let mut vec: Vec<char> = read_vec();
| ----^^^
| |
| help: remove this `mut`
warning: variable does not need to be mutable
--> src/main.rs:146:9
|
146 | let mut vec: Vec<usize> = read_vec();
| ----^^^
| |
| help: remove this `mut`
warning: variable does not need to be mutable
--> src/main.rs:151:9
|
151 | let mut vec: Vec<i64> = read_vec();
| ----^^^
| |
| help: remove this `mut`
warning: variable does not need to be mutable
--> src/main.rs:157:9
|
157 | let mut vec: Vec<usize>
ソースコード
// -*- coding:utf-8-unix -*-
// #![feature(map_first_last)]
#![allow(dead_code)]
#![allow(unused_imports)]
#![allow(unused_macros)]
// use core::num;
use std::cmp::*;
use std::fmt::*;
use std::hash::*;
use std::io::BufRead;
use std::iter::FromIterator;
use std::*;
use std::{cmp, collections, fmt, io, iter, ops, str};
const INF: i64 = 1223372036854775807;
const UINF: usize = INF as usize;
const LINF: i64 = 2147483647;
const INF128: i128 = 1223372036854775807000000000000;
const MOD1: i64 = 1000000007;
const MOD9: i64 = 998244353;
const MOD: i64 = MOD9;
// const MOD: i64 = MOD2;
const UMOD: usize = MOD as usize;
const M_PI: f64 = 3.14159265358979323846;
// use proconio::input;
// const MOD: i64 = INF;
use cmp::Ordering::*;
use std::collections::*;
use std::io::stdin;
use std::io::stdout;
use std::io::Write;
macro_rules! p {
($x:expr) => {
//if expr
println!("{}", $x);
};
}
macro_rules! vp {
// vector print separate with space
($x:expr) => {
println!(
"{}",
$x.iter()
.map(|x| x.to_string())
.collect::<Vec<_>>()
.join(" ")
);
};
}
macro_rules! d {
($x:expr) => {
eprintln!("{:?}", $x);
};
}
macro_rules! yn {
($val:expr) => {
if $val {
println!("Yes");
} else {
println!("No");
}
};
}
macro_rules! map{
// declear btreemap
($($key:expr => $val:expr),*) => {
{
let mut map = ::std::collections::BTreeMap::new();
$(
map.insert($key, $val);
)*
map
}
};
}
macro_rules! set{
// declear btreemap
($($key:expr),*) => {
{
let mut set = ::std::collections::BTreeSet::new();
$(
set.insert($key);
)*
set
}
};
}
//input output
#[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 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 vec: Vec<i64> = read_vec();
(vec[0], vec[1])
}
#[allow(dead_code)]
fn readiii() -> (i64, i64, i64) {
let mut vec: Vec<i64> = read_vec();
(vec[0], vec[1], vec[2])
}
#[allow(dead_code)]
fn readuu() -> (usize, usize) {
let mut vec: Vec<usize> = read_vec();
(vec[0], vec[1])
}
#[allow(dead_code)]
fn readff() -> (f64, f64) {
let mut vec: Vec<f64> = read_vec();
(vec[0], vec[1])
}
fn readcc() -> (char, char) {
let mut vec: Vec<char> = read_vec();
(vec[0], vec[1])
}
fn readuuu() -> (usize, usize, usize) {
let mut vec: Vec<usize> = read_vec();
(vec[0], vec[1], vec[2])
}
#[allow(dead_code)]
fn readiiii() -> (i64, i64, i64, i64) {
let mut vec: Vec<i64> = read_vec();
(vec[0], vec[1], vec[2], vec[3])
}
#[allow(dead_code)]
fn readuuuu() -> (usize, usize, usize, usize) {
let mut vec: Vec<usize> = read_vec();
(vec[0], vec[1], vec[2], vec[3])
}
pub struct SEG<M: Monoid> {
n: usize,
buf: Vec<M::T>,
}
impl<M: Monoid> SEG<M> {
#[allow(dead_code)]
pub fn new(n: usize) -> SEG<M> {
SEG {
n,
buf: vec![M::id(); 2 * n],
}
}
#[allow(dead_code)]
pub fn update(&mut self, k: usize, a: M::T) {
let mut k = k + self.n;
self.buf[k] = a;
while k > 0 {
k >>= 1;
self.buf[k] = M::op(&self.buf[k << 1], &self.buf[(k << 1) | 1]);
}
}
#[allow(dead_code)]
pub fn add(&mut self, k: usize, a: &M::T) {
let mut k = k + self.n;
self.buf[k] = M::op(&self.buf[k], a);
while k > 0 {
k >>= 1;
self.buf[k] = M::op(&self.buf[k << 1], &self.buf[(k << 1) | 1]);
}
}
#[allow(dead_code)]
pub fn get(&self, i: usize) -> M::T {
self.query(i, i + 1)
}
#[allow(dead_code)]
pub fn query_range<R: std::ops::RangeBounds<usize>>(&self, range: R) -> M::T {
let l = match range.start_bound() {
std::ops::Bound::Excluded(&x) => {
assert!(x > 0);
x - 1
}
std::ops::Bound::Included(&x) => x,
std::ops::Bound::Unbounded => 0,
};
let r = match range.end_bound() {
std::ops::Bound::Excluded(&x) => x,
std::ops::Bound::Included(&x) => (x + 1),
std::ops::Bound::Unbounded => self.n,
};
self.query(l, r)
}
#[allow(dead_code)]
pub fn query(&self, l: usize, r: usize) -> M::T {
let mut vl = M::id();
let mut vr = M::id();
let mut l = l + self.n;
let mut r = r + self.n;
while l < r {
if l & 1 == 1 {
vl = M::op(&vl, &self.buf[l]);
l += 1;
}
if r & 1 == 1 {
r -= 1;
vr = M::op(&self.buf[r], &vr);
}
l >>= 1;
r >>= 1;
}
M::op(&vl, &vr)
}
}
pub trait Monoid {
type T: Clone;
fn id() -> Self::T;
fn op(a: &Self::T, b: &Self::T) -> Self::T;
}
pub enum MON {}
impl Monoid for MON {
type T = usize;
fn id() -> Self::T {
0
}
fn op(a: &Self::T, b: &Self::T) -> Self::T {
*a + *b
}
}
fn main() {
let (n, q, mut ll) = readuuu();
let mut vec: Vec<usize> = read_vec();
let mut seg1 = SEG::<MON>::new(202020);
let mut seg2 = SEG::<MON>::new(202020);
for i in 0..n {
let x = vec[i];
let val = seg1.query(x, x + 1);
seg1.update(x, val + 1);
let val = seg2.query(x, x + 1);
seg2.update(x, val + x);
}
let mut querry2_done = false;
for _ in 0..q {
let mut querry: Vec<usize> = read_vec();
d!(querry);
if querry[0] == 1 {
let l = querry[1];
let val = seg1.query(l, l + 1);
seg1.update(l, val + 1);
let val = seg2.query(l, l + 1);
seg2.update(l, val + l);
} else if querry[0] == 2 {
let l = querry[1];
let r = querry[2] + 1;
let mut su1 = seg1.query_range(l..r);
let mut su2 = seg2.query_range(l..r);
println!("{} {}", su1, su2);
querry2_done = true;
} else {
ll = querry[1];
}
}
if !querry2_done {
println!("Not Found!");
}
return;
}