IOI '18 P6 - Meetings

This is an educational contest revolving around the IOI problem Meetings. Problems will be uploaded over time.

Data may change without notice to ensure only intended solutions pass.


Comments


  • -2
    Ket  commented on Oct. 24, 2018, 7:21 p.m. edited

    what is this?


    • -6
      loltrollkill  commented on Oct. 24, 2018, 8:50 p.m.

      This is an educational contest revolving around the IOI problem Meetings.


  • 1
    zoomswk  commented on Oct. 16, 2018, 10:38 a.m. edited

    My very simple O(N^2) keeps getting TLE...

    EDIT: Just managed to squeeze the thing into the time limit, but it was a pain in the ass. It'd be great if the time limit was less strict.


    • 1
      wleung_bvg  commented on Oct. 16, 2018, 11:31 a.m.

      I believe the author is using a time limit of 1.5x the reference solution


      • 1
        zoomswk  commented on Oct. 16, 2018, 4:24 p.m. edited

        Hmm, that's good to know. I basically changed a loop with N^2 iterations to one with N(N+1)/2 iterations and passed with ~2.0-2.1s (it was >2.5s previously), which is very weird.

        Anyway, do you know when newer versions are coming? :)


  • 3
    dawangk  commented on Oct. 11, 2018, 8:57 p.m. edited

    HEY!!!!!!

    Why is this contest so long?

    I just want an answer!!!

    please!

    Then you can delete my question


    • 2
      rpeng  commented on Oct. 14, 2018, 1:40 p.m.

      We were planning to add more content as the easier versions get solved, with a series of accompanying blog posts. This problem uses a large portion of the data structures tricks in the books, so is very useful to know well.


      • 1
        dawangk  commented on Oct. 14, 2018, 5:34 p.m.

        Thanks