Hello everyone,
As the title suggests, this is my first problem on Codeforces, and it's a medium to medium-hard challenge. I'm preparing this because I'm about to become my school's coach. If you have some time, I'd greatly appreciate it if you could take a look and provide me with some feedback.
Thank you! Love you all <3.
https://codeforces.me/contestInvitation/ccca44d49a984409344ede5f912629800ea6e003
P/S : I hate to say this as you've probably heard this a lot C:, but I apologize for my poor use of English in the problem statement. C:
Solution:
Tutorial 1
Tutorial 2
Auto comment: topic has been updated by peacebringer167 (previous revision, new revision, compare).
Auto comment: topic has been updated by peacebringer167 (previous revision, new revision, compare).
thanatos not thatanos
I am in no position to give a really valuable feedback, but for me as a newbie i think the problem has a really good foundation, but the problem statment was a bit confusing for me, like are the horsemen supposed to do damage to the wall thus decreasing it, or change it's the walls value and set it to x, or increment it, it would be nice if the statment made that clear, i just made a pastebin page just to provide how an average 1000 rated user would understand the problem and i spent well over an hour on that and still didn't understand how to get the desired output. thanks for the problem and good luck with coaching ^ _ ^
I agree the statement is a quite confusing. The statement could've been more clear, and describe the queries more directly. However it's intentionally misleading :>, because my country's national Olympiad is full of misleading statements like this :>. Anyway thank you for your support!!. Love you <3
This problem is a nice one, I've enjoyed it. However, here are some possible issues of the statement:
First of all, use italic instead of TeX for horse names, it is a small problem but it makes the statement pretty hard to read for me.
Also for problems with long statements, it's best to provide a simplified statement (that is usually provided in OI style contests in my country).
In your first operation you mistyped
<=
to<
and that might be why it's wrong.btw, your solution will get TLE since $$$1\le n, q\le 10^5$$$, one correct solution would be
process the queries offline with a segment tree
You are completely right !
and yeah the idea you provided makes a lot more sense than mine, and i'm not really sure how to emplement that, but thanks for the info, i'll look into it > _ <
Thank you for pointing out the typos and errors. But
A segment tree (lazy propagation) with offline queries can comfortably solve this problem in under 1s with $$$n,q <= 10^5$$$ though
I'll add the solutions soon :><>
Thank you sm <3
Auto comment: topic has been updated by peacebringer167 (previous revision, new revision, compare).