Только что прошел очередной этап opencup-а. Предлагаю обсудить задачи здесь.
В частности, хотелось бы узнать решения H и J.
# | User | Rating |
---|---|---|
1 | tourist | 3565 |
2 | Benq | 3540 |
3 | Petr | 3519 |
4 | maroonrk | 3503 |
5 | jiangly | 3391 |
6 | ecnerwala | 3363 |
7 | Radewoosh | 3349 |
8 | scott_wu | 3313 |
9 | ainta | 3298 |
10 | boboniu | 3289 |
# | User | Contrib. |
---|---|---|
1 | 1-gon | 199 |
2 | Errichto | 196 |
3 | rng_58 | 194 |
4 | SecondThread | 186 |
4 | awoo | 186 |
6 | Um_nik | 182 |
7 | vovuh | 178 |
8 | Ashishgup | 176 |
9 | -is-this-fft- | 173 |
9 | antontrygubO_o | 173 |
Name |
---|
Can anybody share their solution of D, I and J?
I: Firstly, if we will use songs with numbered songi1, songi2, ..., songik, then the total satisfaction will be maximized, if fi1 ≤ fi2 ≤ ... ≤ fik or fi1 ≥ fi2 ≥ ... ≥ fik. We wil sort of fi. Let's dp(i,j) — first i songs assigned and j total length of songs.
dp(i, j) = max{dp(k, j - ti) + pi - (fi - fk)2} = max{dp(k, j - ti) - fk2 + 2fkfi} + pi - fi2 Then we can use convex hull trick optimization. Code
Thanks a lot for your solution.
Hi! I'm writer of problem I! Thanks for your solving!
Hi, I'm the writer of the problem C and H. How was the problems?
I posted the solution of the problem D here.
Hi, can you show me your code for problem H? I always get TL on test 25. My code
UPD I found your code
Some of testers use min-cost-flow, and I used Hungarian method. My solution takes 180ms in worst case.
You can show my codes for all problems from here.
I'm the writer of the problem J. I posted my brief editorial for this problem as a blog entry.