A month after the Vietnamese National contest have passed. This Friday (Dec 11, 2020), there will be the 2020 Vietnam Regional contest. We will also have an online mirror.
Details of Online Mirror:
- Time: 9am GMT+7
- Contest link
Details of Official Contest:
- Time: 8am GMT+7
- Contest link
Problems prepared by:
- ngfam_kongu
- chemthan
- I_love_Hoang_Yen
- I_love_tigersugar
- laoriu
- khuebeo
- Prof. Do Duc Dong
Contest difficulty won't be published before the contest. You can see our previous year contests below: (note that this year may be easier, more difficult or the same difficulty):
- 2020 Vietnam National; CF announcement
- 2019 Vietnam National; CF announcement
- 2019 Vietnam Regional; CF announcement
- 2018 Vietnam National
- 2018 Vietnam Regional
- 2017 Vietnam National
- 2017 Vietnam Regional
- Link to all ICPC Vietnam contests, some with solutions
UPD: The problems are now on Open Kattis
The open contest will start soon.
Will there be any editorial in english?
There will be only Vietnamese solutions. You can ask for problems' hints here though.
Is there any simple way of solving Edge removal? (The MST problem)
Not sure what do you mean by "simple". The solution is based on Kruskal algorithm: There can be multiple MSTs, if there are some equal weight edges connecting same components. So:
Auto comment: topic has been updated by I_love_Hoang_Yen (previous revision, new revision, compare).