I'm posting this blog so we can discuss the solutions to the problems of 2024 ICPC Latin America Championship
Link to the contest: https://codeforces.net/gym/105053
This is the final scoreboard: https://scorelatam.naquadah.com.br/pda24/
→ Pay attention
→ Top rated
| # | User | Rating |
|---|---|---|
| 1 | tourist | 3985 |
| 2 | jiangly | 3814 |
| 3 | jqdai0815 | 3682 |
| 4 | Benq | 3529 |
| 5 | orzdevinwang | 3526 |
| 6 | ksun48 | 3517 |
| 7 | Radewoosh | 3410 |
| 8 | hos.lyric | 3399 |
| 9 | ecnerwala | 3392 |
| 9 | Um_nik | 3392 |
→ Top contributors
| # | User | Contrib. |
|---|---|---|
| 1 | cry | 170 |
| 2 | maomao90 | 162 |
| 2 | Um_nik | 162 |
| 4 | atcoder_official | 160 |
| 5 | djm03178 | 158 |
| 5 | -is-this-fft- | 158 |
| 7 | adamant | 154 |
| 7 | Dominater069 | 154 |
| 9 | awoo | 153 |
| 10 | luogu_official | 152 |
→ Find user
→ Recent actions
Codeforces (c) Copyright 2010-2024 Mike Mirzayanov
The only programming contests Web 2.0 platform
Server time: Dec/26/2024 17:32:52 (j2).
Desktop version, switch to mobile version.
Supported by
Auto comment: topic has been updated by CarlosDaniel111 (previous revision, new revision, compare).
Hint for problem F?
Some hints for problem F:
Consider how giving blueprints to Alice and Bob will affect the DIFFERENCE in their heights.
You want the difference to be 0, so you either need to add or subtract each G, and add or subtract some multiple of each R, and you want to get to 0.
Imagine the positive and negative Gs add up to k. Can you add or subtract copies of different Rs to get to 0? Suppose the rs to choose from are 4 and 6. What possible ks can you reach?
You can hit any k that's a multiple of 2. Specifically, any k that's a multiple of gcd(4, 6).
Notice that the sum of ground floors is bounded. There's an algorithm called 0/1 knapsack which tells you all the possible sums you could have if you take 0 or 1 copy of each element.
Can anyone please describe me the t part of problem A ?
Hint for problem G?
Solution sketches can be found here.