CSES - Datatähti 2020 loppu

Submission details
Task:	Riippuliito
Sender:	Aleksi Hannula
Submission time:	2020-02-09 16:18:42 +0200
Language:	Rust
Status:	READY
Result:	39

Feedback
group	verdict	score
#1	ACCEPTED	18
#2	ACCEPTED	21
#3	TIME LIMIT EXCEEDED	0

Test results
test	verdict	time	group
#1	ACCEPTED	0.01 s	1, 2, 3	details
#2	ACCEPTED	0.01 s	1, 2, 3	details
#3	ACCEPTED	0.01 s	1, 2, 3	details
#4	ACCEPTED	0.01 s	1, 2, 3	details
#5	ACCEPTED	0.01 s	1, 2, 3	details
#6	ACCEPTED	0.01 s	1, 2, 3	details
#7	ACCEPTED	0.01 s	1, 2, 3	details
#8	ACCEPTED	0.01 s	2, 3	details
#9	ACCEPTED	0.02 s	2, 3	details
#10	ACCEPTED	0.02 s	2, 3	details
#11	ACCEPTED	0.01 s	2, 3	details
#12	ACCEPTED	0.01 s	2, 3	details
#13	ACCEPTED	0.01 s	2, 3	details
#14	ACCEPTED	0.02 s	2, 3	details
#15	ACCEPTED	0.02 s	3	details
#16	TIME LIMIT EXCEEDED	--	3	details
#17	TIME LIMIT EXCEEDED	--	3	details
#18	ACCEPTED	0.03 s	3	details
#19	ACCEPTED	0.04 s	3	details
#20	TIME LIMIT EXCEEDED	--	3	details
#21	TIME LIMIT EXCEEDED	--	3	details
#22	ACCEPTED	0.01 s	1, 2, 3	details
#23	ACCEPTED	0.01 s	1, 2, 3	details
#24	ACCEPTED	0.01 s	1, 2, 3	details
#25	ACCEPTED	0.01 s	1, 2, 3	details
#26	ACCEPTED	0.01 s	1, 2, 3	details
#27	ACCEPTED	0.01 s	1, 2, 3	details
#28	ACCEPTED	0.01 s	1, 2, 3	details
#29	ACCEPTED	0.01 s	1, 2, 3	details

Code

#[derive(Clone, Copy, Debug)]
struct HuippuData(Option<usize>, Option<usize>);

// Jokaiselta huipulta voi liitaa kahteen suuntaan (ikaan kuin binaaripuu), ja se suunta, jossa on enemman vuoria, on parempi

/*struct Huippu {
    korkeus: usize,
    vasen: Option<Rc<Huippu>>,
    oikea: Option<Rc<Huippu>>,
}

fn korkein_mahd_huippu(kanta: &Huippu, max_korkeus: usize) -> Option<Rc<Huippu>> {
    let vasen_max = match &kanta.vasen {
        None => None,
        Some(vasen) => {
            if vasen.korkeus < max_korkeus {
                Some(kanta.vasen.as_ref().clone())
            } else {
                korkein_mahd_huippu(&vasen, max_korkeus)
            }
        }
    };

    let oikea_max = match &kanta.oikea {
        None => None,
        Some(oikea) => {
            if oikea.korkeus < max_korkeus {
                Some(kanta.oikea.as_ref().clone())
            } else {
                korkein_mahd_huippu(&oikea, max_korkeus)
            }
        }
    };

    match oikea_max {
        None => vasen_max,
        Some(oikea) => match vasen_max {
            None => Some(oikea),
            Some(vasen) => {
                if vasen.korkeus > oikea.korkeus {
                    return Some(vasen);
                }
                Some(oikea)
            },
        }
    }
}

fn lisaa_huippu_jalkeen(kanta: &mut Huippu, uusi: Huippu) {
    let nyt_kanta = kanta;
    while kanta.oikea.is_some() {
        nyt_kanta = &mut nyt_kanta.oikea.unwrap();
    }

    uusi.vasen = match kanta.oikea {
        Some(oikea) => korkein_mahd_huippu(&oikea, kanta.korkeus),
        None => None,
    };

    kanta.oikea = Some(Rc::new(uusi));
}*/

