Solutions of ACM-ICPC Latin American Contests
Contest link: https://codeforces.com/gym/102346
Editorial: https://blog.csdn.net/a1214034447/article/details/102818357
| ID | Problem | Contents | Resources | Related problems |
|---|---|---|---|---|
| A | Artwork | Connected components (DFS or DSU) | ||
| B | Buffoon | Ad-hoc | ||
| D | Denouncing Mafia | Tree DP | ||
| G | Getting Confidence | Assigment problem - Hungarian | https://github.com/xashru/competitive-programming/blob/master/Library/Hungarian.cpp | |
| H | Hour for a Run | Ad-hoc | ||
| L | Less Coin Tosses | Ad-hoc math | ||
| M | Maratona Brasileira de Popcorn | Binary search |
Contest link: https://codeforces.com/gym/101908
| ID | Problem | Contents | Resources | Related problems |
|---|---|---|---|---|
| A | Slackline Adventure | Möbius inversion | ||
| B | Marbles | Nim, Sprague-Grundy Theorem | https://cp-algorithms.com/game_theory/sprague-grundy-nim.html | |
| C | Pizza Cutter | Ordered Set | https://www.spoj.com/problems/INVCNT/ | |
| D | Unraveling Monty Hall | Ad-hoc | ||
| E | Enigma | Ad-hoc | ||
| F | Music Festival | Dynamic Programming - Bitmask | https://usaco.guide/gold/dp-bitmasks?lang=cpp | https://cses.fi/problemset/task/1653 |
| G | Gasolina | Binary Search + Maximum Flow | https://cp-algorithms.com/graph/dinic.html | |
| H | Police Hypothesis | Heavy-Light Decomposition + Segment Tree + KMP | ||
| I | Switches | Ad-hoc | ||
| J | Joining Capitals | Steiner Tree Problem | ||
| K | Kepler | Basic geometry + Graph traversal | ||
| L | Subway Lines | Lowest Common Ancestor | ||
| M | Modifying SAT | Gaussian Elimination modulo 2 |