The problems you can download here and you can test your solution in the ACM ICPC Live Archive.
The official scoreboards are located here.
Problems solved:
№ | Пользователь | Рейтинг |
---|---|---|
1 | tourist | 3690 |
2 | jiangly | 3647 |
3 | Benq | 3581 |
4 | orzdevinwang | 3570 |
5 | Geothermal | 3569 |
5 | cnnfls_csy | 3569 |
7 | Radewoosh | 3509 |
8 | ecnerwala | 3486 |
9 | jqdai0815 | 3474 |
10 | gyh20 | 3447 |
Страны | Города | Организации | Всё → |
№ | Пользователь | Вклад |
---|---|---|
1 | maomao90 | 174 |
2 | awoo | 165 |
3 | adamant | 161 |
4 | TheScrasse | 160 |
5 | nor | 158 |
6 | maroonrk | 156 |
7 | -is-this-fft- | 152 |
8 | orz | 146 |
9 | SecondThread | 145 |
9 | pajenegod | 145 |
juver
|
14 лет назад,
#
|
+1
Hi.
I'm wondering about you solution for problem A. Cause it has worst complexity O(n*m), both of n and m up to 105. Did you solve it onsite?
→
Ответить
|
vudduu
|
14 лет назад,
#
^
|
0
Unfortunately not resolved onsite, but i like the implementation of LCA for this problem.
I was thinking about attending to all queries at the same time.
→
Ответить
|
juver
|
14 лет назад,
#
^
|
0
Your code is obviously TLE.
→
Ответить
|
Название |
---|