|| ||Code Submission Evaluation System
CSES Problem Set
Movie Festival Queries
Task | Statistics
CSES - Movie Festival QueriesCSES - Movie Festival Queries
|Time limit:||1.00 s
||Memory limit:||512 MB|
In a movie festival, $n$ movies will be shown. You know the starting and ending time of each movie.
Your task is to process $q$ queries of the form: if you arrive and leave the festival at specific times, what is the maximum number of movies you can watch?
The first input line has two integers $n$ and $q$: the number of movies and queries.
After this, there are $n$ lines describing the movies. Each line has two integers $a$ and $b$: the starting and ending time of a movie.
Finally, there are $q$ lines describing the queries. Each line has two integers $a$ and $b$: your arrival and leaving time.
Print the maximum number of movies for each query.
- $1 \le n,q \le 2 \cdot 10^5$
- $1 \le a < b \le 10^6$