IPCTRAIN - Editorial

solutions are not available yet!!

1 Like

@admin The links to the solution are not working! Please check it.

This question literally screamed “PRIORITY QUEUE” in my ears. One of the good questions which can be solved with knowledge of proper data type!!

Honestly, i saw priority queue code for first time in “Cooking Schedule” editorial (one of the answers told that “it can also be solved using priority queue”) and it made life so simple for me here.

My code- CodeChef: Practical coding for everyone

14 Likes

I have used Segment Trees

Code: CodeChef: Practical coding for everyone

2 Likes

community - need help to understand what is missing CodeChef: Practical coding for everyone. only 40 pts

Can anyone explain where I went wrong? 40 pts.

https://www.codechef.com/viewsolution/14561290

Hi!
The link to practice and main contest are incorrect. Please update.

can anyone explain why i m getting WA for last 2 subtask.
https://www.codechef.com/viewsolution/14601668

@lord_ozb:
You have used a double loop here which caused the time to exceed the limit.

                for(int i = 0; i < d; i++){
				int x = -1;
				int max = Integer.MIN_VALUE;
				for(int j = 0; j <= i; j++){
					if(queue[j].size() != 0){
						Trainer temp = queue[j].peek();
						if(temp.sad > max){
							max = temp.sad;
							x = j;
1 Like

inside practice, contest link is given while in contest, practice session link is given, plz interchange those at top of editorial

I solved it using set

https://www.codechef.com/viewsolution/14578928

practice link is not working…please fix this…

If I solve the above question using heaps as stated, then on popping out the trainer which doesn’t have any lecture remaining and at the very same time maintaining the sort would require the complexity O(n).
On the other hand if we just extract him from the heap and heapify using time complexity O(lg n) would disturb the sort. How do i proceed?

Links to practice and competition are backwards.

I guess I had gone mad because I couldn’t think of such a simple solution. So I did this using segment trees.
O(n*log(n)*log(n))
https://www.codechef.com/viewsolution/14497188

Can anyone help me? Author solution I seem that complexity O(N*T).Here N=100000 and T=100000 according to Constraints.How it’s passed all test case.May be something i miss.Thanks in advance.

1 Like

Links for all tutorials of July long challange for practice and contest seem to be swapped. Please consider correcting them .

Could someone please tell me why I’m a getting a TLE in my solution. I’ve used priority queue.

https://www.codechef.com/viewsolution/16505429

please explain how to implement priority queue here?? i am not able to understand plz tell @vijju123

1 Like

Need help!
My solution is passing Subtask 1 completely but it fails Subtask 2 completely.
Can anyone please help me figure it out where am i doing wrong?
Here is my link to solution.

https://www.codechef.com/viewplaintext/18941549