Discussion @ 1613. For Fans of Statistics @ Timus Online Judge

nadinne Accepted map<int, set<int> > + lower_bound 0.499 [4] // Problem 1613. For Fans of Statistics 6 Feb 2016 13:30

Edited by author 06.02.2016 13:30

Edited by author 06.02.2016 13:38

ToadMonster Re: Accepted map<int, set<int> > + lower_bound 0.499 // Problem 1613. For Fans of Statistics 8 Feb 2016 15:24

My result is 0.1 sec, 700 Kb memory usage.

I used VS 2013 (probably its IO works quicker then gcc), C-style (printf/scanf) IO, sorted vector of pairs (count_of_passengers, city_number).

alexey saybel Re: Accepted map<int, set<int> > + lower_bound 0.499 [2] // Problem 1613. For Fans of Statistics 7 Apr 2016 19:11

Have a similar solution for Java: HashMap<Integer, TreeSet<Integer>> and floor/ceiling functions. I've got execution time: 0.998 it's kinda funny ))

Alexey Vasilyev No subject [1] // Problem 1613. For Fans of Statistics 26 Mar 2019 19:44

Edited by author 28.03.2019 12:57

Hristo Nikolaev (B&W) Re: No subject // Problem 1613. For Fans of Statistics 22 Dec 2022 18:52

I used the same approach - works much faster 0.218
make sure you are not making unintended copies of the set and use a reference -

std::set<int>& current_set = m[x];
instead of
std::set<int> current_set = m[x];

Discussion of Problem 1613. For Fans of Statistics