vedant_vaidya_77's blog

By vedant_vaidya_77, 2 years ago, In English

What's up competitive programmers :> !

Welcome, to another installment of CP TITANS! Get ready to unleash your coding skills as we present to you CP TITANS 5.O : The Code Heist. Organized by the Developers & Coders Club, NIT Agartala, this contest promises an electrifying experience filled with thrilling challenges.

Contest Details

Date: March 19th, 2024
Time: 9:00 PM — 11:00 PM, IST (+5:30 GMT)

Penalty: 10 minutes for each wrong submission

You will be offered 6 problems and 2 hours to solve them! We tried to make interesting, beautiful, problems with strong pretests. Contest will follow ICPC guidelines.

We would like to thank :

Contest Link: Click on the below link to take part in the contest. Registration for the contest will start 6 hours before the contest. CP TITANS 5.0 : The Code Heist

This incredible event is co-/sponsored by the revered AlgoZenith.

About CP TITANS

CP TITANS is a prestigious coding competition organized by the Developers & Coders Club at NIT Agartala. With each edition, we strive to push the boundaries of innovation and excellence in the field of competitive programming. Join us as we embark on another thrilling adventure filled with coding challenges. For more information about Developers and Coders Club, NIT Agartala and updates regarding the contest, follow us on:

Mark your calendars and gear up for an unforgettable coding experience at CP TITANS 5: The Code Heist. See you all on March 19th! :)

  • Vote: I like it
  • +19
  • Vote: I do not like it

| Write comment?
»
2 years ago, hide # |
 
Vote: I like it +1 Vote: I do not like it

lets gooo

»
2 years ago, hide # |
 
Vote: I like it 0 Vote: I do not like it

This round clashes with the upcoming div.3 though

»
2 years ago, hide # |
 
Vote: I like it +1 Vote: I do not like it

Let's goo After all this wait Finally its here :) "Can't wait to witness the impressive skills and creativity of our fellow students. Let the coding journey begin, and may the best solutions prevail!"

»
2 years ago, hide # |
 
Vote: I like it 0 Vote: I do not like it

Prizes?

»
2 years ago, hide # |
 
Vote: I like it 0 Vote: I do not like it

Let the code heist begins

»
2 years ago, hide # |
Rev. 2  
Vote: I like it +1 Vote: I do not like it

Ready to tackle some tough coding problems and showcase what I've learned. Let's do this...!

»
2 years ago, hide # |
 
Vote: I like it +1 Vote: I do not like it

Lets Gooo:))))))

»
2 years ago, hide # |
 
Vote: I like it +1 Vote: I do not like it

i am excited to participate in this and i wanted to know where i am lagging in and know about my skills

»
2 years ago, hide # |
 
Vote: I like it 0 Vote: I do not like it

Finally, the long-awaited Battle Night is upon us.

»
2 years ago, hide # |
 
Vote: I like it 0 Vote: I do not like it

Okay! it's been long, I have solved any problem. Need to clean my sword.

»
2 years ago, hide # |
 
Vote: I like it 0 Vote: I do not like it

Good Luck to everyone who is participating in this contest. I hope you all enjoy the challenges and have fun in taking them on. So excited to see you guys there in the contest.

Go on Titans!!

»
2 years ago, hide # |
 
Vote: I like it +1 Vote: I do not like it

As a tester, I can assure this contest is going to be amazing!!

»
2 years ago, hide # |
 
Vote: I like it +1 Vote: I do not like it

Excited ✈️

»
2 years ago, hide # |
 
Vote: I like it +1 Vote: I do not like it

Time to flex our coding skills...hehehehe

»
2 years ago, hide # |
 
Vote: I like it +1 Vote: I do not like it

Excited

»
2 years ago, hide # |
 
Vote: I like it +1 Vote: I do not like it

Wow!!! Time to clash ;p

»
2 years ago, hide # |
 
Vote: I like it 0 Vote: I do not like it

Could have done F,but just don't how to implement seg tree correctly!!!

  • »
    »
    2 years ago, hide # ^ |
     
    Vote: I like it 0 Vote: I do not like it

    were you able to find a way to solve sample cases on paper? I was unable to do it. Can you please tell me how are there 15 subsequences in the array

    2 2 2 2

    it can be n! = 4! = 24. It got me very confused.

    • »
      »
      »
      2 years ago, hide # ^ |
       
      Vote: I like it 0 Vote: I do not like it

      Your way to count the number of subsequence is wrong.Total number of subsequence is 2^4,ignoring the null set we get (2^4)-1=15.

»
2 years ago, hide # |
 
Vote: I like it 0 Vote: I do not like it

How to D?

  • »
    »
    2 years ago, hide # ^ |
     
    Vote: I like it 0 Vote: I do not like it

    priority queue

    whenever you get your curr_sum<0 just decrease the sum by the largest negative number and decrease the count by 1

»
2 years ago, hide # |
 
Vote: I like it 0 Vote: I do not like it

hints for F?