Теперь раздел EDU доступен и на английском языке ×

Автор ICPCNews1, история, 11 дней назад, По-английски,

text UPDATED

Dear participants!

Congratulations on joining the ICPC 2020 Graph Mining Challenge powered by Huawei! All were truly amazed by the participation and quality of the solutions. Congratulations to all of the winners! You will be contacted soon about your prizes.

The competition was so fierce that ICPC U and Huawei have decided to keep the fun going by starting a new, one-week challenge with all new prizes. The problem and graphs are the same, so you can build on your previous success. All are encouraged to participate in this challenge. You may only win one prize from the entire ICPC Graph Mining Challenge events (all combined). If you place in multiple challenges, you will be able to pick the prize you prefer.

Join ICPC Challenge: Marathon

Many of you might have been following the Challenge tutorials on ICPC U page. If you didn’t — we’re delighted to invite you to do so in order to sharpen your problem-solving skills and applying it during this additional ICPC challenge week.

As always, ICPC U invites everyone to Train, Practice, and Perform!

 
 
 
 
  • Проголосовать: нравится
  • +125
  • Проголосовать: не нравится

»
11 дней назад, # |
Rev. 3   Проголосовать: нравится +44 Проголосовать: не нравится

What just happened? Is it going to be the same task?

How will the prizes be distributed amongst top competitors? I guess it's not really fun to get two identical phones. Also you should've told not to discuss any solutions, now many people know each others' solutions.

»
11 дней назад, # |
  Проголосовать: нравится +191 Проголосовать: не нравится

:)

»
11 дней назад, # |
  Проголосовать: нравится 0 Проголосовать: не нравится

But will participants of 3-hour challenge still receive prizes?

»
11 дней назад, # |
  Проголосовать: нравится +26 Проголосовать: не нравится

Are contestants who already won prizes would be out of competition in this contest?

»
11 дней назад, # |
  Проголосовать: нравится +44 Проголосовать: не нравится

Stupid question, but are participants allowed to cooperate?

»
11 дней назад, # |
  Проголосовать: нравится 0 Проголосовать: не нравится

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

»
10 дней назад, # |
  Проголосовать: нравится -10 Проголосовать: не нравится

I cannot download problem statement ....Can you give me an alternative

  • »
    »
    6 дней назад, # ^ |
      Проголосовать: нравится 0 Проголосовать: не нравится

    Go to codeforces.com/contest/{id}/problems/ and Ctrl+P the page , you should have option to save page as PDF on Chrome and FF based browser

»
7 дней назад, # |
  Проголосовать: нравится +14 Проголосовать: не нравится

Many of you might have been following the Challenge tutorials on ICPC U page. If you didn’t — we’re delighted to invite you to do so in order to sharpen your problem-solving skills and applying it during this additional ICPC challenge week.

Is there any Challenge tutorial on that page? Even Endagorion's stream is private now, which is a bit unfair to people who didn't watch him.

»
7 дней назад, # |
  Проголосовать: нравится +37 Проголосовать: не нравится

Please, make contest a little bit shorter (for about 1 hour). It intersects with Global Round 9 for 55 minutes.

»
4 дня назад, # |
  Проголосовать: нравится +26 Проголосовать: не нравится

The contest is over now, so, can someone from top share main ideas of algorithm? Thanks in advance

  • »
    »
    4 дня назад, # ^ |
      Проголосовать: нравится +50 Проголосовать: не нравится

    My best solutions came from applying the Leiden algorithm adapted to fit the objective function, coupled with some local search/simulated annealing to get a few dozen extra points.

    • »
      »
      »
      3 дня назад, # ^ |
        Проголосовать: нравится +35 Проголосовать: не нравится

      For a simpler solution, I found that greedily creating singleton clusters to maximize regularization on the partition given by the original Leiden algorithm works well also.

    • »
      »
      »
      3 дня назад, # ^ |
        Проголосовать: нравится +16 Проголосовать: не нравится

      What does your function for MergeNodesSubset for Leiden look like? Did you use the γ in the pseudo-code and what is that, is it a function?

      Also what was your initial temperature for SA and how did you decrease the temperature, I didn't get great scores with it compared to hill climbing and if I did it took a long time. I used temperature = 1 and decreased it linearly by .1 or .01 (and my formula for the probability looked like this: exp(delta*10000/temperature)).

      • »
        »
        »
        »
        3 дня назад, # ^ |
          Проголосовать: нравится +14 Проголосовать: не нравится

        I just used an existing implementation and added some extra bookkeeping data to be able to recompute the regularization quickly. The $$$\gamma$$$ is the "resolution" and is just a parameter for the objective function (for modularity, $$$\gamma = \frac1{2|E|}$$$).

        For the local search, let $$$S$$$ be the current best score and $$$S'$$$ be the score after a proposed change. If $$$S > S'$$$, my algorithm would accept the change with probability $$$\min(0.02, \exp(10(S'-S))$$$. The proposed change was the best change among all possible moves for 55 randomly sampled nodes. There's no reason for choosing any of these parameters, it just worked well enough in practice.

  • »
    »
    3 дня назад, # ^ |
    Rev. 2   Проголосовать: нравится +53 Проголосовать: не нравится

    I published post with some ideas link

»
3 дня назад, # |
  Проголосовать: нравится +24 Проголосовать: не нравится

Can you please keep a version of ICPC open for practice .

Thanks a lot!

»
33 часа назад, # |
Rev. 2   Проголосовать: нравится +62 Проголосовать: не нравится

how soon winners will get their prizes?? ICPCNews1

  • »
    »
    18 часов назад, # ^ |
      Проголосовать: нравится +44 Проголосовать: не нравится

    And will you pay the import tax and duties? ICPCNews1 Last time I got a prize from a Huawei contest, I was billed 189 USD in import tax and administration fees from DHL after receiving the package. There's 25% import tax in Norway, and DHL sends the bill to the receiver if the sender doesn't take care of it. I might decline the prize rather than paying the bill.