jAckAL_1586's blog

By jAckAL_1586, history, 7 years ago, In English

The replay of the NSU Inter-University contest is going to start on December 3, 2016 at 1200 UTC and will run for 5 hours. The contest will take place on Toph.

The setters for this contest are: ridowan007, sn23581, TarifEzaz, nfssdq, Shafaet, faiyaz26, d1xlord, Zobayer Hasan and Abdullah Al Raqibul Islam.

Good luck and have fun!

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

»
7 years ago, # |
  Vote: I like it +3 Vote: I do not like it

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

»
7 years ago, # |
  Vote: I like it 0 Vote: I do not like it

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

»
7 years ago, # |
  Vote: I like it +8 Vote: I do not like it

The contest is over. Can we get an editorial or solutions of the problems please??

»
7 years ago, # |
Rev. 5   Vote: I like it +3 Vote: I do not like it

What is the logic of problem KEEP MOVING . Can you please explain ? My logic is : I am leveling the graph , using adjacent of X as a source node . If i got a odd level node and this node has no adjacent node Gobu wins , if for all possible there has no node such that odd level node and this node has no adjacent node i am printing gobu cant win .

My code: Code

»
5 years ago, # |
Rev. 2   Vote: I like it 0 Vote: I do not like it

Can anybody give me any hints on how to solve Problem C?

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

    Try to use DSU on Tree.You can learn it here

    • »
      »
      »
      5 years ago, # ^ |
      Rev. 3   Vote: I like it 0 Vote: I do not like it

      Could you please explain in detail how you solved it with DSU on Tree? I have solved the easier version of it (Village Fair) with mapping and DSU on Tree. But I can't seem to do the same here.

»
4 years ago, # |
  Vote: I like it 0 Vote: I do not like it

Is there any tutorial for this contest , please?