fn tee_hyppy(huippudata: &mut [HuippuData], korkeudet: &[usize], osoitin: usize, pituus: usize) -> usize {
    if korkeudet.len() == 0 {
        return pituus;
    }

    let huippu_kork = korkeudet.iter().enumerate().fold((0, 0), |acc, x| {
        if *x.1 > acc.1 {
            return (x.0, *x.1);
        }
        return acc;
    }).1;

    let mut korkein_hyppy = 0;
    let mahd_hypyt = korkeudet.rsplit(|&x| x == huippu_kork).collect::<Vec<_>>();
    if mahd_hypyt.len() < 2 {
        return pituus;
    }

    for mahd_vuoret in mahd_hypyt {
        korkein_hyppy = std::cmp::max(korkein_hyppy, tee_hyppy(huippudata, mahd_vuoret, osoitin, pituus + 1));
    }

    return korkein_hyppy;
}

fn main() {
    let mut lkm_str = String::new();
    std::io::stdin().read_line(&mut lkm_str).unwrap();
    let lkm = lkm_str.trim().parse::<usize>().unwrap();

    let mut korkeudet_str = String::new();
    std::io::stdin().read_line(&mut korkeudet_str).unwrap();
    /*for kork in korkeudet_str.split_whitespace() {
        let korkeus = kork.trim().parse::<usize>().unwrap();
        
        // uusi korkein huippu
        if korkeus > nyk_huippu.korkeus {
            let o_nyk_huippu = nyk_huippu;
            nyk_huippu = Huippu{
                korkeus,
                vasen: Some(Rc::new(o_nyk_huippu)),
                oikea: None,
            };
        } else {
            lisaa_huippu_jalkeen(&mut nyk_huippu, Huippu{korkeus, vasen: None, oikea: None});
        }
    }*/
    let mut huippudata = std::iter::repeat(HuippuData(None, None)).take(lkm).collect::<Vec<HuippuData>>();
    let korkeudet = korkeudet_str.split_whitespace().map(|x| x.trim().parse::<usize>().unwrap()).collect::<Vec<usize>>();
    //keraa_huippudata(&mut huippudata, &korkeudet, 0);
    println!("{}", tee_hyppy(&mut huippudata, &korkeudet, 0, 0));

    /*
     * // Lista "kantamasta", jonka verran huipulta voi lentää
    let mut huipulta_paasee_vas = Vec::with_capacity(lkm);
    let mut huipulta_paasee_oik = Vec::with_capacity(lkm);
    for i in 0..lkm {
        let mut max_oikealle_huiput = 1;
        for j in (i+1)..lkm {
            if korkeudet[j] >= korkeudet[i] {
                break;
            }
            max_oikealle_huiput += 1;
        }

        let mut max_vasemmalle_huiput = 1;

        if i != 0 {
            for j in (0..=(i-1)).rev() {
                if korkeudet[j] >= korkeudet[i] {
                    break;
                }
                max_vasemmalle_huiput += 1;
            }
        }

        huipulta_paasee_vas.push(max_vasemmalle_huiput);
        huipulta_paasee_oik.push(max_oikealle_huiput);
    }*/

}

Test details

Test 1

Group: 1, 2, 3

Verdict: ACCEPTED

input
`10 1 1 1 1 1 1 1 1 1 1` view save

correct output
`1` view save

user output
`1` view save

Test 2

Group: 1, 2, 3

Verdict: ACCEPTED

input
`10 1 2 3 4 5 6 7 8 9 10` view save

correct output
`10` view save

user output
`10` view save

Test 3

Group: 1, 2, 3

Verdict: ACCEPTED

input
`10 10 9 8 7 6 5 4 3 2 1` view save

correct output
`10` view save

user output
`10` view save

Test 4

Group: 1, 2, 3

Verdict: ACCEPTED

input
`10 10 9 6 10 10 3 6 7 6 5` view save

correct output
`4` view save

user output
`4` view save

Test 5

Group: 1, 2, 3

Verdict: ACCEPTED

input
`10 51 90 27 98 85 47 14 55 82 52` view save

correct output
`6` view save

user output
`6` view save

Test 6

Group: 1, 2, 3

Verdict: ACCEPTED

input
`10 9 65 90 86 45 52 52 95 40 85` view save

correct output
`5` view save

user output
`5` view save

Test 7

Group: 1, 2, 3

Verdict: ACCEPTED

input
`10 3 46 77 16 59 32 22 41 87 89` view save

correct output
`7` view save

user output
`7` view save

