snarknews's blog

NEERC-2015 mirror on Yandex.Contest
By snarknews, history, 8 years ago, In English

Mirror of NEERC-2015 will start at Sunday, December 6, 11:00 Moscow Time. Mirror will be hosted on Yandex.Contest. Enter, register and participate. Both team and individual participation are possible. Good luck on the contest!

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

Comments Comments (14)
| Write comment?
»
8 years ago, # |
  Vote: I like it +15 Vote: I do not like it

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

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

Is it possible for me to de-register from the contest on the Yandex system? I would like to enter as a team but accidentally joined as an individual.

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

    Need register your all teammates(in Yandex system) and create a team or create one account and write on it

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

      I joined as an individual by accident, so I was wondering how to de-register (I know how to register as a team). Thanks for your help though!

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

        Send the message to me with your login name, i will try to fix this issue.

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

GNU c++ 11 (4.9) g++ -O2 -fno-stack-limit -std=c++0x -x c++ file -o executable_file executable_file

Shouldn't it be -std=c++11?

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

Contest has just ended. How to solve F, G and J ?? I only solved A and E.

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

    G, at most one t_j will be not equal to the index of the largest number in a series.

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

How to solve J?I find a solution which generates the querys to limit to 2*n,but not n+500.

→ Reply
  • »
    »
    8 years ago, # ^ |
    ← Rev. 3   Vote: I like it +12 Vote: I do not like it

    I guess you already have the following algo:

    1. Use N queries to find 1 bit sequence which gives N/2
    2. Use N queries to get the final answer

    Now in step 1, instead of using those N queries, use random 500 times.

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

      I know why I got failed.Before I just used o(n+n/2) rand() operations, now instead I use o(n/2*n) rand() operations and got AC.

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

How to solve B,C,D?

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

    You may watch the video of problem analysis talk. It is in Russian, but slides are in English.

    → Reply