CF Round-961(B1 and B2 :Bouquet-Easy nd Hard Version)

Revision en1, by amlanbiswal10, 2024-07-24 09:04:25

Submission for B2=> https://codeforces.net/contest/1995/submission/272253389

Submission for B1=> https://codeforces.net/contest/1995/submission/272164317

Guys...these are the submissions for B1 and B2. I used a map to store the frequency of each no.of petals in B1, but in B2 this is already given as array C(quantity of flowers).That's the only trivial change I made . Rest of the code comprising of implementation of binary search and priority_queue remains same.

please help me figure out why is it getting accepted in B1 but gives wrong ans in B2 in Test case 3 whereas I don't find any difference in the logic ....

Thank you...

History

 
 
 
 
Revisions
 
 
  Rev. Lang. By When Δ Comment
en3 English amlanbiswal10 2024-07-24 09:07:15 0 (published)
en2 English amlanbiswal10 2024-07-24 09:06:11 7 Tiny change: 'sion/272253389 \n\nSubmis' -> 'sion/272256994\n\nSubmis'
en1 English amlanbiswal10 2024-07-24 09:04:25 701 Initial revision (saved to drafts)