Miras321's blog

TOKI 2014
By Miras321, 12 years ago, In English

So, the first day of TOKI 2014 over, i think that many participants got full score, so post your solutions and scores here. Mine is (68 — 40 — 100).

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

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

What is TOKI?

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

I got 100-24-100. 1, 3

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

I had to do it at 1130PM as the other session was during school.

So I did A and C and then went to sleep :P

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

I got full score.

A:

https://ideone.com/epj1sB

B:

https://ideone.com/bU7o6J

C:

https://ideone.com/gTF8qe

By the way, reloading never stops at the site. I think something is wrong with it.

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

    I was having the reloading problem, changed Google Chrome to Firefox and the problem was fixed.

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

    HIR180 Hi there, could you please explain your logic for Problem B ? It would be really helpful .

    Thanks :)

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

      (Please see my code at first.)

      definition:

      dp[i] = (how many ways of getting i points in the question in which they made the same response)

      c[i][j] = (as you know, it means "binomial coefficient")

      ex[i] = (the number of candidates in question i)

      num = (the sequence of the number of candidates which made they are wrong in the question in which they made the different response)

      dp2[a][i] = (the sum of all the multiply of i elements from num[a...k], k is length of num)

      all the values are calculated in equal or less than O(N^2).

      Suppose Player A and Player B got i points in the question in which they made the same response.

      So, Player A got another p-i points, and Player B got another q-i points.

      How many ways of such situation?

      The answer is dp2[0][k-(p-i)-(q-i)]*dp[i]*c[p-i+q-i][p-i].

      (I suppose you'll be able to prove it easily :-))

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

Would you please tell, where the contest was held (website)?

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

Since the Day 2 of TOKI is over, I think we can start discussing the problems.

Anyone got 300 ?

→ Reply
»
12 years ago, hide # |
 
Vote: I like it +30 Vote: I do not like it

We will publish the statements, analyses, and test data soon. Stay tuned!

→ Reply