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:
# | User | Rating |
---|---|---|
1 | tourist | 3856 |
2 | jiangly | 3747 |
3 | orzdevinwang | 3706 |
4 | jqdai0815 | 3682 |
5 | ksun48 | 3591 |
6 | gamegame | 3477 |
7 | Benq | 3468 |
8 | Radewoosh | 3462 |
9 | ecnerwala | 3451 |
10 | heuristica | 3431 |
# | User | Contrib. |
---|---|---|
1 | cry | 167 |
2 | -is-this-fft- | 162 |
3 | Dominater069 | 160 |
4 | Um_nik | 158 |
5 | atcoder_official | 157 |
6 | Qingyu | 156 |
7 | adamant | 151 |
7 | djm03178 | 151 |
7 | luogu_official | 151 |
10 | awoo | 146 |
![]() juver
|
14 years ago,
#
|
![]() ![]() 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?
→
Reply
|
![]() vudduu
|
14 years ago,
#
^
|
![]() ![]() 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.
→
Reply
|
![]() juver
|
14 years ago,
#
^
|
![]() ![]() Your code is obviously TLE.
→
Reply
|
Name |
---|