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 | ecnerwala | 3648 |
2 | Benq | 3580 |
3 | orzdevinwang | 3570 |
4 | cnnfls_csy | 3569 |
5 | Geothermal | 3568 |
6 | tourist | 3565 |
7 | maroonrk | 3530 |
8 | Radewoosh | 3520 |
9 | Um_nik | 3481 |
10 | jiangly | 3467 |
# | User | Contrib. |
---|---|---|
1 | maomao90 | 174 |
2 | awoo | 164 |
2 | adamant | 164 |
4 | TheScrasse | 159 |
4 | nor | 159 |
6 | maroonrk | 156 |
7 | -is-this-fft- | 150 |
8 | SecondThread | 147 |
9 | orz | 146 |
10 | pajenegod | 145 |
juver
|
13 years ago,
#
|
+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?
→
Reply
|
vudduu
|
13 years ago,
#
^
|
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.
→
Reply
|
juver
|
13 years ago,
#
^
|
0
Your code is obviously TLE.
→
Reply
|
Name |
---|