I_love_Hoang_Yen's blog

[GYM] ACM ICPC Vietnam National Second Round
By I_love_Hoang_Yen, 10 years ago, In English

Hi everyone!

If you still remember, 5 months ago I added the ACM ICPC Vietnam National 1st Round into Gym.

This weekend, we're going to add the 2nd round from our National contest. We hope that this will help ease your hunger for contests :)

  • The contest was designed to be harder than last time
  • It consists of around 10 problems, and lasts for 5 hours.
  • Teams are welcomed.
  • Normal ACM rules is used.
  • To those who's going to ask if it is rate): No contest from gym is rated.

The gym contest is prepared by laoriu, khuebeo, ngfam_kongu and me, I_love_Hoang_Yen. The problem setters are Vietnamese professors and some ex-ACM ICPC competitors.

We hope that there's going to be at least one interesting problem for everyone. Please join & have fun with us! May luck be with you :)

UPD: Contest is over. This is scoreboard of real contest: link

UPD2: Solution to some problems: link

UPD3: It turns out that the author's solution for problem F is wrong. I'm very sorry for that and I'm trying to fix it. I hope that it didn't make too much impact for any team. The bug was found by team Orz xyz111 (apia, PoPoQQQ1, alpq654323). You are really awesome, not only solve the problem, but solved it despite the fact that the test might be wrong.

UPD4: Solutions of F has been rejudged. It looks like the mentioned team was the only team who was affected. I am very sorry for that.

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

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

Thank you, that's great!

→ Reply
»
10 years ago, # |
← Rev. 2   Vote: I like it +8 Vote: I do not like it

Nice...

But harder than last time???!!!

Do you want to kill us?

→ Reply
»
10 years ago, # |
  Vote: I like it +5 Vote: I do not like it

Great!! Thanks for these competitions!

→ Reply
»
10 years ago, # |
← Rev. 2   Vote: I like it +4 Vote: I do not like it

will be there be editorial for this contest ? Because most of the gym contest lack editorials !!

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

nice!

→ Reply
»
10 years ago, # |
  Vote: I like it -19 Vote: I do not like it

tốt quá :))

→ Reply
»
10 years ago, # |
← Rev. 2   Vote: I like it +69 Vote: I do not like it

Lol, I've read "whoreadstaganyway" firstly as "whore-adds-tag-anyway" :P

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

    I know that feel >_>

    → Reply
  • »
    »
    10 years ago, # ^ |
    ← Rev. 2   Vote: I like it -11 Vote: I do not like it

    Judging by the number of upvotes you have so did many people.

    At the time of my first comment the number of upvotes he had was the greatest integer smaller than 70.

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

yeeeeeeeeeeeees

→ Reply
»
10 years ago, # |
  Vote: I like it -22 Vote: I do not like it

I've seen this problem A before

Please design problems carefully

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

Can anyone give me a hint for E. I have no idea even in the case all queries is for range [1..n].

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

    I handled all prime factors separately. So essentially I had a bunch of BITs, each one keeping exponents for a different prime factor, and multiplying/dividing is just adding/subtracting from the exponents.

    → Reply
»
10 years ago, # |
  Vote: I like it +8 Vote: I do not like it

Very impressed with the creativity for problem H...

→ Reply
  • »
    »
    10 years ago, # ^ |
      Vote: I like it +2 Vote: I do not like it

    Well, I'm sorry & I'm also disappointed.

    The contest was not to select teams to WF (it was not regional), it was mostly to help university decides relative ranks of their teams so they can choose which teams go to regionals. So probably problem setters decided that it was OK to give an existing problem.

    → Reply