CEPC08B - SkyScrapers
In a seaside village, there is an avenue of skyscrapers. Each skyscrapers is 100m wide and has certain height. Due to very high price of parcels, any two consecutive skyscrapers are adjacent. The avenue lies close to the beach so the street is exactly at the sea level. Unfortunately, this year, due to the global warming, the sea level started to increase by one meter each day. If the skyscraper height is no greater than the current sea level, it is considered ﬂooded. A region is a maximal set of non-ﬂooded, adjacent skyscrapers. This term is of particular importance, as it is suﬃcient to deliver goods (like current, carrots or cabbages) to any single skyscraper in each region. Hence, the city major wants to know how many regions there will be in the hard days that come. An example of an avenue with 5 skyscrapers after 2 days is given below.
The input contains several test cases. The ﬁrst line contains an
(t ≤ 15) denoting the number
of test cases. Then t test cases follow. Each of them begins with a line containing two numbers n and
d (1 ≤ n, d ≤ 106), n is the number of skyscrapers and d is the number of days which the major wants
to query. Skyscrapers are numbered from left to right. The next line contains n integers h1, h2, . . . , hn
where 1 ≤ hi ≤ 109 is the height of skyscraper i. The third line of a single test case contains d numbers
tj such that 0 ≤ t1 < t2 < . . . < td−1 < td ≤ 109.
For each test case output d numbers r1, r2, . . . , rd, where rj is the number of regions on day tj .
Input: 2 3 3 1 2 3 1 2 3 5 3 1 3 5 1 3 0 2 4 Output: 1 1 0 1 2 1
|Added by:||Robert Rychcicki|
|Cluster:||Cube (Intel Pentium G860 3GHz)|
|Languages:||All except: ERL JS NODEJS PERL 6 VB.net|
|Resource:||Central European Regional Contest 2008|
O(NlogN) passes with I/O optimisations! Strict time limit!
Using scanf and STL sort, I get TLE.
My (n log n) passed only after IO optimizations.
I got tle with C++ 22.214.171.124 but ac with C++ 4.3.2!
I'm having TLE all the time. Even when removing all my code (only data input functions remaining). There must be sth wrong with their input.
so, dont sort :)
Cause, the right sentence is: "I have tle cause I sort." ;)
Why limits are so hard?? I have sort and tle :/Last edit: 2009-06-02 04:53:30
Limits are very stict: my first solution, with my own input reading and using qsort() had TLE. It get finally passed after replacing qsort() with sort().