Test 8

Group: 2, 3

Verdict: ACCEPTED

input
`5000 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ...` view save

correct output
`1` view save

user output
`1` view save

Test 9

Group: 2, 3

Verdict: ACCEPTED

input
`5000 1 2 3 4 5 6 7 8 9 10 11 12 13 ...` view save

correct output
`5000` view save

user output
`5000` view save

Test 10

Group: 2, 3

Verdict: ACCEPTED

input
`5000 5000 4999 4998 4997 4996 4995 ...` view save

correct output
`5000` view save

user output
`5000` view save

Test 11

Group: 2, 3

Verdict: ACCEPTED

input
`5000 10 8 10 5 4 9 2 9 10 10 1 2 7 ...` view save

correct output
`9` view save

user output
`9` view save

Test 12

Group: 2, 3

Verdict: ACCEPTED

input
`5000 655923386 310000737 281882248 ...` view save

correct output
`28` view save

user output
`28` view save

Test 13

Group: 2, 3

Verdict: ACCEPTED

input
`5000 123456789 123456790 123456791 ...` view save

correct output
`2706` view save

user output
`2706` view save

Test 14

Group: 2, 3

Verdict: ACCEPTED

input
`5000 123456789 123456790 123456791 ...` view save

correct output
`5000` view save

user output
`5000` view save

Test 15

Group: 3

Verdict: ACCEPTED

input
`200000 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 ...` view save

correct output
`1` view save

user output
`1` view save

Test 16

Group: 3

Verdict: TIME LIMIT EXCEEDED

input
`200000 1 2 3 4 5 6 7 8 9 10 11 12 13 ...` view save

correct output
`200000` view save

user output
(empty)

Test 17

Group: 3

Verdict: TIME LIMIT EXCEEDED

input
`200000 200000 199999 199998 199997 19...` view save

correct output
`200000` view save

user output
(empty)

Test 18

Group: 3

Verdict: ACCEPTED

input
`200000 4 7 8 3 3 10 3 4 2 6 10 8 5 8 ...` view save

correct output
`10` view save

user output
`10` view save

Test 19

Group: 3

Verdict: ACCEPTED

input
`200000 824527039 112439661 517794857 ...` view save

correct output
`43` view save

user output
`43` view save

Test 20

Group: 3

Verdict: TIME LIMIT EXCEEDED

input
`200000 123456789 123456790 123456791 ...` view save

correct output
`30764` view save

user output
(empty)

Test 21

Group: 3

Verdict: TIME LIMIT EXCEEDED

input
`200000 123456789 123456790 123456791 ...` view save

correct output
`61367` view save

user output
(empty)

Test 22

Group: 1, 2, 3

Verdict: ACCEPTED

input
`1 1` view save

correct output
`1` view save

user output
`1` view save

Test 23

Group: 1, 2, 3

Verdict: ACCEPTED

input
`2 1 1` view save

correct output
`1` view save

user output
`1` view save

Test 24

Group: 1, 2, 3

Verdict: ACCEPTED

input
`2 1 2` view save

correct output
`2` view save

user output
`2` view save

Test 25

Group: 1, 2, 3

Verdict: ACCEPTED

input
`2 2 1` view save

correct output
`2` view save

user output
`2` view save

Test 26

Group: 1, 2, 3

Verdict: ACCEPTED

input
`3 1 2 1` view save

correct output
`2` view save

user output
`2` view save

Test 27

Group: 1, 2, 3

Verdict: ACCEPTED

input
`3 1 2 3` view save

correct output
`3` view save

user output
`3` view save

Test 28

Group: 1, 2, 3

Verdict: ACCEPTED

input
`3 3 2 1` view save

correct output
`3` view save

user output
`3` view save

Test 29

Group: 1, 2, 3

Verdict: ACCEPTED

input
`3 2 1 2` view save

correct output
`2` view save

user output
`2` view save

Datatähti 2020 loppu

Riippuliito

Code

Test details

Test 1

Test 2

Test 3

Test 4

Test 5

Test 6

Test 7

Test 8

Test 9

Test 10

Test 11

Test 12

Test 13

Test 14

Test 15

Test 16

Test 17

Test 18

Test 19

Test 20

Test 21

Test 22

Test 23

Test 24

Test 25

Test 26

Test 27

Test 28

Test 29

Tasks

Submissions (Aleksi Hannula)