### Guendabiaani's blog

By Guendabiaani, history, 4 years ago,

Today I participated in the Div.2 Round 632 and solved all the 1200 level problems of sorting and binary search from my list. I will write the main takeaways for self reference.

Div. 2 Round 632:

Contest experience

Sorting:

492B - Vanya and Lanterns

Solution

519B - A and B and Compilation Errors

Solution

456A - Laptops

Solution

1294B - Collecting Packages

Solution

977C - Less or Equal

Solution

Binary Search:

755B - PolandBall and Game

Solution

911B - Two Cakes

Solution

1260B - Obtain Two Zeroes

Solution

743B - Chloe and the sequence

Solution

1221C - Perfect Team

Solution
• +15

| Write comment?
 » 4 years ago, # | ← Rev. 5 →   0 In the problem 519B — A and B and Compilation Errors, there is an easier way to solve it. There is a way to use map too, my code===========================================================In the problem 456A — Laptopsthere is a simpler way to solve it, if there is exist a pair with different number, we output "Happy Alex", My code===========================================================In the problem 775B — PolandBall and Gameyou can use another formula `cout << (n + map.size() % 2 > m ? "YES" : "NO")and it is really simple to implement by set or map===========================================================In the problem 1260B — Obtain Two ZeroesIt is fast to use math but can still do binary_search like this
•  » » 4 years ago, # ^ |   0 Thanks for the clever alternatives :)
•  » » » 4 years ago, # ^ |   +5 Thanks, do you want to join my team so that we could take part in virtual contest together ?