Right now IOI 2016 is in progress. I'm sure a lot of you guys will be watching, so this post was created to let you guys talk about the scores and the scoreboard in the comments :) The link to the scoreboard is here.
→ Обратите внимание
→ Лидеры (рейтинг)
| № | Пользователь | Рейтинг |
|---|---|---|
| 1 | ecnerwala | 3649 |
| 2 | Benq | 3581 |
| 3 | orzdevinwang | 3570 |
| 4 | Geothermal | 3569 |
| 4 | cnnfls_csy | 3569 |
| 6 | tourist | 3565 |
| 7 | maroonrk | 3531 |
| 8 | Radewoosh | 3521 |
| 9 | Um_nik | 3482 |
| 10 | jiangly | 3468 |
| Страны | Города | Организации | Всё → |
→ Лидеры (вклад)
| № | Пользователь | Вклад |
|---|---|---|
| 1 | maomao90 | 174 |
| 2 | awoo | 164 |
| 3 | adamant | 162 |
| 4 | TheScrasse | 159 |
| 5 | nor | 158 |
| 6 | maroonrk | 156 |
| 7 | -is-this-fft- | 151 |
| 8 | SecondThread | 147 |
| 9 | orz | 146 |
| 10 | pajenegod | 145 |
→ Найти пользователя
→ Прямой эфир
Codeforces (c) Copyright 2010-2024 Михаил Мирзаянов
Соревнования по программированию 2.0
Время на сервере: 25.04.2024 05:19:38 (i1).
Десктопная версия, переключиться на мобильную.
При поддержке
Bolivia is in the top Scoreboard for the first time in history! I have great expectations for this year! GO BOLIVIA!
Day 1 is over, and a lot of contestants have fully solved Task 1. What are your thoughts on the problems (and maybe your approaches)?
I think this solves 1:
ksmallest elements, such that their sum is less thanl, but if you tookk+1it would be larger thanu. (If you can't do that, the problem is either easy: a sum lands inside the interval; or impossible: the total element sum is smaller thanl)kelements for one of theklargest elements.When you change an element, the sum can never increase by more than
w_max - w_min <= u - l, so there is no risk of 'jumping' over the[l, u]interval.If the sum of the largest
kis still smaller thanl, then there is no solution, because the next subset in order of sum is thek+1smallest elements, which we know is too large.This solution should take time equal to sorting, which should be fine for n = 200,000.
I thought it was a fun problem :-)
your answer in good but there is a better one that is very similar instead of sorting, just take the first k elements that the sum of the first k is smaller then l and the sum of the first k+1 is higher then u. then we can use the same trick that you did for k and k+1 (if there is a solution then thre is a solution that uses k elements or k+1 elements)
You could also easily use two pointer on tge sorted array?
Yes, I think that's a nice way to accomplish the third step.
3 from China ,2 form Russia in top 5 . but how??
When are day 2 problems coming out?
When day 2 comes.
Oh, I thought today was day 2. Anyways, just a little question: how difficult are the IOI problems usually? From my point of view the first problem from day 1 would be around div1. A/B. What do you guys think?
problem 2 and 3 are much harder than Div1 A and B. a lot of those participants are red or orange and they all solve Div1 A and B easily in CF rounds of normal difficulty. but only 4 solved 2nd problem and just 1 solved the third (solved == 100 points)
Its hard and possibly impossible to compare IOI problems with CF problems due to the completely different style and format. The first problem was easy, but the other 2 were very difficult.