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).
# | User | Rating |
---|---|---|
1 | tourist | 3993 |
2 | jiangly | 3743 |
3 | orzdevinwang | 3707 |
4 | Radewoosh | 3627 |
5 | jqdai0815 | 3620 |
6 | Benq | 3564 |
7 | Kevin114514 | 3443 |
8 | ksun48 | 3434 |
9 | Rewinding | 3397 |
10 | Um_nik | 3396 |
# | User | Contrib. |
---|---|---|
1 | cry | 167 |
2 | Um_nik | 163 |
3 | maomao90 | 162 |
3 | atcoder_official | 162 |
5 | adamant | 159 |
6 | -is-this-fft- | 158 |
7 | awoo | 157 |
8 | TheScrasse | 154 |
9 | Dominater069 | 153 |
9 | nor | 153 |
Name |
---|
What is TOKI?
Didn't find official site, got a e-mail from our coach. Here's the brief explanation
toki.or.id
but i didn't know they had a open contest for intl students too
I got 100-24-100. 1, 3
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
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.
I was having the reloading problem, changed Google Chrome to Firefox and the problem was fixed.
HIR180 Hi there, could you please explain your logic for Problem B ? It would be really helpful .
Thanks :)
(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 :-))
Thank a lot! I got it :)
Would you please tell, where the contest was held (website)?
Contest site
However you need to register here first
Since the Day 2 of TOKI is over, I think we can start discussing the problems.
Anyone got 300 ?
I got (0-13-100), I think that day 2 a bit harder than day 1 :(
We will publish the statements, analyses, and test data soon. Stay tuned!