EDIT : Never mind . It's now possible to submit solutions for grading. Here's my AC solution for task cave.
№ | Пользователь | Рейтинг |
---|---|---|
1 | tourist | 4009 |
2 | jiangly | 3831 |
3 | Radewoosh | 3646 |
4 | jqdai0815 | 3620 |
4 | Benq | 3620 |
6 | orzdevinwang | 3529 |
7 | ecnerwala | 3446 |
8 | Um_nik | 3396 |
9 | gamegame | 3386 |
10 | ksun48 | 3373 |
Страны | Города | Организации | Всё → |
№ | Пользователь | Вклад |
---|---|---|
1 | cry | 164 |
1 | maomao90 | 164 |
3 | Um_nik | 163 |
4 | atcoder_official | 160 |
5 | -is-this-fft- | 158 |
6 | awoo | 157 |
7 | adamant | 156 |
8 | TheScrasse | 154 |
8 | nor | 154 |
10 | Dominater069 | 153 |
EDIT : Never mind . It's now possible to submit solutions for grading. Here's my AC solution for task cave.
Название |
---|
the basic idea using binary search is correct I tried it and the judge gave me 100% , but your code need to be optimized because in some cases it makes more than 70,000 calls (maybe these cases are hard to find and maybe they're not exist in official test cases)
anyway today (I don't know what hour) the online competition will be opened to everyone to compete here:
http://compete.ioi2013.org/
Thanks for sharing the link.