BUSYMAN - I AM VERY BUSY
I AM VERY BUSY
You are actually very busy man. You have a big schedule of activities. Your aim is to do as much as activities as possible.
In the given figure, if you go to date with crush, you cannot participate in the coding contest and you can’t watch the movie. Also if you play DotA, you can’t study for the exam. If you study for the exam you can’t sleep peacefully. The maximum number of activities that you can do for this schedule is 3.
Either you can
- watch movie, play DotA and sleep peacefully (or)
- date with crush, play DotA and sleep peacefully
The first line consists of an integer T, the number of test cases. For each test case the first line consists of an integer N, the number of activities. Then the next N lines contains two integers m and n, the start and end time of each activity.
For each test case find the maximum number of activities that you can do.
1 <= T <=10
1 <= N <= 100000
0 <= start < end <= 1000000
Sample Input: (empty lines just for clarity) 3 3 3 9 2 8 6 9 4 1 7 5 8 7 8 1 8 6 7 9 0 10 4 5 8 9 4 10 5 7 Sample Output: 1 2 3
Activity Selection Problem
dont even look at the graph given in the question. Its just there to explain the question and has nothing to do with the test cases. Confused me a lot
Perfect schedule :D
I have used simple [spoiler] and BufferedReader for taking inputs....dont know why I'm getting TLE...Someone Please Help!Last edit: 2018-01-09 20:55:16
this was a nice problem and it is "simple" ad-hoc..................................if u know what to do!!!!!!!!!!
Typical [spoiler]!!Last edit: 2018-01-09 20:55:48
for java users try using faster input output techniques
AC in one go. simple adhoc, no stl required.
AC in 3rd go!! STL :)
Hey admin, all Java submissions are getting TLE.