結果
| 問題 |
No.1170 Never Want to Walk
|
| コンテスト | |
| ユーザー |
 o2c
|
| 提出日時 | 2020-09-22 17:22:29 |
| 言語 | Rust (1.83.0 + proconio) |
| 結果 |
TLE
|
| 実行時間 | - |
| コード長 | 4,281 bytes |
| コンパイル時間 | 15,910 ms |
| コンパイル使用メモリ | 377,820 KB |
| 実行使用メモリ | 18,532 KB |
| 最終ジャッジ日時 | 2024-06-26 07:07:40 |
| 合計ジャッジ時間 | 23,442 ms |
|
ジャッジサーバーID （参考情報） |
judge3 / judge2 |
（要ログイン）
| ファイルパターン | 結果 |
|---|---|
| sample | AC * 2 |
| other | AC * 30 TLE * 1 -- * 6 |
コンパイルメッセージ
warning: variable does not need to be mutable
--> src/main.rs:8:338
|
8 | ...es !read {($($t :tt ) ,*;$n :expr ) =>{{let stdin =::std ::io ::stdin () ;let ret =::std ::io ::BufRead ::lines (stdin .lock () ) .take ($n ) .map (|line |{let line =line .unwrap () ;let mut it =line .split_whitespace () ;_read !(it ;$($t ) ,*) } ) .collect ::<Vec <_ >>() ;ret } } ;($($t :tt ) ,*) =>{{let line =readln () ;let mut it =l...
| ----^^
| |
| help: remove this `mut`
...
77 | ... = read!([i64]);
| ------------ in this macro invocation
|
= note: `#[warn(unused_mut)]` on by default
= note: this warning originates in the macro `read` (in Nightly builds, run with -Z macro-backtrace for more info)
ソースコード
#![allow(unused_imports)]
use {std::cmp::*, std::collections::*, std::io::Write, std::ops::*};
#[allow(unused_macros)]
macro_rules !dbg {($($e :expr ) ,*) =>{#[cfg (debug_assertions ) ] $({let (e ,mut err ) =(stringify !($e ) ,std ::io ::stderr () ) ;writeln !(err ,"{} = {:?}" ,e ,$e ) .unwrap () } ) *} ;}
#[rustfmt::skip] pub fn readln() -> String { let mut line = String::new(); ::std::io::stdin() .read_line(&mut line) .unwrap_or_else(|e| panic!("{}", e)); line }
#[allow(unused_macros)]
macro_rules !read {($($t :tt ) ,*;$n :expr ) =>{{let stdin =::std ::io ::stdin () ;let ret =::std ::io ::BufRead ::lines (stdin .lock () ) .take ($n ) .map (|line |{let line =line .unwrap () ;let mut it =line .split_whitespace () ;_read !(it ;$($t ) ,*) } ) .collect ::<Vec <_ >>() ;ret } } ;($($t :tt ) ,*) =>{{let line =readln () ;let mut it =line .split_whitespace () ;_read !(it ;$($t ) ,*) } } ;}
#[allow(unused_macros)]
macro_rules !_read {($it :ident ;[char ] ) =>{_read !($it ;String ) .chars () .collect ::<Vec <_ >>() } ;($it :ident ;[u8 ] ) =>{Vec ::from (_read !($it ;String ) .into_bytes () ) } ;($it :ident ;usize1 ) =>{$it .next () .unwrap_or_else (||panic !("input mismatch" ) ) .parse ::<usize >() .unwrap_or_else (|e |panic !("{}" ,e ) ) -1 } ;($it :ident ;[usize1 ] ) =>{$it .map (|s |s .parse ::<usize >() .unwrap_or_else (|e |panic !("{}" ,e ) ) -1 ) .collect ::<Vec <_ >>() } ;($it :ident ;[$t :ty ] ) =>{$it .map (|s |s .parse ::<$t >() .unwrap_or_else (|e |panic !("{}" ,e ) ) ) .collect ::<Vec <_ >>() } ;($it :ident ;$t :ty ) =>{$it .next () .unwrap_or_else (||panic !("input mismatch" ) ) .parse ::<$t >() .unwrap_or_else (|e |panic !("{}" ,e ) ) } ;($it :ident ;$($t :tt ) ,+) =>{($(_read !($it ;$t ) ) ,*) } ;}
#[allow(unused_macros)]
macro_rules !min {($a :expr $(,) *) =>{{$a } } ;($a :expr ,$b :expr $(,) *) =>{{std ::cmp ::min ($a ,$b ) } } ;($a :expr ,$($rest :expr ) ,+$(,) *) =>{{std ::cmp ::min ($a ,min !($($rest ) ,+) ) } } ;}
#[allow(unused_macros)]
macro_rules !chmin {($base :expr ,$($cmps :expr ) ,+$(,) *) =>{{let cmp_min =min !($($cmps ) ,+) ;if $base >cmp_min {$base =cmp_min ;true } else {false } } } ;}
#[allow(unused_macros)]
macro_rules !max {($a :expr $(,) *) =>{{$a } } ;($a :expr ,$b :expr $(,) *) =>{{std ::cmp ::max ($a ,$b ) } } ;($a :expr ,$($rest :expr ) ,+$(,) *) =>{{std ::cmp ::max ($a ,max !($($rest ) ,+) ) } } ;}
#[allow(unused_macros)]
macro_rules !chmax {($base :expr ,$($cmps :expr ) ,+$(,) *) =>{{let cmp_max =max !($($cmps ) ,+) ;if $base <cmp_max {$base =cmp_max ;true } else {false } } } ;}
struct UnionFind {
n: usize,
par: Vec<usize>,
rank: Vec<usize>,
}
impl UnionFind {
fn new(n: usize) -> Self {
UnionFind {
n,
par: (0..n).collect(),
rank: vec![1; n],
}
}
fn unite(&mut self, x: usize, y: usize) {
if self.same(x, y) {
return;
}
let rx = self.par[x];
let ry = self.par[y];
if self.rank[rx] > self.rank[ry] {
self.par[ry] = rx;
self.rank[rx] += self.rank[ry];
} else {
self.par[rx] = ry;
self.rank[ry] += self.rank[rx];
}
}
fn same(&mut self, x: usize, y: usize) -> bool {
self.root(x) == self.root(y)
}
fn root(&mut self, x: usize) -> usize {
if self.par[x] == x {
x
} else {
self.par[x] = self.root(self.par[x]);
self.par[x]
}
}
#[allow(dead_code)]
fn size(&mut self, x: usize) -> usize {
let r = self.root(x);
self.rank[r]
}
#[allow(dead_code)]
fn sizes(&mut self) -> Vec<usize> {
let mut s = vec![];
for x in 0..self.n {
if x == self.root(x) {
s.push(self.rank[x]);
}
}
s
}
}
fn main() {
let (n, a, b) = read!(usize, i64, i64);
let x = read!([i64]);
let mut set = std::collections::BTreeSet::<(i64, usize)>::new();
for i in 0..n {
set.insert((x[i], i));
}
let mut uf = UnionFind::new(n);
for i in 0..n {
for &(_, j) in set.range((x[i] + a, 0)..=(x[i] + b, n)) {
uf.unite(i, j);
}
}
for i in 0..n {
println!("{}", uf.size(i));
}
}