adamant's blog

By adamant, history, 3 months ago, In English

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
  • Vote: I like it
  • +109
  • Vote: I do not like it

»
3 months ago, # |
  Vote: I like it +10 Vote: I do not like it

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.

  • »
    »
    3 months ago, # ^ |
      Vote: I like it +20 Vote: I do not like it

    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 '('.

    • »
      »
      »
      3 months ago, # ^ |
        Vote: I like it 0 Vote: I do not like it

      That makes a lot of sense, thanks.

»
3 months ago, # |
  Vote: I like it 0 Vote: I do not like it

is there any test data published?

thank you!

»
2 months ago, # |
Rev. 2   Vote: I like it 0 Vote: I do not like it

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)$$$

»
9 days ago, # |
  Vote: I like it 0 Vote: I do not like it

In problem G, at the time of defining the limits of K my implementation could only pass the first 6 tests when I defined it up to the root of D, however I was able to correct this by defining the limit of K as its Gaussian sum. Is having this problem normal or did I do a bad implementation?