結果
| 問題 | No.1373 Directed Operations |
| ユーザー |
 Moss_Local
|
| 提出日時 | 2021-02-05 21:58:41 |
| 言語 | Rust (1.77.0) |
| 結果 |
AC
|
| 実行時間 | 163 ms / 2,000 ms |
| コード長 | 7,352 bytes |
| コンパイル時間 | 798 ms |
| コンパイル使用メモリ | 155,416 KB |
| 実行使用メモリ | 6,908 KB |
| 最終ジャッジ日時 | 2023-09-15 08:08:38 |
| 合計ジャッジ時間 | 3,683 ms |
|
ジャッジサーバーID （参考情報） |
judge14 / judge12 |
（要ログイン）
テストケース
テストケース表示| 入力 | 結果 | 実行時間 実行使用メモリ |
|---|---|---|
| testcase_00 | AC | 1 ms
4,380 KB |
| testcase_01 | AC | 1 ms
4,376 KB |
| testcase_02 | AC | 134 ms
6,820 KB |
| testcase_03 | AC | 4 ms
4,380 KB |
| testcase_04 | AC | 6 ms
4,376 KB |
| testcase_05 | AC | 1 ms
4,380 KB |
| testcase_06 | AC | 161 ms
6,880 KB |
| testcase_07 | AC | 5 ms
4,380 KB |
| testcase_08 | AC | 19 ms
4,380 KB |
| testcase_09 | AC | 6 ms
4,376 KB |
| testcase_10 | AC | 5 ms
4,380 KB |
| testcase_11 | AC | 2 ms
4,380 KB |
| testcase_12 | AC | 5 ms
4,376 KB |
| testcase_13 | AC | 2 ms
4,376 KB |
| testcase_14 | AC | 163 ms
6,908 KB |
| testcase_15 | AC | 142 ms
6,252 KB |
| testcase_16 | AC | 161 ms
6,900 KB |
| testcase_17 | AC | 107 ms
5,648 KB |
| testcase_18 | AC | 61 ms
4,464 KB |
| testcase_19 | AC | 65 ms
4,380 KB |
| testcase_20 | AC | 89 ms
4,844 KB |
コンパイルメッセージ
warning: unnecessary parentheses around type
--> Main.rs:45:15
|
45 | fn readi() -> (i64) {
| ^ ^
|
= note: `#[warn(unused_parens)]` on by default
help: remove these parentheses
|
45 - fn readi() -> (i64) {
45 + fn readi() -> i64 {
|
warning: unnecessary parentheses around `if` condition
--> Main.rs:203:20
|
203 | if (res[nv.0][nv.1] > res[v.0][v.1] + d) {
| ^ ^
|
help: remove these parentheses
|
203 - if (res[nv.0][nv.1] > res[v.0][v.1] + d) {
203 + if res[nv.0][nv.1] > res[v.0][v.1] + d {
|
warning: unnecessary parentheses around `for` iterator expression
--> Main.rs:226:14
|
226 | for i in (1..n - 1) {
| ^ ^
|
help: remove these parentheses
|
226 - for i in (1..n - 1) {
226 + for i in 1..n - 1 {
|
warning: unnecessary parentheses around `for` iterator expression
--> Main.rs:230:14
|
230 | for i in (1..n) {
| ^ ^
|
help: remove these parentheses
|
230 - for i in (1..n) {
230 + for i in 1..n {
|
warning: value assigned to `d` is never read
--> Main.rs:197:25
|
197 | let mut d = 1;
| ^
|
= help: maybe it is overwritten before being read?
= note: `#[warn(unused_assignments)]` on by default
warning: unused variable: `m`
--> Main.rs:221:13
|
221 | let mut m = 101010;
| ^ help: if this is intentional, prefix it with an underscore: `_m`
|
= note: `#[warn(unused_variables)]` on by default
warning: variable does not need to be mutable
--> Main.rs:220:9
|
220 | let mut vec: Vec<usize> = read_vec();
| ----^^^
| |
| help: remove this `mut`
|
= note: `#[warn(unused_mut)]` on by default
warning: variable does not need to be mutable
--> Main.rs:221:9
|
2
ソースコード
// -*- coding:utf-8-unix -*-
#![allow(dead_code)]
#![allow(unused_imports)]
use std::collections::*;
use std::convert::*;
use std::convert::{From, Into};
use std::fmt::Debug;
use std::fs::File;
use std::io::prelude::*;
use std::io::*;
use std::marker::Copy;
use std::mem::*;
use std::ops::Bound::*;
use std::ops::{Add, Mul, Neg, Sub};
use std::str;
use std::vec;
use std::{cmp, process::Output};
use std::{cmp::Ordering, env::consts::DLL_PREFIX};
use std::{cmp::Ordering::*, f32::consts::PI};
const INF: i64 = 1223372036854775807;
const FINF: f64 = 122337203685.0;
const LINF: i64 = 2147483647;
const UINF: usize = INF as usize;
const MEM_SIZE: usize = 202020;
// const MOD: i64 = 1000000007;
const MOD: i64 = 998244353;
const UMOD: usize = MOD as usize;
use std::cmp::*;
use std::collections::*;
use std::io::stdin;
use std::io::stdout;
use std::io::Write;
// use str::Chars;
#[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 readi() -> (i64) {
let mut str = String::new();
let _ = stdin().read_line(&mut str).unwrap();
let mut iter = str.split_whitespace();
iter.next().unwrap().parse::<i64>().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_vec2<T: std::str::FromStr>(n: u32) -> Vec<Vec<T>> {
(0..n).map(|_| read_vec()).collect()
}
#[allow(dead_code)]
fn readii() -> (i64, i64) {
let mut str = String::new();
let _ = stdin().read_line(&mut str).unwrap();
let mut iter = str.split_whitespace();
(
iter.next().unwrap().parse::<i64>().unwrap(),
iter.next().unwrap().parse::<i64>().unwrap(),
)
}
fn readff() -> (f64, f64) {
let mut str = String::new();
let _ = stdin().read_line(&mut str).unwrap();
let mut iter = str.split_whitespace();
(
iter.next().unwrap().parse::<f64>().unwrap(),
iter.next().unwrap().parse::<f64>().unwrap(),
)
}
#[allow(dead_code)]
fn readiii() -> (i64, i64, i64) {
let mut str = String::new();
let _ = stdin().read_line(&mut str).unwrap();
let mut iter = str.split_whitespace();
(
iter.next().unwrap().parse::<i64>().unwrap(),
iter.next().unwrap().parse::<i64>().unwrap(),
iter.next().unwrap().parse::<i64>().unwrap(),
)
}
#[allow(dead_code)]
fn readuu() -> (usize, usize) {
let mut str = String::new();
let _ = stdin().read_line(&mut str).unwrap();
let mut iter = str.split_whitespace();
(
iter.next().unwrap().parse::<usize>().unwrap(),
iter.next().unwrap().parse::<usize>().unwrap(),
)
}
fn readcc() -> (char, char) {
let mut str = String::new();
let _ = stdin().read_line(&mut str).unwrap();
let mut iter = str.split_whitespace();
(
iter.next().unwrap().parse::<char>().unwrap(),
iter.next().unwrap().parse::<char>().unwrap(),
)
}
#[allow(dead_code)]
fn readuuu() -> (usize, usize, usize) {
let mut str = String::new();
let _ = stdin().read_line(&mut str).unwrap();
let mut iter = str.split_whitespace();
(
iter.next().unwrap().parse::<usize>().unwrap(),
iter.next().unwrap().parse::<usize>().unwrap(),
iter.next().unwrap().parse::<usize>().unwrap(),
)
}
#[allow(dead_code)]
fn readuuuu() -> (usize, usize, usize, usize) {
let mut str = String::new();
let _ = stdin().read_line(&mut str).unwrap();
let mut iter = str.split_whitespace();
(
iter.next().unwrap().parse::<usize>().unwrap(),
iter.next().unwrap().parse::<usize>().unwrap(),
iter.next().unwrap().parse::<usize>().unwrap(),
iter.next().unwrap().parse::<usize>().unwrap(),
)
}
fn readiiii() -> (i64, i64, i64, i64) {
let mut str = String::new();
let _ = stdin().read_line(&mut str).unwrap();
let mut iter = str.split_whitespace();
(
iter.next().unwrap().parse::<i64>().unwrap(),
iter.next().unwrap().parse::<i64>().unwrap(),
iter.next().unwrap().parse::<i64>().unwrap(),
iter.next().unwrap().parse::<i64>().unwrap(),
)
}
fn readin() -> (i64, i64, i64, i64, i64, i64) {
let mut str = String::new();
let _ = stdin().read_line(&mut str).unwrap();
let mut iter = str.split_whitespace();
(
iter.next().unwrap().parse::<i64>().unwrap(),
iter.next().unwrap().parse::<i64>().unwrap(),
iter.next().unwrap().parse::<i64>().unwrap(),
iter.next().unwrap().parse::<i64>().unwrap(),
iter.next().unwrap().parse::<i64>().unwrap(),
iter.next().unwrap().parse::<i64>().unwrap(),
)
}
fn grid_01bfs(mat: &Vec<Vec<usize>>, start: (usize, usize)) -> Vec<Vec<usize>> {
let h = mat.len();
let w = mat[0].len();
let mut res = vec![vec![INF as usize; (w) as usize]; (h) as usize];
let mut q = VecDeque::new();
q.push_back(start);
res[start.0][start.1] = 0;
while !q.is_empty() {
let v = q.pop_front().unwrap();
for i in -1..=1 {
for j in -1..=1 {
if (i * j as i32).abs() == 1 || (i == 0 && j == 0) {
continue;
}
if v.0 == 0 && i == -1 {
continue;
}
if v.0 == h - 1 && i == 1 {
continue;
}
if v.1 == 0 && j == -1 {
continue;
}
if v.1 == w - 1 && j == 1 {
continue;
}
let nv = ((v.0 as i32 + i) as usize, (v.1 as i32 + j) as usize);
let mut d = 1;
if mat[nv.0][nv.1] == 1 {
d = 1;
} else {
d = 0;
}
if (res[nv.0][nv.1] > res[v.0][v.1] + d) {
res[nv.0][nv.1] = res[v.0][v.1] + d;
if d == 0 {
q.push_front(nv);
} else {
q.push_back(nv);
}
}
}
}
}
return res;
}
fn solve() {
let n: usize = read();
let mut vec: Vec<usize> = read_vec();
let mut m = 101010;
let mut data = vec![0; 101010];
for i in 0..n - 1 {
data[vec[i]] += 1;
}
for i in (1..n - 1) {
data[i + 1] += data[i];
}
let mut cnt = 1;
for i in (1..n) {
// vec[i] += vec[i + 1];
if cnt > data[i] {
println!("{}", "NO");
return;
}
cnt += 1;
}
let mut vp = vec![(0, 0); 0];
for i in 0..n - 1 {
vp.push((vec[i], i));
}
vp.sort();
// vp.reverse();
let mut pos = 2 as usize;
// for i in 0..n - 1 {
// println!("{} ", i + 1);
// }
let mut res = vec![(0, 0); 0];
for i in 0..n - 1 {
if pos < vp[i].0 {
println!("{}", "NO");
return;
}
res.push((vp[i].1, pos - vp[i].0));
pos += 1;
}
res.sort();
println!("{}", "YES");
for i in 0..n - 1 {
println!("{:?}", res[i].1);
}
return;
}
fn main() {
solve()
}