### xug's blog

By xug, 3 days ago,

The TeamsCode Summer 2024 Virtual Programming Contest was held on Sunday, July 28. The problems were written and prepared by Yam, hyforces, oursaco, willy108, jay_jayjay, HaccerKat, xug, yash_9a3b, Red0, and superhelen. The problems (with problem credits) can be found in the Novice Gym and Advanced Gym. lunchbox solved all the problems during testing and provided valuable feedback.

Hint
Solution
Code (C++)
Code (Python)

Solution
Code

Hint
Solution
Code (C++)
Code (Python)

Hint 1
Hint 2
Solution
Code (C++)
Code (Python)

Hint 1
Hint 2
Solution
Code (C++)
Code (Python)

Hint 1
Hint 2
Hint 3
Solution
Code

Hint
Solution
Code

Hint 1
Hint 2
Solution
Code

Hint 1
Hint 2
Solution
Code

Hint 1
Hint 2
Hint 3
Solution

Hint 1
Hint 2
Hint 3
Solution
Code

Hint 1
Hint 2
Solution
Code

Solution
Code

Hint 1
Hint 2
Hint 3
Hint 4
Hint 5
Solution
Code

Hint 1
Hint 2
Hint 3
Hint 4
Solution
Code

Hint 1
Hint 2
Hint 3
Hint 4
Solution
Code

# Advanced K: The Astral Express

Hint 1
Hint 2
Hint 3
Solution
Code
Alternative Solution
Problem History
• +24

 » 3 days ago, # |   +9 .ComplaintFrame { display: inline-block; position: absolute; top: 0; right: -1.4em; } .ComplaintFrame a { text-decoration: none; color: #ff8c00; opacity: 0.5; } .ComplaintFrame a:hover { opacity: 1; } ._ComplaintFrame_popup p, ._ComplaintFrame_popup button { margin-top: 1rem; } ._ComplaintFrame_popup input[type=submit] { padding: 0.25rem 2rem; } ._ComplaintFrame_popup ul { margin-top: 1em !important; margin-bottom: 1em !important; } Problems great, W contest, wish I had 2 more minutes of time :/
 » 3 days ago, # |   +3 bruh two treap problems
•  » » 2 days ago, # ^ |   0 Actually, Advanced K has a non treap solution which I have just added.
•  » » » 2 days ago, # ^ |   +3 Is there solution code for the non-treap solution?
•  » » » » 2 days ago, # ^ |   +3 Here.
•  » » » » » 42 hours ago, # ^ |   +3 thanks lunchbox orz
•  » » » 33 hours ago, # ^ |   +3 I hate newbies
 » 2 days ago, # |   +3 Problem history for Advanced K has 2 LGM and 1 expert, but that expert has the name of rainboy
 » 32 hours ago, # |   0 I am finding it difficult to understand the solution of F as I am not too comfortable with Iterative DP, so, I tried running bruteforce with my code and the given solution code. Then I stumbled across this two testcases. TestCase 1:6 4 0000 1100 1010 0111 1101 0011  Trouble that I am facing:The given solution code gives answer as 1. But I couldn't understand why the solution should be 1,as we need to toggle two times to reach to the bottom right cell by applying operation on Row 1 and Row 3. So, I came up with the conclusion that, Toggling of the first Top-left cell doesn't count as the problem statement said, U r starting from the top-left cell. But then I am stumbled across testcase 2. TestCase 2:3 4 1001 1000 1000  New Trouble that I faced:The given solution code gives answer as -1. But the conclusion that I came up from the first testcase that, Toggling of the first Top-left cell doesn't count makes the answer of this testcase as 3 by applying operation on each of the three rows.I would love to hear from anyone who could help me to solve my problem. Thanks for taking the time to read.
•  » » 32 hours ago, # ^ |   0 Your conclusion that the toggling of the top-left cell doesn't matter is wrong. The actual reason why the answer to your first test case is 1 is that the test cases are never supposed to have a 0 in the top-left cell, so the given solution code gives a weird answer.
•  » » » 31 hour(s) ago, # ^ |   0 Thanks for replying and now I got that.