Hi everyone!
Today, ETH Zürich, EPFL and the University of Lugano selected their teams for SWERC using the individual contest prepared by BenniKartefla, Lebossle, MihneaDAVID, OhLee, SnowfuryGiant, adamant, alagorithmet, ghassan, johannesk, majk, monika.
Special thanks to Suika_predator, fallleaves01, Sugar_fan, Okrut, AsiBasi, atli164 and Tagl for testing it!
The contest is now uploaded to the Codeforces gym at 2023-2024 ICPC, Swiss Subregional.
Congratulations to the newly formed ICPC teams! Contest tutorial:
A
B
C
D
E
F
G
H
I
J
K
For problem E, Do you know why it's correct to just ignore the '?' characters? My teammates passed this way which makes me feel weird.
If you remove the longest correctly parenthesised subsequence, the remaining string will look like ))...)((...(. You can replace all '?' which are before the first remaining '(' by ')', and others by '('.
That makes a lot of sense, thanks.
is there any test data published?
thank you!
no
I think there is a typo in the editorial of B, line :
$$$end[d] = max(0, max(end[2d], end[2d+1]) + MAX(S))$$$
should be
$$$end[d] = max(0, max(end[2d], end[2d+1])) + MAX(S)$$$
in the editorial of B,when the multiset at d is empty,just let end[d]=0 and update ans[d](it bother me for a while)