I_love_Hoang_Yen's blog

2020 ICPC Vietnam Regional Contest on Kattis
By I_love_Hoang_Yen, history, 3 years ago, In English

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:

Details of Official Contest:

Problems prepared by:

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

UPD: The problems are now on Open Kattis

  • Vote: I like it
  • +103
  • Vote: I do not like it

Comments Comments (6)
| Write comment?
»
3 years ago, # |
  Vote: I like it +18 Vote: I do not like it

The open contest will start soon.

→ Reply
»
3 years ago, # |
  Vote: I like it 0 Vote: I do not like it

Will there be any editorial in english?

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

    There will be only Vietnamese solutions. You can ask for problems' hints here though.

    → Reply
»
3 years ago, # |
  Vote: I like it 0 Vote: I do not like it

Is there any simple way of solving Edge removal? (The MST problem)

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

    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:

    • Process edges in increasing order of weight
    • For edges of some weight w, ignore the edges connecting vertices belonging to same components using only edges with weight < w.
    • Amongst the other edges, find those connecting same components.
    → Reply
»
3 years ago, # |
  Vote: I like it 0 Vote: I do not like it

Auto comment: topic has been updated by I_love_Hoang_Yen (previous revision, new revision, compare).

→ Reply