Why so tight constraints for A?

Revision en1, by pilliamw, 2025-07-22 20:32:06

90% of Python solutions to A will get hacked or fail systests, since using the obvious ans += s[i] in a loop or similar will immediately balloon into O(n^2). My question is, why would one even need to consider this for a Div2A? It's not like it even adds to the complexity of the problem — the difficulty and algorithm would be the same for $$$|s| \lt 10^3$$$ or something. At the very least, have a pretest that's the trivial print(1) print('A'*200000) generator I wrote in 30 seconds, instead of leaving that to the hacking phase.

(To be fair, I'm pretty salty right now because I dropped from 2000 to 8000 after hacking my A. But I still think this is a pretty serious problem, especially for an educational round where problems have equal weighting... unless the goal was to educate me to not use Python ever again :/)

Tags educational round 181, constraints, hacking

History

 
 
 
 
Revisions
 
 
  Rev. Lang. By When Δ Comment
en2 English pilliamw 2025-07-23 19:20:05 372 Tiny change: ' Expert...' -> ' Expert...\n('
en1 English pilliamw 2025-07-22 20:32:06 862 Initial revision (published)