提出 #59307203

---

ソースコード 拡げる

#![allow(non_snake_case)]
#![allow(unused_imports)]
#![allow(unused_macros)]
#![allow(clippy::needless_range_loop)]
#![allow(clippy::comparison_chain)]
#![allow(clippy::nonminimal_bool)]
#![allow(clippy::neg_multiply)]
use ac_library::*;
use amplify::confinement::Collection;
use itertools::{CombinationsWithReplacement, Itertools};
use lazy_static::lazy_static;
use libm::{ceil, log};
use num::{integer::Roots, traits::Pow, ToPrimitive};
use num_bigint::BigInt;
use num_integer::{div_ceil, Integer};
use proconio::marker::{Chars, Usize1};
use proconio::{input, source::line::LineSource};
use std::collections::{BTreeSet, BinaryHeap, HashMap, HashSet, VecDeque};
use std::convert::From;
use std::f64::consts::PI;
use std::hash::Hash;
use std::mem::swap;
use std::ops::Index;
use std::ops::Mul;
use std::{io::*, string};

fn solve() {
    #[rustfmt::skip]
    input! {
        N:usize,
         A:[usize; N - 1],
         B:[usize; N - 2]
    }
    let mut dp = vec![1 << 60; N];
    dp[0] = 0;
    for i in 0..N {
        if i >= 1 {
            dp[i] = dp[i].min(dp[i - 1] + A[i - 1]);
        }
        if i >= 2 {
            dp[i] = dp[i].min(dp[i - 2] + B[i - 2]);
        }
    }
    let mut ans = vec![];
    let mut now = N - 1;
    while now > 0 {
        if now >= 1 && dp[now - 1] + A[now - 1] == dp[now] {
            ans.push(now + 1);
            now = now - 1;
        } else if now >= 2 && dp[now - 2] + B[now - 2] == dp[now] {
            ans.push(now + 1);
            now = now - 2;
        }
    }
    ans.push(1);
    ans.reverse();
    println!("{}", ans.len());
    println!("{}", ans.iter().join(" "));
}

fn main() {
    // input! {N:usize}
    // for _ in 0..N {
    //     solve();
    // }
    solve();
}

提出情報

ジャッジ結果